SECD(ID:1528/)

AN abstract machine designed by Landon to interpret the Lambda Calculus. Hugely influential in functional programming language design

People:
Related languages
Church typed-lambda calculus => SECD   Implementation of
SECD => F-code   Implementation of
SECD => ISWIM   Incorporated into
SECD => Lispkit Lisp   Input language for
SECD => M-Code   Implementation of
SECD => PSP   Target language for
SECD => pure_LISP   Interpreter for
References:
  • Landin, P.J. "The Mechanical evaluation of Expressions" pp308-320 view details Abstract: This paper is a contribution to the 'theory' of the activity of using computers. It shows how some forms of expression used in current programming languages can be modelled in Church's λ-notation, and then describes a way of 'interpreting' such expressions. This suggests a method, of analyzing the things computer users write, that applies to many different problem orientations and to different phases of the activity of using a computer. Also a technique is introduced by which the various composite information structures involved can be formally characterized in their essentials, without commitment to specific written or other representations.
          in The Computer Journal 6(4) January 1964 view details
  • Plotkin, Gordon D., "Call-By-Name, Call-By-Value, and the Lambda Calculus", Theoretical Computer Science, Vol 1, pp. 125-159, North-Holland, 1975 view details
          in The Computer Journal 6(4) January 1964 view details
    Resources