Haskell implementation of the Edinburgh Logical Framework
☆32Jan 12, 2026Updated last month
Alternatives and similar repositories for helf
Users that are interested in helf are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Implementing grep in Agda☆33Jan 11, 2021Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Where my everyday research happens☆56Feb 17, 2026Updated last week
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- ☆45Jun 20, 2019Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year