Alternatives and similar repositories for absal-ex

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

• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆71Updated 5 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• chessai / theseus
  theseus, functional programming language with fully reversible computation
  ☆123Updated 6 years ago
• vmchale / atspkg
  Build tool for ATS.
  ☆42Updated 3 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• VictorTaelin / articles
  Thoughts and stuff
  ☆70Updated 5 years ago
• VictorTaelin / parallel_lambda_computer_tests
  learning cuda
  ☆19Updated 9 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• VictorTaelin / absal-rs
  ☆35Updated 7 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• VictorTaelin / Elementary-Affine-Type-Theory-legacy
  Minimal, efficient proof language
  ☆14Updated 6 years ago
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆208Updated 6 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆75Updated 8 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago
• habit-lang / alb
  ☆39Updated last year
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated last month
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• aneksteind / Core
  compile your own functional language
  ☆36Updated 6 years ago