Haskell implementation of the Edinburgh Logical Framework
☆34Jan 12, 2026Updated 9 months ago
Alternatives and similar repositories for helf
Users that are interested in helf are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆13May 15, 2017Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 9 years ago
- A graphical tool to translate lambda terms to proof nets and run GoI token machine on it☆10Apr 24, 2016Updated 10 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- Normalization by Evaluation for STLC with sums (no proof of correctness, shame! shame! shame!)☆12Nov 22, 2019Updated 6 years ago
- A bare-bones LCF-style proof assistant☆26Aug 13, 2019Updated 7 years ago
- Mtac in Agda☆29May 4, 2021Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 9 years ago
- ☆21Apr 15, 2018Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 10 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆33Oct 22, 2024Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆115Jan 12, 2026Updated 9 months ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ☆17Oct 16, 2018Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- Implementing grep in Agda☆33Jan 11, 2021Updated 5 years ago
- A discouraging story.☆19May 8, 2018Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 9 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 10 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 4 years ago
- Semantics for Cryptol☆15Apr 9, 2018Updated 8 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆60Sep 11, 2025Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 9 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 9 years ago
- The Mechanization of Standard ML☆75Jul 18, 2022Updated 4 years ago
- ☆11Jul 20, 2016Updated 10 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated last year
- A purely functional higher order logic kernel☆15Sep 12, 2026Updated last month
- Mechanized metatheory of LF in Twelf.☆16Jun 3, 2012Updated 14 years ago
- Simplified Observational Type Theory☆93Feb 17, 2026Updated 8 months ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆23Oct 22, 2026Updated last week
- second-order abstract syntax☆31Sep 15, 2021Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆123May 9, 2020Updated 6 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆41May 24, 2016Updated 10 years ago
- An Agda formalisation of the theory of directed containers☆13Apr 25, 2025Updated last year