VictorTaelin / ultimate-calculus

Related projects ⓘ

Alternatives and complementary repositories for ultimate-calculus

• VictorTaelin / Elementary-Affine-Core-legacy
  A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
  ☆17Updated 5 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆40Updated last year
• VictorTaelin / optimul
  Multiplication on optimal λ-calculus reducers
  ☆22Updated 4 years ago
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 4 years ago
• codedot / lambda
  Macro Lambda Calculus
  ☆45Updated 5 years ago
• VictorTaelin / absal-rs
  ☆36Updated 6 years ago
• VictorTaelin / formality-agda-lib-legacy
  Agda libraries relevant to Moonad
  ☆14Updated 5 years ago
• kindelia-archive / LambdaVM
  A next-gen, massively parallel, beta-optimal functional runtime.
  ☆10Updated 2 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• Soonad / FormalityFM
  Formality in itself
  ☆20Updated 3 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆61Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• VictorTaelin / Elementary-Affine-Type-Theory-legacy
  Minimal, efficient proof language
  ☆14Updated 5 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆51Updated last year
• VictorTaelin / absal-ex
  Absal ex
  ☆55Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆45Updated 3 years ago
• VictorTaelin / articles
  Thoughts and stuff
  ☆67Updated 4 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• gergoerdi / interaction-nets
  Haskell implementation of interaction net-based lambda evaluation
  ☆16Updated 8 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 7 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆55Updated 5 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆72Updated 5 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• Heimdell / LR
  LR(1) parser (and generator)
  ☆8Updated 11 months ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last month