| 
|
QuoteRef: turnDA1_1979
topics >
all references >
ThesaHelp:
references t-z
Topic:
no need for variables
Topic:
curried functions
Topic:
reduction machines
Topic:
dynamic code modification
Reference
Turner, D.A., "A new implementation technique for applicative languages", Software--Practice & Experience, 9, 1, pp. 31-50, January 1979. Google
32 ;;Quote: using combinators, can remove bound variables from an expression; the result is a kind of object code ready for execution QuoteRef: turnDA1_1979 ;;33 x Given: "'def suc x= x+1 The aim is to eliminate the variable x obtaining a definition of the form ... 'def suc = 'plus 1.
39 ;;Quote: SASL compiler produces a graph which the run-time system reduces to a number or other printable object
40 ;;Quote: a machine for combinators reduces compiled code; unlike self-modifying code, it preserves meaning
ThesaHelp: references t-z (309 items)
Topic: no need for variables (13 items)
Topic: curried functions (14 items)
Topic: reduction machines (14 items)
Topic: dynamic code modification (15 items)