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 4 years ago
• owainlewis / bridge
  A type-safe, stack-based functional programming language
  ☆16Updated 9 months ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 3 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
  ☆12Updated 3 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 11 years ago
• andrejbauer / repl-in-browser
  Implementation of a language interpreter in the browser, using js_of_ocaml.
  ☆15Updated 7 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
• 4y8 / esoo
  Like the Programming Languages Zoo but with esoteric languages.
  ☆25Updated 5 years ago
• c-cube / quip
  [wip] Proof format and checker for first-order and higher-order theorem provers
  ☆12Updated 2 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆31Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 8 months ago
• jrk / symalg
  (Extremely) simple standalone symbolic algebra library in OCaml. (Mirrored from original site.)
  ☆12Updated 14 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 8 months ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 8 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 5 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 5 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆20Updated 2 weeks ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated 9 months ago
• craff / pacomb
  A parsing library that compiles grammars to combinators using elimination of left recursion
  ☆22Updated last month
• formal-land / coq-bonsai
  🌳 Generate a fresh bonsai in your terminal
  ☆28Updated 4 years ago
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆26Updated 2 weeks ago
• 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
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago