44#
55# HAL accepts PDF upload + manual metadata entry.
66# This file documents the values to enter.
7+ #
8+ # PDF to upload: docs/arxiv/typed-wasm.pdf (compiled from typed-wasm.tex)
9+ # Zenodo DOI already live: 10.5281/zenodo.19535653
710
811title : " typed-wasm: Progressive Type Safety for WebAssembly Linear Memory"
912
@@ -18,25 +21,26 @@ abstract: |
1821 module boundaries. When independently compiled modules — potentially from
1922 different source languages — read and write the same memory regions, no
2023 existing type system covers the cross-module interface. We present
21- typed-wasm, a type system that applies a checked 10 -level progressive type safety
24+ typed-wasm, a type system that applies a 12 -level progressive type safety
2225 framework, originally developed for database query languages, to Wasm
23- linear memory. The system treats contiguous memory segments as typed
24- region schemas and load/store operations as typed projections verified
25- against those schemas at compile time. We formalise the system in Idris 2
26- using Quantitative Type Theory (QTT), providing proofs of bounds safety,
27- aliasing freedom, effect purity, lifetime validity, and linearity — all
28- erased before code generation, yielding zero runtime overhead. Our principal
29- contribution is
30- multi-module schema agreement: a static verification that independently
31- compiled Wasm modules agree on the layout, types, alignment, and
32- invariants of shared memory regions — a property that no source-level
33- type system, and no existing Wasm proposal, can express. The repository
34- also contains draft research extensions for tropical cost-tracking and
35- epistemic safety, but these are not part of the current checked claim
36- envelope.
26+ linear memory. The system treats contiguous memory segments as typed region
27+ schemas and load/store operations as typed projections verified against
28+ those schemas at compile time. We formalise the system in Idris 2 using
29+ Quantitative Type Theory (QTT), providing proofs of bounds safety, aliasing
30+ freedom, effect purity, lifetime validity, linearity, cost boundedness, and
31+ epistemic freshness — all erased before code generation, yielding zero
32+ runtime overhead. Our principal contribution is multi-module schema
33+ agreement: a static verification that independently compiled Wasm modules
34+ agree on the layout, types, alignment, and invariants of shared memory
35+ regions — a property that no source-level type system, and no existing Wasm
36+ proposal, can express. We further extend the framework with two novel
37+ levels: tropical cost-tracking (Level 11), which proves that memory access
38+ patterns have bounded cost via a min-plus semiring, and epistemic safety
39+ (Level 12), which prevents modules from acting on stale knowledge of shared
40+ state.
3741
3842# HAL document type
39- document_type : preprint # "preprint" or "conference paper" or "journal article"
43+ document_type : preprint
4044
4145# HAL domain classification
4246domains :
@@ -54,15 +58,18 @@ keywords:
5458 - memory safety
5559 - formal verification
5660 - Idris2
61+ - tropical semiring
62+ - epistemic logic
5763 - schema agreement
5864
5965language : en
6066
6167# File to upload
62- file : typed-wasm.pdf # Compile typed-wasm.tex first
68+ file : typed-wasm.pdf # Already compiled — use docs/arxiv/ typed-wasm.pdf
6369
6470# License for HAL deposit
6571license : " CC-BY-4.0" # HAL prefers Creative Commons; PMPL for code, CC-BY for the paper text
6672
6773# Additional links
6874software : " https://github.com/hyperpolymath/typed-wasm"
75+ related_identifier : " https://doi.org/10.5281/zenodo.19535653" # Zenodo deposit
0 commit comments