RedPRL / sml-dependent-lcf
A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
☆16Updated 7 years ago
Alternatives and similar repositories for sml-dependent-lcf:
Users that are interested in sml-dependent-lcf are comparing it to the libraries listed below
- ☆11Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 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☆33Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- ☆23Updated 8 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- F-omega with interval kinds mechanized in Agda☆13Updated 7 months ago
- NbE course @ Chalmers☆28Updated 5 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Formalizing nbe in agda☆30Updated 12 years ago