An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
☆22Feb 4, 2022Updated 4 years ago
Alternatives and similar repositories for linear-logic
Users that are interested in linear-logic are comparing it to the libraries listed below
Sorting:
- A lens-compatible set of getters for purescript-foreign☆10Apr 4, 2017Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Experiments with linear types☆14Feb 23, 2018Updated 8 years ago
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Feb 13, 2018Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A small profunctor library for idris☆17Nov 3, 2022Updated 3 years ago
- Formalization of Linear Logic in Coq☆18Apr 7, 2025Updated 10 months ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Jun 3, 2022Updated 3 years ago
- A type checker for the Lean theorem prover☆40Mar 6, 2021Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Univalence from scratch in Idris☆19Apr 25, 2018Updated 7 years ago
- Practical type inference for arbitrary-rank types☆11May 25, 2019Updated 6 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- ☆12Oct 3, 2020Updated 5 years ago
- Numerical Optimisation Library☆17Jul 9, 2023Updated 2 years ago
- ☆12May 9, 2015Updated 10 years ago
- Clifford algebra for Haskell! :D☆14Jul 1, 2014Updated 11 years ago
- ☆23Sep 22, 2021Updated 4 years ago
- Tuple data type and utility functions☆26Sep 17, 2022Updated 3 years ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆15Jun 21, 2021Updated 4 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- A simple development of linear logic in Coq.☆13Mar 22, 2025Updated 11 months ago
- ☆14Nov 4, 2025Updated 4 months ago
- Working through Okasaki's "Functional Datastructures" in PureScript☆14Nov 9, 2016Updated 9 years ago
- Functional Programing in Scala (in Idris) [Idris]☆16Mar 23, 2015Updated 10 years ago
- Data type isomorphic to α ∨ β ∨ (α ∧ β)☆14Apr 27, 2022Updated 3 years ago
- ☆21Apr 15, 2018Updated 7 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- ☆16Feb 18, 2025Updated last year
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- ☆13Nov 23, 2019Updated 6 years ago