andreasabel / helf
Haskell implementation of the Edinburgh Logical Framework
☆27Updated 4 months ago
Alternatives and similar repositories for helf:
Users that are interested in helf are comparing it to the libraries listed below
- ☆18Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆11Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- ☆17Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆23Updated 8 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- my phd thesis☆26Updated 6 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Experiments with higher-order abstract syntax in Agda☆20Updated 2 years ago
- ☆28Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago