Alternatives and similar repositories for owl

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

• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• owainlewis / bridge
  A type-safe, stack-based functional programming language
  ☆16Updated 7 months ago
• 4y8 / esoo
  Like the Programming Languages Zoo but with esoteric languages.
  ☆25Updated 5 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 5 years ago
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆11Updated 3 years ago
• craff / pacomb
  A parsing library that compiles grammars to combinators using elimination of left recursion
  ☆22Updated last year
• 4y8 / combo
  A simple parser combinator library for Ocaml
  ☆30Updated 4 years ago
• nathanfarlow / c-of-ocaml
  Compile OCaml to standalone ANSI C file
  ☆44Updated 4 months ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 9 months ago
• c-cube / quip
  [wip] Proof format and checker for first-order and higher-order theorem provers
  ☆12Updated 2 years ago
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆27Updated 3 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• smimram / ocaml-alg
  Algebraic structures in OCaml.
  ☆25Updated this week
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• andrejbauer / repl-in-browser
  Implementation of a language interpreter in the browser, using js_of_ocaml.
  ☆15Updated 7 years ago
• formal-land / coq-bonsai
  🌳 Generate a fresh bonsai in your terminal
  ☆28Updated 4 years ago
• dannywillems / dsubml
  OCaml implementation of DSub, a ML like language with subtyping and path dependent types.
  ☆13Updated 8 years ago
• Drup / tree_layout
  Algorithms to layout trees in a pretty manner.
  ☆36Updated 3 years ago
• zinid / delimcc
  Delimited continuations in byte-code and native OCaml
  ☆27Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• jmid / wasm-prop-tester
  A stack-driven generator of arbitrary WebAssembly programs
  ☆19Updated 4 years ago
• lindig / lipsum
  A Literate Programming Tool inspired by NoWeb, implemented in OCaml
  ☆34Updated 6 years ago
• LesleyLai / ocamlpt
  Path tracer live coded in stream
  ☆19Updated 5 years ago
• hcarty / shatter
  A block breaking game
  ☆11Updated 3 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• dannywillems / RML
  ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
  ☆38Updated 3 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 5 years ago