71 ;;Quote: a complete language does not depend on other languages for its semantics

71 ;;Quote: in a closed applicative language, an expression is a constant (its own meaning) unless applied

QuoteRef: backJ_1973 ;;71 expression only type in a closed applicative language

72 ;;Quote: in a closed applicative language, all reductions terminate at the same meaning (if any)

QuoteRef: backJ_1973 ;;72 RED languages are the turing machines of programming languages but with sophisticated primitive operators become high-level

72 ;;Quote: a language is a mapping between expressions and a domain of discourse; if a function, the meaning of an expression is its consequent

72 ;;Quote: could describe Algol as set of legal programs, initial states, and mappings between programs and state changes

73 ;;Quote: complete language <=> fixed points of a semantic function are the values of its expressions

73 ;;Quote: a language has a state language when its domain is a set of computations that define the reduction operator

73 ;;Quote: a complete realization defines a transition function and constants; can realize a complete language

74 ;;Quote: constructor syntax uses a set of constructors and atomic expressions to define non-atomic expressions

75 ;;Quote: in an applicative language, replace components by their meaning; get meaning of whole unless it's an application

75 ;;Quote: only function application specifies computation

75 ;;Quote: in a closed applicative language, the meaning of an application (.mu. * ap [e,f]) is .mu.*[.rho. .mu. e].mu.f

76 ;;Quote: Red languages differ by having different atoms or different primitive functions represented by atoms

QuoteRef: backJ_1973 ;;76 Red language with 4 types of expressions-atoms, applications sequences (el, e2, e3...) and undefined .bottom.

QuoteRef: backJ_1973 ;;77 empty sequence or identity function