gmalecha / coq-interaction-treesLinks
Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
☆18Updated 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
Sorting:
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆11Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Mtac in Agda☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆19Updated 3 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- Logical relations proof in Agda☆26Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A discouraging story.☆15Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- my phd thesis☆26Updated 9 months ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year