lambdageek / unbound-genericsView external linksLinks
Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
☆57Mar 21, 2024Updated last year
Alternatives and similar repositories for unbound-generics
Users that are interested in unbound-generics are comparing it to the libraries listed below
Sorting:
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Jan 23, 2026Updated 3 weeks ago
- Generic functions for single-sorted first-order structural unification☆45May 1, 2025Updated 9 months ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- ☆12May 9, 2015Updated 10 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- A simple ML dialect☆11Jan 2, 2017Updated 9 years ago
- Compositional type checking for a Hindley-Milner type system☆11Mar 28, 2017Updated 8 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 2 months ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- MixML prototype interpreter☆27Dec 13, 2019Updated 6 years ago
- The opentheory tool processes higher order logic theory packages☆16Mar 21, 2023Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- A demo implementation of a simple dependently-typed language☆617Nov 18, 2024Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 10 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 4 months ago
- Higher-kinded data via generics☆170Aug 20, 2024Updated last year
- Formal Semantics for Why3☆19Sep 28, 2025Updated 4 months ago
- A package re-exporting the verified subset of containers☆20Jun 18, 2018Updated 7 years ago
- Formal semantics in Agda.☆16Jul 2, 2015Updated 10 years ago
- SPJ's tutorial on implementing functional languages☆29Jul 29, 2019Updated 6 years ago
- ATS-Postiats-contrib is primarily for packages contributed to ATS-Postiats☆50Aug 3, 2020Updated 5 years ago
- Interpreter for GHC Haskell☆22Nov 9, 2019Updated 6 years ago
- Low-overhead effect management for concrete monads☆37Mar 25, 2022Updated 3 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆68Oct 16, 2023Updated 2 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- ☆40Aug 5, 2024Updated last year
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- Example language server (LSP) implementation for a toy language☆60Jul 21, 2021Updated 4 years ago
- Map lazy functional language constructs to LLVM IR☆52Jun 21, 2019Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A small compiler for PCF☆127Oct 26, 2020Updated 5 years ago
- A work-in-progress core language for Agda, in Agda☆64Updated this week
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago