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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.
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.
-
Interaction Improvement
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.