Alternatives and similar repositories for absal-rs:

Users that are interested in absal-rs are comparing it to the libraries listed below

• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• VictorTaelin / ultimate-calculus
  ☆36Updated 3 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• VictorTaelin / absal-ex
  Absal ex
  ☆57Updated last year
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 9 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆97Updated 2 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆77Updated 11 years ago
• jfaure / lfvm-stg
  Map lazy functional language constructs to LLVM IR
  ☆50Updated 5 years ago
• AndyShiue / pts
  implementation of Pure Type Systems (PTS) in Rust.
  ☆52Updated 8 years ago
• habit-lang / alb
  ☆39Updated 8 months ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• codedot / lambda
  Macro Lambda Calculus
  ☆49Updated 6 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• VictorTaelin / parallel_lambda_computer_tests
  learning cuda
  ☆18Updated 8 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• VictorTaelin / Elementary-Affine-Type-Theory-legacy
  Minimal, efficient proof language
  ☆14Updated 5 years ago