metaocaml / metaocaml-bibliographyLinks
MetaML and MetaOCaml bibliography
☆93Updated 9 months ago
Alternatives and similar repositories for metaocaml-bibliography
Users that are interested in metaocaml-bibliography are comparing it to the libraries listed below
Sorting:
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆67Updated 4 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 3 months ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Simplified Observational Type Theory☆84Updated 2 years ago
- ☆86Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated last month
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 5 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- ☆84Updated 8 years ago
- ☆26Updated 8 years ago