Results 61 to 70 of about 11,408 (204)

Denotational Semantics and Refinement [PDF]

Electronic Workshops in Computing, 1997
Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may
Steve Riddle, Peter J. L. Wallis
openaire   +1 more source

Inquiry and Logical Form

Philosophical Perspectives, EarlyView.
ABSTRACT Joint inquiry requires agents to exchange public content about some target domain, which in turn requires them to track which content a linguistic form contributes to a conversation. But, often, the inquiry delivers a necessary truth. For example, if we are inquiring whether a particular bird, Tweety, is a woodpecker, and discover that it is ...
Una Stojnić, Matthew Stone
wiley   +1 more source

The I in logic

Theoria, EarlyView.
Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley   +1 more source

Verification of Control System Runtime Using an Executable Semantic Model

Algorithms
The paper outlines a methodology for validating the accuracy of a control system’s runtime implementation. The runtime takes the form of a virtual machine executing portable code compliant with IEC 61131-3 standards.
Jan Sadolewski, Bartosz Trybus
doaj   +1 more source

QRB-Domains and the Probabilistic Powerdomain [PDF]

Logical Methods in Computer Science, 2012
Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj   +1 more source

The Measurement Calculus [PDF]

, 2007
Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where the notion of measurement is the main driving force of computation.
Abramsky S., Brassard G., Chen Q., D'Hondt E., Deutsch D., Deutsch D., Deutsch D., Deutsch D., Duncan R., Dürr C., Elham Kashefi, Nielsen M. A., Perdrix S., Peres A., Prakash Panangaden, Schlingemann D., Selinger P., Selinger P., Selinger P., Ed., Tame M. S., Vincent Danos, Ömer B.   +21 more
core   +3 more sources

Winged horses, rascals and discourse referents

Theoria, EarlyView.
Abstract This paper discusses some remarks Kaplan made in ‘Bob and Carol and Ted and Alice’ concerning empty names. I show how his objections to a particular view involving descriptions derived from Ramsification can be avoided by a nearby alternative framed in terms of discourse reference.
Andreas Stokke
wiley   +1 more source

On phase semantics and denotational semantics: the exponentials

Annals of Pure and Applied Logic, 2001
An indexed version of propositional linear logic with exponentials is defined together with a sequent calculus for this system. To a formula \(A\) of indexed linear logic are associated: an underlying formula \(\underline{A}\) of linear logic, an interpretation \(|\underline{A}|\) of this formula in the category of sets and relations, and a family ...
Ehrhard, Thomas, Bucciarelli, Antonio
openaire   +2 more sources

(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English

Theoria, EarlyView.
ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley   +1 more source

A proof-theoretic view on scheduling in concurrency [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non ...
Emmanuel Beffara
doaj   +1 more source