Continuity in Semantic Theories of Programming

History and Philosophy of Logic 36 (3):242-261 (2015)
  Copy   BIBTEX

Abstract

Continuity is perhaps the most familiar characterization of the finitary character of the operations performed in computation. We sketch the historical and conceptual development of this notion by interpreting it as a unifying theme across three main varieties of semantical theories of programming: denotational, axiomatic and event-based. Our exploration spans the development of this notion from its origins in recursion theory to the forms it takes in the context of the more recent event-based analyses of sequential and concurrent computations, touching upon the relations of continuity with non-determinism

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Characterising Near Continuity Constructively.Douglas Bridges & Luminiţa Vîţă - 2001 - Mathematical Logic Quarterly 47 (4):535-538.
Continuity in Fourteenth Century Theories of Alteration.Infinite Indivisible - 1982 - In Norman Kretzmann (ed.), Infinity and continuity in ancient and medieval thought. Ithaca, N.Y.: Cornell University Press. pp. 231--257.
Programming Languages as Technical Artifacts.Raymond Turner - 2014 - Philosophy and Technology 27 (3):377-397.
The continuity of consciousness.Roger T. Simonds - 1996 - Journal of Value Inquiry 30 (1-2):293-296.
Recent Work on Naturalized Epistemology.James Maffie - 1990 - American Philosophical Quarterly 27 (4):281 - 293.
The Continuity of Consciousness.Oliver Rashbrook - 2011 - European Journal of Philosophy 21 (4):611-640.
Explaining Referential Stability of Physics Concepts: The Semantic Embedding Approach. [REVIEW]Andreas Bartels - 2010 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 41 (2):267 - 281.
Leibniz on Continuity.Richard T. W. Arthur - 1986 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1986:107 - 115.

Analytics

Added to PP
2015-07-01

Downloads
20 (#764,377)

6 months
7 (#421,763)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Introduction to Symbolic Logic and Its Applications.H. Hermes - 1959 - Journal of Symbolic Logic 31 (2):287-287.

View all 9 references / Add more references