The paper introduces tabling on weak-head reduction as a new operational semantics for pure λ-calculus, yielding sound cyclic graphs for finite-state terms and enabling automatic dynamic programming.
and Fischer, Michael J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative 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
The paper introduces tabling on weak-head reduction as a new operational semantics for pure λ-calculus, yielding sound cyclic graphs for finite-state terms and enabling automatic dynamic programming.
-
The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme
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.