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:
- a version of the 2048 game for Coq☆22Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- ☆11Updated 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 3 months ago
- Mtac in Agda☆28Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Coq library for handling names☆19Updated 3 years ago
- ☆16Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆18Updated 3 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalizations of strong normalization proofs☆35Updated 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 9 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago