DRAKON¶
A flowchart-like visual algorithm notation designed around standardized control-flow icons, structured silhouettes, and readability rules.
Core Idea¶
DRAKON is a diagrammatic language and family of tool-supported notations for expressing algorithms and processes with constrained layout, branching, loops, and optional language-specific action content. A governed icon grammar and layout rules map control structures to paths intended to be visually traced; code-generating variants attach textual statements while retaining the diagram's control-flow skeleton. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
DRAKON belongs to visual programming languages and is useful where the analyst can specify the typed visual programming languages carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the diagram obeys the DRAKON icon grammar and structural layout rules so its control-flow meaning can be recovered unambiguously. The scope is broad within that domain but bounded by the need for the diagram obeys the DRAKON icon grammar and structural layout rules so its control-flow meaning can be recovered unambiguously. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the diagram obeys the DRAKON icon grammar and structural layout rules so its control-flow meaning can be recovered unambiguously the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name DRAKON can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to DRAKON. DRAKON compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed visual programming languages carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the diagram obeys the DRAKON icon grammar and structural layout rules so its control-flow meaning can be recovered unambiguously independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of visual programming languages because they reuse the typed visual programming languages carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A governed icon grammar and layout rules map control structures to paths intended to be visually traced; code-generating variants attach textual statements while retaining the diagram's control-flow skeleton., and type the carrier, state every parameter and convention in the definition, test that the diagram obeys the DRAKON icon grammar and structural layout rules so its control-flow meaning can be recovered unambiguously, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction DRAKON Domain-specific
Parents (1) — more general patterns this builds on
-
DRAKON is a kind of Representation Prime
The proposed strict upward parent is
prime:representation.
Hierarchy path (1) — routes to 1 parentless root
- DRAKON → Representation → Abstraction
Neighborhood in Abstraction Space¶
DRAKON sits in a moderately populated region (56th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Formal Grammars & Language Hierarchies (16 abstractions)
Nearest neighbors
- Stropping (syntax) — 0.89
- Programming language — 0.88
- Virtual class — 0.88
- Type signature — 0.87
- Context-free language reachability — 0.87
Computed from structural-signature embeddings · 2026-09-08