A note on conditional expressions

Authors:
Daniel P. Friedman;David S. Wise
Affiliations:
Indiana Univ., Bloomington;Indiana Univ., Bloomington
Venue:
Communications of the ACM
Year:
1978

Citing 3
Cited 3

Correspondence between ALGOL 60 and Church's Lambda-notation: part I

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

An indeterminate constructor for applicative programming

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence

Journal of Functional Programming

Quantified Score

Hi-index	48.22

Visualization

Abstract

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.