From left to right, a reflected application tree passes three admitted traces through a fuel-bounded whitelist while a fourth is rejected, then becomes three semantic representation ribbons with four provenance symbols and a three-way discourse fan. Below, four structured failure traces terminate at crosses, and a vertical macro caliper selects the middle of five distinct realization rails.
Reflected term to semantic explanation candidates

semantic-explanation

repository URL pending

Scope

semantic-explanation formalizes a domain-configurable route from reflected Agda terms to human-readable explanations. It represents propositions and expressions in a semantic intermediate representation that records binders, surface forms, and provenance. Domain specifications classify entity, predicate, expression, and infrastructure heads, while discourse profiles supply controlled statement labels and entity references. Reflection modules expose application spines and dependent function structure and restrict reduction to an explicit whitelist. Translation, realization, and macro modules connect those pieces into selectable explanation families for declarations.

Most important results

The translator handles atoms, equalities, implications, universal binders, and closed terms, returning structured failures by phase, tag, path, detail, and attempted rules. Translation preserves provenance for rules, unfolded aliases, and omitted binders or arguments. Realization offers canonical, compact, evidence-oriented, structured, and domain-evidence renderings, groups them into candidate sets, and supports selection by candidate identifier. The reflection macros expose fuel-bounded entry points for explaining names and report translation or candidate-selection failures through Agda’s type-checking interface.

Library modules

11 checked modules

Select a module to inspect its generated Agda source view.

Skip to content

Agda libraries

semantic-explanation

semantic-explanation formalizes a domain-configurable route from reflected Agda terms to human-readable explanations.

Reflected term to semantic explanation candidatesFrom left to right, a reflected application tree passes three admitted traces through a fuel-bounded whitelist while a fourth is rejected, then becomes three semantic representation ribbons with four provenance symbols and a three-way discourse fan. Below, four structured failure traces terminate at crosses, and a vertical macro caliper selects the middle of five distinct realization rails.
From left to right, a reflected application tree passes three admitted traces through a fuel-bounded whitelist while a fourth is rejected, then becomes three semantic representation ribbons with four provenance symbols and a three-way discourse fan. Below, four structured failure traces terminate at crosses, and a vertical macro caliper selects the middle of five distinct realization rails.

Scope

semantic-explanation formalizes a domain-configurable route from reflected Agda terms to human-readable explanations. It represents propositions and expressions in a semantic intermediate representation that records binders, surface forms, and provenance. Domain specifications classify entity, predicate, expression, and infrastructure heads, while discourse profiles supply controlled statement labels and entity references. Reflection modules expose application spines and dependent function structure and restrict reduction to an explicit whitelist. Translation, realization, and macro modules connect those pieces into selectable explanation families for declarations.

Most important results

The translator handles atoms, equalities, implications, universal binders, and closed terms, returning structured failures by phase, tag, path, detail, and attempted rules. Translation preserves provenance for rules, unfolded aliases, and omitted binders or arguments. Realization offers canonical, compact, evidence-oriented, structured, and domain-evidence renderings, groups them into candidate sets, and supports selection by candidate identifier. The reflection macros expose fuel-bounded entry points for explaining names and report translation or candidate-selection failures through Agda’s type-checking interface.

Used by

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.