[<<][staapl][>>][..]

Tue Jul 22 01:29:08 CEST 2008

## Graph structured lambda calculus, SECD, ...

I'm tired so this might be nonsense..
Something i never understood is the obsession with keeping lambda
representations flat. For source transformations it makes a lot more
sense to represent lambda terms as a graph instead of a tree:
explicitly connecting reference sites with binding variables.
EDIT: this is actually what de Bruijn indices do: they point upwards
in the graph structure, counting abstractions. Writing this as a graph
gives a directed acyclic graph which is (related to?) the dataflow
graph of the computation.
Anyways: SECD and Forth
S = param stack
E = allot stack
C = instruction pointer
D = return stack
http://www.cs.utah.edu/classes/cs6520-mflatt/s00/secd.ps
SECD is lispey while CEK is schemey
http://planet.plt-scheme.org/package-source/robby/redex.plt/1/0/doc.txt

[Reply][About]

[<<][staapl][>>][..]