In CLAUS Report Nr 86. Saarbrücken: University of the Saarland. pp. 1-27 (1997))

Authors
Reinhard Muskens
University of Amsterdam
Abstract
In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of {\em Scott Induction\/} holds in this new setting, prove soundness of a Hoare calculus relative to our semantics, give a direct calculus ${\cal C}$ on programs, and prove that the denotation of any program $P$ in our semantics is equal to the union of the denotations of all those programs $L$ such that $P$ follows from $L$ in our calculus and $L$ does not contain recursion or choice.
Keywords logical semantics of programming languages
Categories (categorize this paper)
Buy the book Find it on Amazon.com
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 58,797
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Proper Treatment of Quantification in Ordinary English.Richard Montague - 1973 - In Patrick Suppes, Julius Moravcsik & Jaakko Hintikka (eds.), Approaches to Natural Language. Dordrecht. pp. 221--242.
Completeness in the Theory of Types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
A Formulation of the Simple Theory of Types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):56-68.
Exploring Logical Dynamics.Johan van Benthem - 2001 - Studia Logica 67 (1):111-114.

View all 9 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
58 ( #175,783 of 2,425,665 )

Recent downloads (6 months)
1 ( #546,862 of 2,425,665 )

How can I increase my downloads?

Downloads

My notes