pedagand / typechecker-evolutionLinks
The Evolution of a Typechecker
☆54Updated 6 years ago
Alternatives and similar repositories for typechecker-evolution
Users that are interested in typechecker-evolution are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Where my everyday research happens☆53Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆23Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Logical relations proof in Agda☆26Updated 10 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- The Prettiest Printer☆34Updated last year