STACK ENVIRONMENT CONTROL DUMP MACHINE
\stˈak ɛnvˈa͡ɪɹənmənt kəntɹˈə͡ʊl dˈʌmp məʃˈiːn], \stˈak ɛnvˈaɪɹənmənt kəntɹˈəʊl dˈʌmp məʃˈiːn], \s_t_ˈa_k ɛ_n_v_ˈaɪ_ɹ_ə_n_m_ə_n_t k_ə_n_t_ɹ_ˈəʊ_l d_ˈʌ_m_p m_ə_ʃ_ˈiː_n]\
Definitions of STACK ENVIRONMENT CONTROL DUMP MACHINE
Sort: Oldest first
(SECD machine) The first abstract machine for reducinglambda-calculus expressions, invented by P. J. Landin. Themachine has four registers holding pointers to linkedlists operated as push-down stacks which hold theinformation required for the evaluation of an expression. Theregisters point to (1) Stack which holds the arguments ofpartially evaluated expressions and results of completelyevaluated ones, (2) Environment where the current expressionbeing evaluated is stored, (3) Control which holds the machineinstructions that manipulate the contents of the fourregisters that represent the expression being evaluated, (4)Dump on which the state of the machine is temporarily savedduring the evaluation of expressions. See also Lispkit.
By Denis Howe