jonsterling / sml-logical-frameworkLinks
Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought
☆14Updated 8 years ago
Alternatives and similar repositories for sml-logical-framework
Users that are interested in sml-logical-framework are comparing it to the libraries listed below
Sorting:
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆11Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆18Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- what I did on my holidays☆12Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆16Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- ☆17Updated 3 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago