Defines Global Trace Condition for typed infinitary lambda terms ensuring strongly convergent reductions, with corollaries on numeral normalization and equivalence to total functions in System T.
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
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.
citing papers explorer
-
An Infinitary Lambda Calculus with Global Trace Condition (Extended Abstract)
Defines Global Trace Condition for typed infinitary lambda terms ensuring strongly convergent reductions, with corollaries on numeral normalization and equivalence to total functions in System T.
-
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.