jonsterling / hs-abtLinks
Type safe abstract binding trees for Haskell, using Vinyl
☆16Updated 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:
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- ☆12Updated 6 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Miller/pattern unification in Agda☆67Updated last month
- second-order abstract syntax☆31Updated 4 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- TODO☆23Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A collection of mechanised proofs☆18Updated 5 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago