elpinal / focused-modules
A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
☆10Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for focused-modules
- Experimental normalisation via scheme☆12Updated 3 years ago
- ☆17Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 4 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- ☆18Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- Linear map categories in Agda☆5Updated last year
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- ☆16Updated 7 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A formalization of the theory behind the mugen library☆15Updated 4 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- ☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 4 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- ☆12Updated 5 years ago