Abstract
We provide a category theoretic reformulation of control structures, which avoids explicit reference to names. The basis of the formulation is what we call a binding structure, which accounts for naming and the associated operation of binding in isolation, i.e. without reference to extra features. Upon adding structure to such a binding structure we arrive at fibrational control structures, which (with a mild extra condition) we show equivalent to locally finite control structures, those in which every action has a finite surface.
This author acknowledges funding from the CLICS II ESPRIT project.
This author gratefully acknowledges the support of ESPRIT Basic Research Action 6453: Types for proofs and programs, and also the BRICS grant, which has funded two visits to Aarhus to work on this paper.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Interaction categories and the foundations of typed concurrent programming. In Proc. '94 Marktoberdorf Summer School. Springer-Verlag, 1995. to appear.
P. Gardner. A name-free account of action calculi. In Proc. 11th Conf. on Mathematical Foundations of Program Semantics, 1995.
C. Hermida and B. Jacobs. Fibrations with indeterminates: Contextual and functional completeness for polymorphic lambda calculi. In Book of Abstracts of Category Theory in Computer Science 5, September 1993. Extended version to appear in Mathematical Structures in Computer Science.
C. Hermida and A.J. Power. Fibrational control structures (expanded version). available by ftp from ftp.cl.cam.ac.uk as acpi/cs4.ps.Z, May 1995.
J. Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic, volume 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986.
S. MacLane. Categories for the Working Mathematician. Springer Verlag, 1971.
R. Mimer. Action structures. Technical Report LFCS-92-249, Laboratory for Foundations of Computer Science, Dept. of Comp. Sci., Univ. of Edinburgh, 1992.
R. Milner. Action calculi, or syntactic action structures. In Proc. MFCS '93, volume 711 of Lecture Notes in Computer Science, pages 105–121. Springer Verlag, 1993.
J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.
A. Mifsud, R. Milner, and J. Power. Control structures. In Proc. 10th Conf. on Logic in Computer Science (LICS). IEEE, 1995.
J. Power and E. Robinson. Premonoidal categories and notions of computation. unpublished draft, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hermida, C., Power, J. (1995). Fibrational control structures. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-60218-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60218-7
Online ISBN: 978-3-540-44738-2
eBook Packages: Springer Book Archive