Most of the time, we don't need to have a dynamic call sub graph, since the actual function call could be represented statically as it originally was before lambda functions were implemented. Simplifying the graph shape has important performance benefits in terms of both keep the graph smaller (memory, etc) and in avoiding the need to run transactions at runtime (speed) to reshape the graph. Co-authored-by: Samuel Gélineau <gelisam@gmail.com>
25 lines
584 B
Plaintext
25 lines
584 B
Plaintext
-- main.mcl --
|
|
# this was originally: optimized-higher-order-function.txtar
|
|
import "fmt"
|
|
|
|
func apply($f, $x) {
|
|
$f($x)
|
|
}
|
|
$add1 = func($x) {
|
|
$x + 1
|
|
}
|
|
$z = apply($add1, 1)
|
|
|
|
test [fmt.printf("%d", $z),] {}
|
|
-- OUTPUT --
|
|
Edge: FuncValue -> call # fn
|
|
Edge: call -> printf: func(format str, a int) str # a
|
|
Edge: const: str("%d") -> printf: func(format str, a int) str # format
|
|
Edge: printf: func(format str, a int) str -> composite: []str # 0
|
|
Vertex: FuncValue
|
|
Vertex: call
|
|
Vertex: composite: []str
|
|
Vertex: const: int(1)
|
|
Vertex: const: str("%d")
|
|
Vertex: printf: func(format str, a int) str
|