RedPRL / sml-dependent-lcfLinks
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
Sorting:
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 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 9 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆11Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- NbE course @ Chalmers☆28Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago