jonsterling / sml-logical-framework
Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought
☆14Updated 7 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
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A discouraging story.☆15Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆11Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- ☆18Updated 2 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 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
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- what I did on my holidays☆12Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- NbE course @ Chalmers☆28Updated 4 months ago
- ☆17Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago