elpinal / seqmodLinks
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
Sorting:
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 10 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- Coq library for handling names☆19Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆13Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated 10 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 2 weeks ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- ☆16Updated last month
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago