neel-krishnaswami / adjs
Higher-order FRP compiler
☆14Updated 3 years ago
Alternatives and similar repositories for adjs:
Users that are interested in adjs are comparing it to the libraries listed below
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- ☆29Updated 9 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 4 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 3 weeks ago
- Formalization of CBPV extended with effect and coeffect tracking☆12Updated 5 months ago
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- System F in coq.☆19Updated 10 years ago