sweirich / corespec
A Specification for Dependent Types in Haskell (Core)
☆65Updated 2 years ago
Related projects: ⓘ
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆68Updated 2 years ago
- The Evolution of a Typechecker☆51Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Where my everyday research happens☆53Updated 3 weeks ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 8 months ago
- Implementing grep in Agda☆32Updated 3 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- The Prettiest Printer☆35Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Mtac in Agda☆28Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Agda programming with holes☆26Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 5 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- System F in coq.☆19Updated 9 years ago
- Specification of Agda.☆25Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago