yallop / fomegaLinks
System Fω interpreter for use in Advanced Functional Programming course
☆66Updated last year
Alternatives and similar repositories for fomega
Users that are interested in fomega are comparing it to the libraries listed below
Sorting:
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 3 months ago
- OCaml backend for Agda☆40Updated 6 years ago
- MetaML and MetaOCaml bibliography☆93Updated 8 months ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 4 months ago
- Efficient binder representation in OCaml☆43Updated last year
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years 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 6 years ago
- ☆86Updated last year
- Higher-kinded programming in OCaml☆183Updated last year
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- A pretty-printing combinator library for OCaml☆51Updated last year
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated last month
- Library for automatic unit testing of Standard ML modules☆71Updated 5 years ago
- The language of the future!☆72Updated last year
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- A library for effects in Coq.☆66Updated 3 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆67Updated 3 months ago
- Example row-polymorphism implementations☆61Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- 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
- A modular sat/smt solver with proof output.☆101Updated last year
- Model finder for higher-order logic☆47Updated last week
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- OCaml interpreter☆102Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 7 years ago