Alternatives and similar repositories for agda-ocaml:

Users that are interested in agda-ocaml are comparing it to the libraries listed below

• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• pedagand / MPRI-2.4-DTP
  MPRI-2.4 Dependently-typed Functional Programming
  ☆32Updated 4 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆40Updated 8 months ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• coq-io / system
  Library of Unix effects for Coq.
  ☆23Updated 5 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• dannywillems / RML
  ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
  ☆37Updated 2 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 9 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆109Updated 4 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• Drup / dowsing
  ᚛ A type of divination employed in attempts to locate identifiers matching a given type expression
  ☆34Updated 3 weeks ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• agda-attic / agda-frp-ltl
  An implementation of Functional Reactive Programming
  ☆40Updated 10 years ago
• lpw25 / ocaml-typed-effects
  OCaml with typed algebraic effects
  ☆49Updated 6 years ago
• ujamjar / hardcaml-zinc
  HardCaml implementation of the OCaml ZINC Abstract Machine
  ☆44Updated 5 years ago