Skip to content
Beskid Platform specification

Beskid

Jump to a Beskid service

Beskid

Jump to a Beskid service

Flow and algorithm

Platform spec article

Flow and algorithm

Spec standingStandard

Owner
Piotr Mikstacki
Submitter
Piotr Mikstacki
  1. Input enters compiler/runtime boundary at a stable entrypoint.
  2. The responsible crate enforces the expected shape and emits stable structures.
  3. Downstream crates consume those structures without redefining semantics.
  4. Conformance tests assert behavior at integration boundaries.
  • Prefer tracing one fixture end-to-end before reading all modules.
  • Verify where shape conversion happens; avoid assuming all crates mutate data.
  • Keep an eye on handoff points where diagnostics or ABI constraints are locked.
  • Start with “beskid_analysis -> parser/resolution/semantic leaves.
  • Then inspect “beskid_codegen -> lowering contract leaves.
  • Follow consumption path at “beskid_abiandbeskid_runtime -> execution ABI/runtime leaves.
  • Validate expectations using “beskid_testsandbeskid_e2e_tests -> conformance leaves.