elpinal / seqmod
Full implementation of F-ing Modules, with the power of sequent calculus
☆20Updated 4 years ago
Alternatives and similar repositories for seqmod:
Users that are interested in seqmod are comparing it to the libraries listed below
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆12Updated 5 years ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Session types in Idris2!☆27Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated last week
- An implementation of binary session types in OCaml☆36Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- A simple supercompiler formally verified in Agda☆33Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- SubML (prototype) language☆23Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- ☆29Updated last month
- A simple implementation of linear type theory☆38Updated 7 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 7 months ago
- A repository of MetaOCaml packages☆12Updated last year
- Stable sort algorithms and their stability proofs in Coq☆22Updated last week