A dimensioned training board follows eight projects along one serpentine course: four half-adder cases, clocked and redundant registers, shared-node compilation, provenance-retaining JSON validation, checked dependency scheduling, provenance-preserving hierarchy with guarded feedback, and contracted cross-domain state exchange.
Eight-project verified digital-circuit tutorial board

ff-spartan6-tutorials

repository URL pending

Scope

ff-spartan6-tutorials is a sequence of eight Agda projects for learning verified digital-circuit construction in the Spartan-6 ecosystem. The sequence begins with combinational half-adder behavior, then introduces enabled and resettable registers observed over finite clock traces. Its middle projects study redundant sequential circuits, shared expression compilation, and the preservation of structured JSON and netlist evidence through validation. Later projects connect circuit lowering and dependency scheduling with hierarchy flattening, guarded feedback, clock-domain policy, and relational primitive contracts. A single Tutorials.Everything entry point brings these exercises into one safe, cubical checking scope built on ff-json.

Most important results

The first project covers all four half-adder input cases and establishes the corresponding sum and carry behavior without spurious state changes. The register projects establish reset priority, enable and idle behavior, two-edge traces, and agreement between a single toggle and redundant copies across finite runs. The compilation and lowering projects connect direct expression evaluation to compiled circuits while retaining shared-node values, validated JSON evidence, dependency order, resource accounting, and differential-pin relationships. The final projects account for flattened node provenance, reject unguarded feedback and unsupported cross-domain links, verify guarded state advance, and require semantic evidence before relational primitive modes become available.

Library modules

9 checked modules

Select a module to inspect its generated Agda source view.

Skip to content

Agda libraries

ff-spartan6-tutorials

ff-spartan6-tutorials is a sequence of eight Agda projects for learning verified digital-circuit construction in the Spartan-6 ecosystem.

Eight-project verified digital-circuit tutorial boardA dimensioned training board follows eight projects along one serpentine course: four half-adder cases, clocked and redundant registers, shared-node compilation, provenance-retaining JSON validation, checked dependency scheduling, provenance-preserving hierarchy with guarded feedback, and contracted cross-domain state exchange.
A dimensioned training board follows eight projects along one serpentine course: four half-adder cases, clocked and redundant registers, shared-node compilation, provenance-retaining JSON validation, checked dependency scheduling, provenance-preserving hierarchy with guarded feedback, and contracted cross-domain state exchange.

Scope

ff-spartan6-tutorials is a sequence of eight Agda projects for learning verified digital-circuit construction in the Spartan-6 ecosystem. The sequence begins with combinational half-adder behavior, then introduces enabled and resettable registers observed over finite clock traces. Its middle projects study redundant sequential circuits, shared expression compilation, and the preservation of structured JSON and netlist evidence through validation. Later projects connect circuit lowering and dependency scheduling with hierarchy flattening, guarded feedback, clock-domain policy, and relational primitive contracts. A single Tutorials.Everything entry point brings these exercises into one safe, cubical checking scope built on ff-json.

Most important results

The first project covers all four half-adder input cases and establishes the corresponding sum and carry behavior without spurious state changes. The register projects establish reset priority, enable and idle behavior, two-edge traces, and agreement between a single toggle and redundant copies across finite runs. The compilation and lowering projects connect direct expression evaluation to compiled circuits while retaining shared-node values, validated JSON evidence, dependency order, resource accounting, and differential-pin relationships. The final projects account for flattened node provenance, reject unguarded feedback and unsupported cross-domain links, verify guarded state advance, and require semantic evidence before relational primitive modes become available.

Source browser

Modules

Browse modulesOpen generated Agda sources

Cabinet index

Explore Formal Foundry

Search the archive

Find a page

Type to search the published content.