plum-umd / cgcView external linksLinks
Constructive Galois connections
☆36Mar 26, 2018Updated 7 years ago
Alternatives and similar repositories for cgc
Users that are interested in cgc are comparing it to the libraries listed below
Sorting:
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated this week
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 8 months ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- Real number computation software☆129Aug 16, 2022Updated 3 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆77Jul 30, 2018Updated 7 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- A cost-aware logical framework, embedded in Agda.☆75Nov 7, 2025Updated 3 months ago
- Common Lisp package providing an SMT object supporting SMT-LIB communication over input and output streams☆20Mar 24, 2022Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated 3 weeks ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Mar 29, 2023Updated 2 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10May 31, 2022Updated 3 years ago
- An automated theorem prover for intuitionistic propostional logic☆14Sep 21, 2020Updated 5 years ago
- ☆12May 9, 2015Updated 10 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 2 months ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- A Rust hashconsing library.☆38Jul 15, 2024Updated last year
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- Machine-checked Agda formalization for the ILC project☆15Apr 6, 2018Updated 7 years ago