Program equivalence and context-free grammars
Barry K. Rosen
SWAT 1972
This paper recounts the origins of the a;x family of calculi of explicit substitution with proper variable names, including the original result of preservation of strong β-normalization based on the use of synthetic reductions for garbage collection. We then discuss the properties of a variant of the calculus which is also confluent for "open" terms (with meta-variables), and verify that a version with garbage collection preserves strong β-normalization (as is the state of the art), and we summarize the relationship with other efforts on using names and garbage collection rules in explicit substitution. © 2012 Springer Science+Business Media, LLC.
Barry K. Rosen
SWAT 1972
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shyam Marjit, Harshit Singh, et al.
WACV 2025
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014