A nano "theorem prover".
☆63Feb 15, 2019Updated 7 years ago
Alternatives and similar repositories for ESCoC
Users that are interested in ESCoC are comparing it to the libraries listed below
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Apr 5, 2017Updated 8 years ago
- Base Formality libraries☆10Mar 4, 2019Updated 7 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- A minimal proof language.☆213Jan 26, 2019Updated 7 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆390Oct 23, 2023Updated 2 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Haskell Type Level Example Programs☆28Nov 30, 2017Updated 8 years ago
- ⭕️ N2O: Haskell Application Server☆47Feb 16, 2022Updated 4 years ago
- Optimal evaluator of λ-calculus terms.☆285Feb 4, 2023Updated 3 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- What I wish I knew when learning HoTT☆53Feb 24, 2019Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Closure calculus implementation☆12Jun 25, 2019Updated 6 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆12Dec 27, 2016Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Ask for solutions.☆19Aug 5, 2019Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆23Aug 14, 2020Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- ☆37Nov 16, 2021Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- 💧 SAMPLE: WebSocket Sample Application☆10Mar 8, 2024Updated 2 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Jul 11, 2021Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Jul 30, 2018Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Nov 18, 2019Updated 6 years ago
- "An Altruistic Processor", implemented in CLaSH (WARNING: incomplete code)☆13Mar 31, 2017Updated 8 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Placeholder for the OwO compiler☆60Feb 20, 2019Updated 7 years ago
- The theory of algebraic graphs formalised in Agda☆91Jul 15, 2018Updated 7 years ago
- ☆45Jun 20, 2019Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Merged into ian repo: https://github.com/seagreen/ian#llvm-in-haskell☆17Apr 13, 2019Updated 6 years ago
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- Type-level assertion operators☆16Mar 20, 2018Updated 7 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago