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
- ☆35Updated 6 years ago
- Specification of the Formality proof and programming language☆41Updated last year
- Standard library for the Formality language☆18Updated 4 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Absal ex☆56Updated last year
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆81Updated 3 years ago
- Thoughts and stuff☆68Updated 4 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- source code for the bondi programming language☆40Updated 5 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An implementation of the Formality language in JavaScript☆72Updated 5 years ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Kempe is a compiled stack-based language☆58Updated 4 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- Simplified Observational Type Theory☆81Updated last year
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A general purpose programming language with linear types☆44Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago