Skip to content
GraphLambda Help Graph-native functional programming
08 / Reference

Controls, diagnostics and examples

A compact reference for the editor’s implemented controls and the most common reasons a graph will not run.

Mouse and keyboard

Gesture or control Action
Click a palette item; drag it to the canvas Create a node in the focused region.
Output click, then input click; output-to-input drag Connect a producer to a consumer.
Escape during connection Cancel the pending connection.
Click a node or wire Select that source entity.
Drag a node title Move its visual layout.
Delete / Backspace outside text fields Delete a selected node or disconnect a selected wire while editing.
Mouse wheel Zoom at the pointer.
Middle-button drag; Shift+primary drag Pan the canvas.
Enter on a region header; Inspector Body / Then / Else / Scope Focus an exact nested region.
Double-click Lambda / LetRec Enter its Body / Scope.
Breadcrumb; Exit Region Return to an enclosing region.
Ctrl+Enter / Cmd+Enter in Source Code Parse, check and apply the draft.
Toolbar Undo / Redo Restore document snapshots. Disabled during a run.

Toolbar icons expose their names as tooltips. Theme offers Light , Dark and System . Tools, Inspector and Tool Panel toggle the side and bottom panels.

When an edit is refused

Code or symptom What to check
EDGE_TYPE_MISMATCH The producer type must match the consumer. Check function arguments, Boolean conditions and both branch results.
LAMBDA_VALUE_ESCAPE A value is leaving a Lambda body through an illegal route. Return it through the designated body boundary.
OUT_OF_SCOPE_BINDER_USE / INVALID_BINDER_USE A binder occurrence must refer to the correct declaration in its lexical scope. Equal spelling does not make declarations interchangeable.
TYPE_ERROR / INVALID_PROPERTY An edited declaration or literal is incompatible or malformed. Read the accompanying checker message.
OPEN_INPUT / ? : expected-type A required input is unconnected. Finish the connection before running.
AMBIGUOUS_PORT_TYPE Connections have not yet constrained a port’s type. Complete the surrounding graph.
INVALID_BODY_RESULT / INVALID_LETREC_BODY Complete the body or recursive scope and its designated result.
Run disabled The installed graph is empty, incomplete, ill-typed or structurally invalid.
LetRec disabled Select the existing Lambda you want to wrap first.
Draft rejected Fix the parse / type diagnostic; the previous installed graph is still in place.

Diagnostic codes identify the failed check. A refused graph edit does not add an Undo checkpoint. For a pending connection, Escape clears the preview without changing the program.

Useful expressions

\x : Int . x

(\x : Int . x + 1) 5

(\f : Int -> Int . f 10) (\x : Int . x + 1)

let x = 10 + 20 in x * x

if 2 < 3 then 10 else 20

Submit one expression at a time. Expected results are a closure, 6, 11, 900 and 10 respectively. See factorial for explicit recursion.

A short glossary

Term Meaning
Graph Persistent semantic program: nodes, ports, edges and regions.
Binder A declaration identified independently of its displayed name.
Binder use An edge referring to a lexical parameter or recursive declaration.
Region An owned scope or branch, such as a Lambda body or If branch.
Capture An external value or binding retained by a function body.
Closure A runtime function value with its source Lambda and captured context.
Sharing One producer value reaching multiple consumers.
SAVAM Source-Anchored Visual Abstract Machine: base-machine state plus source-anchored observations.
Provenance The persistent source elements associated with a machine component or runtime value.

B-Lambda presents a different Lambda workbench with its own evaluation and compiler views. MnL covers reactive block-based functional programming. Their controls and semantics should not be assumed to be GraphLambda features.

Return to L-Workshop for the wider project network.

GraphLambda is developed at L-Workshop .