Saizan / miller
Miller/pattern unification in Agda
☆64Updated 11 years ago
Alternatives and similar repositories for miller:
Users that are interested in miller are comparing it to the libraries listed below
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- The Prettiest Printer☆35Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- ☆22Updated 8 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- ☆84Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- ☆26Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Web based opetopic editor☆35Updated 4 months ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago