Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆80Aug 25, 2025Updated 6 months ago
Alternatives and similar repositories for abstract-binding-trees
Users that are interested in abstract-binding-trees are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Experiments with Realizability in Univalent Type Theory☆19Oct 21, 2024Updated last year
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55May 28, 2020Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Mar 2, 2026Updated 3 weeks ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Lecture notes on realizability☆76Feb 21, 2025Updated last year
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated 2 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74May 7, 2018Updated 7 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 4 months ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆92Jul 15, 2018Updated 7 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Sep 21, 2022Updated 3 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- ☆17Oct 31, 2025Updated 4 months ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated 2 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆66Mar 5, 2022Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- ☆16Mar 11, 2022Updated 4 years ago
- Stronger types for a few Typed Racket operators☆11Jan 25, 2024Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- Linear Logic for Constructive Mathematics, in Agda☆19Jul 7, 2019Updated 6 years ago
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month
- ☆17Oct 16, 2018Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆22Jul 14, 2022Updated 3 years ago