sweirich / corespecLinks
A Specification for Dependent Types in Haskell (Core)
☆64Updated 3 years ago
Alternatives and similar repositories for corespec
Users that are interested in corespec are comparing it to the libraries listed below
Sorting:
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Where my everyday research happens☆55Updated last week
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Implementing grep in Agda☆33Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- ☆26Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- ☆84Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- The Prettiest Printer☆35Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆126Updated last year
- Miller/pattern unification in Agda☆67Updated last month
- IO using sized types and copatterns☆36Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- ☆47Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago