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 3 weeks ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Mtac in Agda☆28Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Quasi-quoting library for agda☆18Updated last year
- Coq library for handling names☆19Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- ☆18Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- NbE course @ Chalmers☆28Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- ☆16Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago