jozefg / miniprlLinks
A small implementation of a proof refinement logic.
☆50Updated 7 years ago
Alternatives and similar repositories for miniprl
Users that are interested in miniprl are comparing it to the libraries listed below
Sorting:
- being a thing I build on a Saturday☆28Updated 7 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Where my everyday research happens☆53Updated 2 weeks ago
- Automatically exported from code.google.com/p/trellys☆47Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆84Updated 7 years ago
- ☆45Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Web based opetopic editor☆35Updated 8 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆31Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- System F in coq.☆19Updated 10 years ago