440+ behaviors you compose, each checked by the compiler.
Dijkstra settles the nearest unvisited node, relaxing its edges.
settle A at 0 — relax A→B: 0+4 < ∞ — update
orbital Tasks {
uses Browse from "std/behaviors/std-browse"
entity Task [persistent: tasks] {
id : string!
title : string!
}
trait TaskList = Browse.traits.BrowseItemBrowse -> Task {
config {
browseLook: dense
}
}
page "/tasks" -> TaskList
}
The language where the rule is the program.