inc-lc / ilc-agda
Machine-checked Agda formalization for the ILC project
☆15Updated 6 years ago
Related projects: ⓘ
- being bits and pieces I'm inclined to leave lying around☆45Updated last month
- NbE course @ Chalmers☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 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
- ☆23Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- https://metaborg.github.io/mj.agda/☆12Updated 3 years ago
- ☆11Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 3 years ago
- Formalizing nbe in agda☆30Updated 11 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Where my everyday research happens☆53Updated 3 weeks ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆17Updated 11 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years 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
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 5 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆21Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- ☆21Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 4 years ago
- Logical relations proof in Agda☆24Updated 9 years ago