A refinement of strong sequentiality for term rewriting with constructors
- 1 January 1987
- journal article
- Published by Elsevier in Information and Computation
- Vol. 72 (1) , 46-65
- https://doi.org/10.1016/0890-5401(87)90050-2
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the correspondence between two classes of reduction systemsInformation Processing Letters, 1985
- Domains for denotational semanticsPublished by Springer Nature ,1982
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965