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:
- Where my everyday research happens☆55Updated last week
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- ☆47Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- The Prettiest Printer☆35Updated last year
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago