DocumentCode
2176604
Title
Correct computation rules for recursive languages
Author
Downey, Peter J. ; Sethi, Ravi
fYear
1975
fDate
13-15 Oct. 1975
Firstpage
48
Lastpage
56
Abstract
This paper considers simple LISP-like languages for the recursive definition of functions, focusing upon the connections between formal computation rules for calculation and the mathematical semantics of recursive definitions. A computation rule is correct when it is capable of computing the minimal fixpoint of a recursive definition. We give necessary and sufficient conditions for the correctness of rules under (a) all possible interpretations and (b) particular interpretations.
Keywords
Computer languages; Computer science; Concurrent computing; Equations; Formal languages; Lead; Sufficient conditions; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1975., 16th Annual Symposium on
Conference_Location
USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1975.10
Filename
4567857
Link To Document