Name
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. |
Year | DOI | Venue |
|---|---|---|
1976 | 10.1109/SFCS.1975.10 | Siam Journal on Computing |
Keywords | Field | DocType |
tv,mathematical model,concurrent computing,computer science,silicon,lead,local area networks,computational modeling,formal languages,computer languages,tin,upper bound,sensitivity,testing,finite element methods,titanium | Combinatorics,Formal language,Algebra,Computer science,Correctness,Denotational semantics,Recursive language,Theoretical computer science,Concurrent computing,μ operator,Recursion,Recursive definition | Journal |
Volume | Issue | Citations |
5 | 3 | 13 |
PageRank | References | Authors |
8.18 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter J. Downey | 1 | 436 | 172.07 |
| Ravi Sethi | 2 | 2281 | 1029.21 |