jozefg / miniprlLinks
A small implementation of a proof refinement logic.
☆50Updated 8 years ago
Alternatives and similar repositories for miniprl
Users that are interested in miniprl are comparing it to the libraries listed below
Sorting:
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- second-order abstract syntax☆31Updated 3 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Where my everyday research happens☆54Updated last month
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆45Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago