jonsterling / hs-abt
Type safe abstract binding trees for Haskell, using Vinyl
☆16Updated 7 years ago
Alternatives and similar repositories for hs-abt:
Users that are interested in hs-abt are comparing it to the libraries listed below
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆17Updated 2 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- ☆12Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago