Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.
☆11Aug 28, 2024Updated last year
Alternatives and similar repositories for tilogics
Users that are interested in tilogics are comparing it to the libraries listed below
Sorting:
- Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…☆19Updated this week
- ☆17Apr 4, 2024Updated last year
- Mechanized baselines for various type system features☆18Updated this week
- A OCaml generator for well-typed terms (that use their arguments).☆11Feb 22, 2025Updated last year
- ☆13Nov 23, 2019Updated 6 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆13Dec 2, 2025Updated 3 months ago
- ☆16Feb 18, 2025Updated last year
- ☆19Nov 24, 2025Updated 3 months ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆18Apr 25, 2016Updated 9 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- Formal Semantics for Why3☆20Sep 28, 2025Updated 5 months ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Nov 27, 2023Updated 2 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Sep 17, 2024Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- ☆23Sep 22, 2021Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- 🍔 Chen’s Private Cuisine Menu☆10Jan 4, 2026Updated last month
- Idris, but it's C☆24May 25, 2018Updated 7 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Code from CS152 lectures☆14Updated this week
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- A small example of a source->source pattern matching to decision tree compiler☆14Jul 29, 2020Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆18Oct 14, 2025Updated 4 months ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- translations of a lambda abstraction to combinations of operators☆18Sep 6, 2019Updated 6 years ago
- ☆15Jun 26, 2019Updated 6 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago