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
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 3 weeks ago
- IO using sized types and copatterns☆35Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated 2 weeks ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- quotient types in cubical Agda☆24Updated 6 years ago
- Mechanizing Types and Programming Languages using Beluga☆20Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A dependent type theory with user defined data types☆47Updated 3 years ago
- ☆13Updated 5 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated last month
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago