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
fields
cs.PL 2verdicts
UNVERDICTED 2representative citing papers
A Lean library called Palamedes uses synthesis rules from generator semantics and catamorphism-anamorphism rewriting to automatically produce correct constrained random generators.
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.
-
The Search for Constrained Random Generators
A Lean library called Palamedes uses synthesis rules from generator semantics and catamorphism-anamorphism rewriting to automatically produce correct constrained random generators.