Alternatives and similar repositories for ultimate-calculus:

Users that are interested in ultimate-calculus are comparing it to the libraries listed below

• VictorTaelin / Elementary-Affine-Core-legacy
  A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
  ☆17Updated 5 years ago
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 4 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆71Updated 5 years ago
• VictorTaelin / absal-ex
  Absal ex
  ☆57Updated last year
• Soonad / FormalityFM
  Formality in itself
  ☆20Updated 4 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆81Updated last year
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆71Updated 2 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• astump / cedilleum-spec
  Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core
  ☆26Updated 5 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• VictorTaelin / optimul
  Multiplication on optimal λ-calculus reducers
  ☆22Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆44Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• Soonad / Base.fm
  Standard library for the Formality language
  ☆18Updated 4 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• bellissimogiorno / nominal
  Haskell implementation of nominal datatypes and functions
  ☆39Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago