jozefg / miniprl
A small implementation of a proof refinement logic.
☆50Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for miniprl
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Where my everyday research happens☆53Updated last week
- The Evolution of a Typechecker☆54Updated 5 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Agda programming with holes☆26Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Web based opetopic editor☆34Updated last month
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- ☆82Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- Work in progress☆34Updated 4 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- ☆45Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆16Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Formalizing nbe in agda☆30Updated 11 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