Sequential algorithms as bistable maps

Pierre-Louis Curien (1, 2)

1 PPS - Preuves, Programmes et Systèmes
2 PI.R2 - Design, study and implementation of languages for proofs and programs

We exhibit Cartwright-Curien-Felleisen's model of observably sequential algorithms as a full subcategory of Laird's bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms as affine bistable functions in the full subcategory of locally boolean orders.

Mots clés: sémantique dénotationnelle; séquentialité

Domaines: Logique en informatique [cs.LO]

Pierre-Louis Curien. Sequential algorithms as bistable maps. Yves Bertot, Gérard Huet, Jean-Jacques Lévy and Gordon Plotkin. From semantics to computer science: essays in honour of Gilles Kahn, Cambridge University Press, pp.51-71, 2009. ⟨hal-00155296⟩