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.
ACM43, 1 (1996), 20–74
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proposes and implements in Datalog a policy language for expressing complex authorization conditions including dynamic process status, then evaluates it by composing SELinux policies.
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.