umazalakain / CoContextualPiLinks
☆11Updated 3 years ago
Alternatives and similar repositories for CoContextualPi
Users that are interested in CoContextualPi are comparing it to the libraries listed below
Sorting:
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- my phd thesis☆26Updated 9 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆21Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- ☆16Updated 3 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- TypeScript client for Idris IDE-mode.☆11Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Implementation for ICFP 2020 paper☆52Updated 3 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ☆29Updated 2 years ago
- ☆12Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆18Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago