VictorTaelin / Elementary-Affine-Core-legacyView external linksLinks
A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
☆17Jun 17, 2019Updated 6 years ago
Alternatives and similar repositories for Elementary-Affine-Core-legacy
Users that are interested in Elementary-Affine-Core-legacy are comparing it to the libraries listed below
Sorting:
- Minimal, efficient proof language☆14May 28, 2019Updated 6 years ago
- An implementation of the Formality language in C☆13Oct 12, 2019Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Aug 14, 2020Updated 5 years ago
- An implementation of the Formality language in JavaScript☆71Aug 27, 2019Updated 6 years ago
- Specification of the Formality proof and programming language☆42Feb 5, 2023Updated 3 years ago
- ☆36Nov 16, 2021Updated 4 years ago
- Standard library for the Formality language☆18Mar 22, 2020Updated 5 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- A Unifying Cartesian Cubical Set Model☆35Oct 14, 2019Updated 6 years ago
- Thoughts and stuff☆71Apr 30, 2020Updated 5 years ago
- Quantum-proof, 768-bit signatures for 1-bit messages☆11Mar 11, 2020Updated 5 years ago
- Agda libraries relevant to Moonad☆14Apr 2, 2019Updated 6 years ago
- Moonad: a Peer-to-Peer Operating System☆101Dec 7, 2019Updated 6 years ago
- Absal ex☆59Sep 8, 2023Updated 2 years ago
- A semantic highlighter for Idris code☆14Feb 22, 2018Updated 7 years ago
- Macro Lambda Calculus☆50Mar 23, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- GO GO GADGET: VIDEO☆14Apr 5, 2020Updated 5 years ago
- A personal library, formalizing cohesive homotopy type theory in Agda.☆13Apr 30, 2019Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- A Haskell implementation of the Formality language☆18Mar 9, 2020Updated 5 years ago
- A nano "theorem prover".☆62Feb 15, 2019Updated 7 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- ☆15Oct 24, 2017Updated 8 years ago
- ☆35Jul 30, 2018Updated 7 years ago
- Animation of Yves Lafont's Interaction Combinators☆23Jan 30, 2022Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- An upcoming operating system built on Type-Theory☆43Jul 1, 2020Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Jul 19, 2025Updated 6 months ago
- A Dependently Typed Programming Language☆26Jul 24, 2020Updated 5 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Optimal evaluator of λ-calculus terms.☆283Feb 4, 2023Updated 3 years ago
- learning cuda☆19Jun 27, 2016Updated 9 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Jun 13, 2022Updated 3 years ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago