Agda formalization of Intuitionistic Propositional Logic
☆22Nov 14, 2025Updated 3 months ago
Alternatives and similar repositories for ipl
Users that are interested in ipl are comparing it to the libraries listed below
Sorting:
- ☆21Sep 8, 2021Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Nov 27, 2023Updated 2 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A typechecker for WebAssembly, written in Agda (WIP)☆17Feb 23, 2018Updated 8 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Library of the ##dependent distributed research support group☆119Jul 12, 2024Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Experiments with modal types☆17Oct 20, 2020Updated 5 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago