Persistent queues — unchecked contract
Lax755887.PersistentQueueContract · concepts/Lax755887/PersistentQueueContract.lean · lax-755887
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Repeated calls may reuse one queue and spend its potential more than once. The telescoping contract deliberately omits compatibility of adjacent potentials.
This is an intentionally false contract, retained as an open proof obligation.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
No proof in the archive yet — this claim is open.
Lean source view on GitHub
| 1 | import Lax755887.PersistentQueue |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Persistent queues — unchecked contract |
| 6 | type: theorem |
| 7 | --- |
| 8 | Repeated calls may reuse one queue and spend its potential more than once. The telescoping contract deliberately omits compatibility of adjacent potentials. |
| 9 | |
| 10 | This is an intentionally false contract, retained as an open proof obligation. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax755887.PersistentQueueContract |
| 14 | |
| 15 | open Lax755887.PersistentQueue |
| 16 | |
| 17 | axiom telescoping (first : Charge) (rest : List Charge) : |
| 18 | (totalWork (first :: rest) : ℤ) ≤ |
| 19 | ((first :: rest).map amortized).sum + first.before |
| 20 | |
| 21 | end Lax755887.PersistentQueueContract |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments