| 
|
QuoteRef: landPJ1_1964
Topic:
lambda calculus
Topic:
functional programming
Topic:
reduction languages
Topic:
evaluation in an environment
Topic:
running programs in a workspace or environment
Topic:
environment variables
Topic:
formal methods and languages
Group:
formalism
Topic:
function application
Topic:
higher-order functions and combinators
Topic:
procedures as data
Topic:
state machine
Topic:
semantics by an abstract machine
Reference
Landin, P.J., "The mechanical evaluation of expressions", Computer Journal, 6, 4, January 1964, pp. 308-320. Google
308 ;;Quote: an applicative expression consists of lambda expressions, operator applications, and expression lists; a fundamental notation
316 ;;Quote: the environment of an applicative expression defines values for free variables
316+;;Quote: algorithm for evaluating an applicative expression relative to an environment; first formalization of expression evaluation
316 ;;Quote: function-producing functions; e.g., thrice(f)(x) = f(f(f(x))))
316 ;;Quote: a closure is a lambda expression and an environment; may have a value
316 ;;Quote: during evaluation of an applicative expression, a state is a stack, environment, control, and a dump; (S, E, C, D)
Topic: lambda calculus (16 items)
Topic: functional programming (45 items)
Topic: reduction languages (17 items)
Topic: evaluation in an environment (35 items)
Topic: running programs in a workspace or environment (14 items)
Topic: environment variables (5 items)
Topic: formal methods and languages (53 items)
Group: formalism (9 topics, 478 quotes)
Topic: function application (18 items)
Topic: higher-order functions and combinators (19 items)
Topic: procedures as data (22 items)
Topic: state machine (67 items)
Topic: semantics by an abstract machine (38 items)