david-christiansen / epigram1Links
A version of Epigram 1 that can run with newer GHCs
☆54Updated 8 years ago
Alternatives and similar repositories for epigram1
Users that are interested in epigram1 are comparing it to the libraries listed below
Sorting:
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Where my everyday research happens☆55Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Formalizing nbe in agda☆32Updated 12 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- second-order abstract syntax☆31Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 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 Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Specification of Agda.☆25Updated 6 years ago
- Work in progress☆38Updated 5 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago