论文信息 - A note on conditional expressions - 字舞流文

A note on conditional expressions

Evaluation of a conditional expression may succeed even when the “deciding predicate” diverges and the alternatives are records (or nodes) whose fields have different content.

Daniel P. Friedman | David S. Wise

[1] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[2] Glenn K. Manacher,et al. An Application of Pattern Matching to a Problem in Geometrical Complexity , 1976, Inf. Process. Lett..

[3] Zohar Manna,et al. PROPERTIES OF PROGRAMS AND PARTIAL FUNCTION LOGIC , 1969 .

[4] John McCarthy,et al. A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).

[5] Daniel P. Friedman,et al. Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures , 1976, Inf. Process. Lett..

[6] P. J. Landin,et al. Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[7] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[8] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[9] Peter Henderson,et al. A lazy evaluator , 1976, POPL.

[10] Jean Vuillemin,et al. Correct and optimal implementations of recursion in a simple programming language , 1973, J. Comput. Syst. Sci..