yallop / fomegaLinks
System Fω interpreter for use in Advanced Functional Programming course
☆68Updated 2 years ago
Alternatives and similar repositories for fomega
Users that are interested in fomega are comparing it to the libraries listed below
Sorting:
- MetaML and MetaOCaml bibliography☆97Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 7 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 7 years ago
- A pretty-printing combinator library for OCaml☆51Updated last year
- Example row-polymorphism implementations☆61Updated 2 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- Library for automatic unit testing of Standard ML modules☆71Updated 5 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- The language of the future!☆73Updated last year
- Efficient binder representation in OCaml☆43Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A library for effects in Coq.☆65Updated 3 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆69Updated 7 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- ☆84Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- Higher-kinded programming in OCaml☆188Updated 2 years ago
- Library of Unix effects for Coq.☆23Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago