A tabling operational semantics on weak-head reduction for pure λ-calculus produces sound finite cyclic graphs for finite-state terms while preserving lazy meaning and enabling automatic memoization.
ACM21, 1 (1974), 168–173
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.
citing papers explorer
-
Cyclic Graphs and Memoization in Pure $\lambda$-Calculus
A tabling operational semantics on weak-head reduction for pure λ-calculus produces sound finite cyclic graphs for finite-state terms while preserving lazy meaning and enabling automatic memoization.