elpinal / seqmod
Full implementation of F-ing Modules, with the power of sequent calculus
☆20Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for seqmod
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Session types in Idris2!☆27Updated 3 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- ☆12Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆56Updated 3 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- Mechanizing Types and Programming Languages using Beluga☆17Updated 4 years ago
- my phd thesis☆26Updated 3 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- quotient types in cubical Agda☆22Updated 5 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 3 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- System F in coq.☆19Updated 9 years ago