Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
☆33Oct 22, 2024Updated last year
Alternatives and similar repositories for lngen
Users that are interested in lngen are comparing it to the libraries listed below
Sorting:
- The Penn Locally Nameless Metatheory Library☆76Mar 26, 2025Updated 11 months ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- LaTeX style file to typeset functional languages like Haskell☆26Mar 25, 2013Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Sep 17, 2024Updated last year
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Oct 26, 2023Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 11 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- The Ott tool for writing definitions of programming languages and calculi☆405Feb 15, 2026Updated 3 weeks ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Feb 7, 2024Updated 2 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Agda programming with holes☆28Feb 2, 2021Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Lecture material for DeepSpec Summer School 2018☆68Jan 7, 2019Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Official repository of the Autosubst 2 project.☆25May 8, 2023Updated 2 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- All the code I've ever written in Ltac2☆11Jan 19, 2021Updated 5 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]☆136Feb 26, 2026Updated last week
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago