Binding Structures as an Abstract Data Type
No abstract available.
Related papers
- Rebound: Efficient, Expressive, and Well-Scoped Binding Haskell 2025
- Disjunctive Program Analysis for Algebraic Data Types TOPLAS 1997
- Lifetime Analysis of Dynamically Allocated Objects POPL 1988
- Abstract Types Have Existential Type TOPLAS 1988
- A Simple Implementation Technique for Priority Search Queues ICFP 2001
- Visitors unchained ICFP 2017
- Delimited dynamic binding ICFP 2006
- Characterising renaming within OCaml's module system: theory and implementation PLDI 2019