VARIETIES OF IF-THEN-ELSE

[1] ARNOLD A, 1978, THEORET COMPUT SCI, V12, P69

[2] CAN PROGRAMMING BE LIBERATED FROM VON NEUMANN STYLE - FUNCTIONAL STYLE AND ITS ALGEBRA OF PROGRAMS [J]. COMMUNICATIONS OF THE ACM, 1978, 21 (08) : 613 - 641

[3] BLOOM SL, 1980, SIAM J COMP, V11, P683

[4] INFINITE TREES IN NORMAL FORM AND RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTION [J]. MATHEMATICAL SYSTEMS THEORY, 1979, 13 (02): : 131 - 180

[5] COURCELLE B, 1976, 17TH S F COMP SCI HO

[6] COUSINEAU G, UNPUB RATIONAL EXPRE

[7] GORN S, 1965, SYSTEMS COMPUTER SCI

[8] FIXPOINT APPROACH TO THEORY OF COMPUTATION [J]. COMMUNICATIONS OF THE ACM, 1972, 15 (07) : 528 - +

[9] MCCARTHY J, 1963, COMPUTER PROGRAMMING

[10] CANONICAL FORM ALGORITHM FOR PROVING EQUIVALENCE OF CONDITIONAL FORMS [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (02) : 103 - 106

[1] ARNOLD A, 1978, THEORET COMPUT SCI, V12, P69

[2] CAN PROGRAMMING BE LIBERATED FROM VON NEUMANN STYLE - FUNCTIONAL STYLE AND ITS ALGEBRA OF PROGRAMS [J]. COMMUNICATIONS OF THE ACM, 1978, 21 (08) : 613 - 641

[3] BLOOM SL, 1980, SIAM J COMP, V11, P683

[4] INFINITE TREES IN NORMAL FORM AND RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTION [J]. MATHEMATICAL SYSTEMS THEORY, 1979, 13 (02): : 131 - 180

[5] COURCELLE B, 1976, 17TH S F COMP SCI HO

[6] COUSINEAU G, UNPUB RATIONAL EXPRE

[7] GORN S, 1965, SYSTEMS COMPUTER SCI

[8] FIXPOINT APPROACH TO THEORY OF COMPUTATION [J]. COMMUNICATIONS OF THE ACM, 1972, 15 (07) : 528 - +

[9] MCCARTHY J, 1963, COMPUTER PROGRAMMING

[10] CANONICAL FORM ALGORITHM FOR PROVING EQUIVALENCE OF CONDITIONAL FORMS [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (02) : 103 - 106