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
Related projects: ⓘ
- ☆11Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- ☆21Updated 2 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated 10 months ago
- Mtac in Agda☆28Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 5 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 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 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- ☆23Updated this week
- ☆16Updated 2 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- ☆26Updated last year
- Coq library for handling names☆18Updated 2 years ago
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- ☆16Updated 2 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 10 months ago
- Quasi-quoting library for agda☆16Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- NbE course @ Chalmers☆28Updated 4 years ago
- ☆18Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago