VictorTaelin / ultimate-calculusLinks
☆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
Sorting:
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Thoughts and stuff☆70Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- ☆35Updated 6 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Kempe is a compiled stack-based language☆58Updated 9 months ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- An implementation of the Formality language in JavaScript☆71Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A prototype programming language for programming with runners☆90Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 5 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Absal ex☆57Updated last year
- source code for the bondi programming language☆40Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago