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
Sorting:
- Denotational semantics based on graph and filter models☆23Dec 16, 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☆59Updated this week
- Experiments with Realizability in Univalent Type Theory☆19Oct 21, 2024Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Lecture notes on realizability☆75Feb 21, 2025Updated last year
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74May 7, 2018Updated 7 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated last year
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 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
- 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 5 months ago
- The theory of algebraic graphs formalised in Agda☆91Jul 15, 2018Updated 7 years ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- 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
- ☆17Oct 31, 2025Updated 4 months ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- ☆17Oct 16, 2018Updated 7 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Mar 5, 2022Updated 3 years ago
- ☆16Mar 11, 2022Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 5 months ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Materials for OPLSS 2021☆11Jun 1, 2021Updated 4 years ago
- ☆52Aug 14, 2025Updated 6 months ago