neel-krishnaswami / adjsLinks
Higher-order FRP compiler
☆15Updated 4 years ago
Alternatives and similar repositories for adjs
Users that are interested in adjs are comparing it to the libraries listed below
Sorting:
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- OCaml backend for Agda☆39Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆29Updated 10 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- secret project☆17Updated 7 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- MetaML and MetaOCaml bibliography☆97Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Efficient binder representation in OCaml☆43Updated last year