JacquesCarette / finally-taglessLinks
Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
☆43Updated 6 years ago
Alternatives and similar repositories for finally-tagless
Users that are interested in finally-tagless are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Session types in Idris2!☆27Updated 4 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- ☆18Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- ☆17Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- being a programming language for sequential circuits☆22Updated 2 weeks ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago