Type safe abstract binding trees for Haskell, using Vinyl
☆16Oct 1, 2017Updated 8 years ago
Alternatives and similar repositories for hs-abt
Users that are interested in hs-abt are comparing it to the libraries listed below
Sorting:
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Web based opetopic editor☆36Oct 21, 2024Updated last year
- secret project☆17Mar 14, 2018Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- ☆10May 3, 2017Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- The Mechanization of Standard ML☆75Jul 18, 2022Updated 3 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Feb 20, 2019Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- being a slightly rethought version of the Frank implementation☆23Feb 9, 2016Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- Implementation of Nuprl's type theory in Coq☆46Feb 25, 2026Updated last week
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- Accepted papers for Haskell 2014☆52May 19, 2016Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Summer school on programming in Agda☆68Aug 1, 2023Updated 2 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- Where my everyday research happens☆56Feb 17, 2026Updated 2 weeks ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago