metaocaml / metaocaml-bibliography
MetaML and MetaOCaml bibliography
☆89Updated 3 months ago
Alternatives and similar repositories for metaocaml-bibliography:
Users that are interested in metaocaml-bibliography are comparing it to the libraries listed below
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last year
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- An enhanced unification algorithm for Coq☆54Updated 3 weeks ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last week
- A verified compiler for a lazy functional language☆34Updated last month
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Miller/pattern unification in Agda☆64Updated 11 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- ☆54Updated 3 weeks ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated last month
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 5 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago