VictorTaelin / ultimate-calculus
☆36Updated 3 years ago
Alternatives and similar repositories for ultimate-calculus:
Users that are interested in ultimate-calculus are comparing it to the libraries listed below
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- ☆35Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Formality in itself☆20Updated 4 years ago
- An implementation of the Formality language in JavaScript☆71Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Thoughts and stuff☆69Updated 4 years ago
- Kempe is a compiled stack-based language☆58Updated 6 months ago
- IO using sized types and copatterns☆33Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- Absal ex☆57Updated last year
- Specification of the Cedille Core language☆29Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Simplified Observational Type Theory☆81Updated last year
- Example row-polymorphism implementations☆61Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago