An Agda implementation of an intrinsically typed CEK machine proves type preservation and a scheduler-defined relative progress property for a functional session-typed calculus with recursion and subtyping.
Acta Informatica 42, 2-3 (2005), 191–225
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Intrinsically-Typed Mechanized Semantics for Session Types
An Agda implementation of an intrinsically typed CEK machine proves type preservation and a scheduler-defined relative progress property for a functional session-typed calculus with recursion and subtyping.