neel-krishnaswami / adjsLinks
Higher-order FRP compiler
☆15Updated 3 years ago
Alternatives and similar repositories for adjs
Users that are interested in adjs are comparing it to the libraries listed below
Sorting:
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 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
- OCaml backend for Agda☆40Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 2 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- ☆29Updated 9 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- ☆18Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Category theory and algebra☆28Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago