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
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• VictorTaelin / optimul
  Multiplication on optimal λ-calculus reducers
  ☆22Updated 4 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆71Updated 5 years ago
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• kindelia-archive / LambdaVM
  A next-gen, massively parallel, beta-optimal functional runtime.
  ☆10Updated 3 years ago
• VictorTaelin / formality-agda-lib-legacy
  Agda libraries relevant to Moonad
  ☆14Updated 6 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• VictorTaelin / absal-ex
  Absal ex
  ☆57Updated last year
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last month
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• Soonad / Base.fm
  Standard library for the Formality language
  ☆18Updated 5 years ago
• Soonad / FormalityFM
  Formality in itself
  ☆20Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆44Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 6 months ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• VictorTaelin / Elementary-Affine-Type-Theory-legacy
  Minimal, efficient proof language
  ☆14Updated 5 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• mbg / hindley-milner
  Template for Hindley-Milner based languages
  ☆39Updated 3 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• gergoerdi / interaction-nets
  Haskell implementation of interaction net-based lambda evaluation
  ☆20Updated 8 years ago