gmalecha / coq-interaction-trees
Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
☆17Updated 6 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
- ☆11Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- ☆16Updated 3 years ago
- Mtac in Agda☆28Updated 3 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 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
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆15Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆23Updated 9 months 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
- Research material of Erik Palmgren (1963–2019)☆20Updated last week
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆18Updated 3 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- ☆18Updated 2 years ago