Results 81 to 90 of about 230,502 (255)
Classical logic, continuation semantics and abstract machines [PDF]
, 1998 One of the goals of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines.
B. Reus +2 more
core +2 more sources
Uniquely human temporal thoughts
Mind &Language, EarlyView.Life on Earth will eventually come to an end. The thought expressed in the previous sentence is about a point in time that is not known to the individual entertaining the thought. This paper is concerned with the nature of such temporal thoughts. We propose that the capacity to mentally represent thoughts about non‐specific temporal intervals is a ...
İsa Kerem Bayırlı
wiley +1 more source
Philosophical Perspectives, EarlyView.ABSTRACT This paper gives a new account of the actuality entailments of ability claims. We observe that, in the environments which give rise to the actuality entailment, ability claims carry a presupposition of trying. We show that, given this presupposition, the actuality entailment is straightforwardly predicted by a conditional theory of ability. We
David Boylan, Ginger Schultheis
wiley +1 more source
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We define a domain-specific language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts.
Azer Bestavros, Assaf Kfoury
doaj +1 more source
RedAlert: Determinacy Inference for Prolog [PDF]
, 2011 This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions ...
King, Andy, Kriener, Jael
core +3 more sources
Philosophical Perspectives, EarlyView.ABSTRACT Quotation marks in natural language that do not function straightforwardly as devices for securing reference to linguistic objects have generally been categorized as instances of either mixed quotation or scare quotation. I argue that certain uses of quotation marks in natural language resist assimilation to either of these two theoretical ...
Cameron Domenico Kirk‐Giannini
wiley +1 more source
Verification of Control System Runtime Using an Executable Semantic Model
AlgorithmsThe 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
An Adequate While-Language for Hybrid Computation
, 2019 Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology.
Goncharov, Sergey, Neves, Renato
core +1 more source
Uneventful: Event Semantics for “Qua”
Philosophical Perspectives, EarlyView.ABSTRACT Event semantics promise a straightforward account of the truth conditions of qualifications with “as” or “qua” as well as the inferences such qualifications license. In this paper, I argue that these promises are difficult to keep. On natural ways of developing the view, an event semantics of qualification yields either the wrong predictions ...
Annina Loets
wiley +1 more source