Sequential algorithms as bistable maps

Pierre-Louis Curien 1, 2, *
* Corresponding author
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : 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.
Document type :
Book sections
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download
Contributor : Pierre-Louis Curien <>
Submitted on : Monday, June 18, 2007 - 9:30:13 AM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM
Document(s) archivé(s) le : Friday, September 21, 2012 - 4:35:30 PM


Files produced by the author(s)


  • HAL Id : hal-00155296, version 1



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⟩



Record views


Files downloads