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
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months 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
- Type theory in type theory☆16Updated 13 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆12Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years 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 Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆18Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago