Alternatives and similar repositories for bondi

Users that are interested in bondi are comparing it to the libraries listed below

• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆46Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆48Updated 4 years ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆93Updated 10 months ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• kirkedal / rfun-interp
  Interpreter for the reversible functional language rFun
  ☆36Updated 7 years ago
• mit-plv / timl
  TiML: A Functional Programming Language with Time Complexity
  ☆80Updated 8 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆50Updated 5 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• codedot / lambda
  Macro Lambda Calculus
  ☆50Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆90Updated 6 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• webyrd / linear-logic-multiset-rewriting
  Logic for story telling!
  ☆34Updated 7 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• jkoppel / ecta
  ☆37Updated last year
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago