gmalecha / coq-interaction-treesLinks
Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
☆18Updated 7 years ago
Alternatives and similar repositories for coq-interaction-trees
Users that are interested in coq-interaction-trees are comparing it to the libraries listed below
Sorting:
- ☆11Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- 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
- Mtac in Agda☆28Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- ☆18Updated 3 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 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 9 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆28Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- IO using sized types and copatterns☆36Updated 4 years ago