elpinal / focused-modules
A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
☆10Updated 4 years ago
Alternatives and similar repositories for focused-modules:
Users that are interested in focused-modules are comparing it to the libraries listed below
- Experimental normalisation via scheme☆12Updated 3 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 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆17Updated 6 years ago
- ☆18Updated 2 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Educational implementation of dependent types☆19Updated 6 years ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Agda suffices: software written from A to Z in Agda☆15Updated 6 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆16Updated 2 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago