Skip to content

Commit 3c6f0e9

Browse files
Add preliminary Agda formalisation of echo types
Initial formalisation of echo types in Agda, detailing their definition, current development status, and conditions for falsifiability.
1 parent 5272ab2 commit 3c6f0e9

1 file changed

Lines changed: 72 additions & 0 deletions

File tree

Abstract-Echo-Types

Lines changed: 72 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,72 @@
1+
= Echo Types: A Constructive Formalisation of Structured Loss
2+
Joshua Jewell <joshua@example.invalid>
3+
:description: Preliminary Agda formalisation of echo types as a first-class notion of structured loss.
4+
:keywords: Agda, dependent types, fibers, structured loss, provenance, formal verification, constructive mathematics
5+
:revdate: 2026-04-20
6+
:revnumber: preliminary
7+
:icons: font
8+
9+
[.lead]
10+
Echo types are a proposed formal object for reasoning about irreversible
11+
computation that retains a proof-relevant constraint on what was lost.
12+
13+
== Definition
14+
15+
Given `f : A → B` and `y : B`, the echo is the fiber
16+
17+
[source, agda]
18+
----
19+
Echo f y := Σ (x : A) , (f x ≡ y)
20+
----
21+
22+
This is standard sigma/fiber machinery. The contribution of this
23+
repository is not the definition but the attempt to establish whether
24+
"echo type" names a distinct phenomenon worth studying as a primary
25+
object, rather than a decorative wrapper around existing constructions.
26+
27+
== Current development
28+
29+
The Agda development is safe and uses no postulates. It provides:
30+
31+
* the core fiber definition and introduction;
32+
* action on fibers for morphisms over a fixed base, with identity and
33+
composition laws;
34+
* action along commuting squares;
35+
* explicit non-injectivity witnesses for collapse maps;
36+
* no-section results establishing the impossibility of full
37+
reconstruction from visible output alone;
38+
* a retained-constraint result for projection-style structured loss.
39+
40+
Eight modules extend this foundation toward choreographic, epistemic,
41+
affine/linear, graded, and tropical settings.
42+
43+
== Falsifiability
44+
45+
The identity claim for echo types is treated as falsifiable. It is
46+
established only if three conditions are met:
47+
48+
. a distinct phenomenon;
49+
. a characteristic theorem family that is not reducible to generic
50+
sigma lemmas;
51+
. canonical examples where "echo type" is the right explanatory unit.
52+
53+
[IMPORTANT]
54+
====
55+
If any of these fails during development, the result is recorded and
56+
the identity claim is retracted.
57+
====
58+
59+
See `roadmap.adoc` for the decision gates that operationalise each
60+
condition.
61+
62+
== Status
63+
64+
This is a preliminary formalisation and a work in progress. The
65+
repository is released to establish a citable reference point for the
66+
approach and to invite scrutiny of the three falsifiability conditions
67+
in particular.
68+
69+
== Keywords
70+
71+
Agda; dependent types; fibers; structured loss; provenance; formal
72+
verification; constructive mathematics.

0 commit comments

Comments
 (0)