sweirich / trellysLinks
Automatically exported from code.google.com/p/trellys
☆47Updated 6 years ago
Alternatives and similar repositories for trellys
Users that are interested in trellys are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Miller/pattern unification in Agda☆67Updated 2 weeks ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Where my everyday research happens☆55Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆112Updated 3 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Work in progress☆38Updated 5 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- ☆84Updated 8 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- The Prettiest Printer☆35Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- ☆47Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- second-order abstract syntax☆31Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago