Build, Augment and Destroy, Universally
No abstract available.
Related papers
- Monadic augment and generalised short cut fusion ICFP 2005
- Concurrent Balanced Augmented Trees PPoPP 2026
- Monadic augment and generalised short cut fusion JFP 2007
- Formalizing Polynomial Laws and the Universal Divided Power Algebra CPP 2026
- Reward Augmentation in Reinforcement Learning for Testing Distributed Systems OOPSLA 2024
- Normalisation for First-Class Universe Levels POPL 2026
- Heap-Snapshot Matching and Ordering using CAHPs: A Context-Augmented Heap-Path Representation for Exact and Partial Path Matching using Prefix Trees OOPSLA 2025
- Learning Universally Quantified Invariants of Linear Data Structures CAV 2013