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
- A playground for type theory implementations in Racket☆20Updated 9 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
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 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
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- ☆12Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Type theory in type theory☆16Updated 13 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- A collection of mechanised proofs☆16Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago