gallais / typing-with-leftoversView external linksLinks
Self-contained repository for the eponymous paper
☆30Jan 11, 2019Updated 7 years ago
Alternatives and similar repositories for typing-with-leftovers
Users that are interested in typing-with-leftovers are comparing it to the libraries listed below
Sorting:
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 2 months ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Jul 19, 2025Updated 6 months ago
- Total Parser Combinators in Agda☆133Aug 5, 2025Updated 6 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆20Aug 13, 2024Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48May 17, 2022Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Dec 10, 2017Updated 8 years ago
- An Agda library for programming with ternary relations☆18Apr 9, 2025Updated 10 months ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- ☆12Jul 8, 2019Updated 6 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago