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:
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- ☆11Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 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 last month
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Category-theoretic domain theory.☆9Updated 9 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
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Verified NbE via gluing in Agda☆11Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 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☆22Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆18Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆16Updated 3 years ago
- Coq library for handling names☆19Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago