The essence of monotonic state - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

The essence of monotonic state


We extend a static type-and-capability system with new mechanisms for expressing the promise that a certain abstract value evolves monotonically with time; for enforcing this promise; and for taking advantage of this promise to establish non-trivial properties of programs. These mechanisms are independent of the treatment of mutable state, but combine with it to offer a flexible account of "monotonic state". We apply these mechanisms to solve two reasoning challenges that involve mutable state. First, we show how an implementation of thunks in terms of references can be assigned types that reflect time complexity properties, in the style of Danielsson (2008). Second, we show how an implementation of hash-consing can be assigned a specification that conceals the existence of an internal state yet guarantees that two pieces of input data receive the same code if and only if they are equal.
Fichier principal
Vignette du fichier
pilkiewicz-pottier-monotonicity.pdf (344.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01081193 , version 1 (07-11-2014)



Alexandre Pilkiewicz, François Pottier. The essence of monotonic state. TLDI 2011: The Sixth ACM SIGPLAN Workshop on Types in Language Design and Implementation, Jan 2011, Austin, United States. ⟨10.1145/1929553.1929565⟩. ⟨hal-01081193⟩


78 View
155 Download



Gmail Facebook Twitter LinkedIn More