Results 91 to 100 of about 228,658 (258)

Modular Composition of Language Features through Extensions of Semantic Language Models [PDF]

open access: yes, 1999
Today, programming or specification languages are often extended in order to customize them for a particular application domain or to refine the language definition. The extension of a semantic model is often at the centre of such an extension.
Pahl, Claus
core   +1 more source

Quotation for Dummies

open access: yesPhilosophical 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

Fair Testing [PDF]

open access: yes, 2005
In this paper we present a solution to the long-standing problem of characterising the coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process algebra. In fact, we present two distinct characterisations, which give rise
Rensink, Arend, Vogler, W.
core   +2 more sources

Uneventful: Event Semantics for “Qua”

open access: yesPhilosophical 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

The Sigma-Semantics: A Comprehensive Semantics for Functional Programs [PDF]

open access: yes, 1996
A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every ...
Chitil, Olaf
core   +4 more sources

Errant Implicature

open access: yesPhilosophical Perspectives, EarlyView.
ABSTRACT To measure is to err. Serving both numeric and non‐numeric measurement, the language of measurement refers to margins of error, within which measurement reports locate their measurements. Such reports and reasoning from them invoke what is known and what is known to be known about error‐strewn measurement to derive and contrast the ...
Barry Schein
wiley   +1 more source

Denotational semantics for thread algebra

open access: yesThe Journal of Logic and Algebraic Programming, 2008
AbstractThis paper gives a denotational semantics for thread algebra (TA), an algebraic framework for the description and analysis of recent programming languages such as C# and Java [J.A. Bergstra, C.A. Middelburg, Thread algebra for strategic interleaving, Formal Aspects of Computing, in press.
openaire   +4 more sources

Abstract Hidden Markov Models: a monadic account of quantitative information flow [PDF]

open access: yesLogical Methods in Computer Science, 2019
Hidden Markov Models, HMM's, are mathematical models of Markov processes with state that is hidden, but from which information can leak. They are typically represented as 3-way joint-probability distributions.
Annabelle McIver   +2 more
doaj   +1 more source

Pure Event Semantics

open access: yesPhilosophical Perspectives, EarlyView.
ABSTRACT In a pure event semantics for natural language, the domain of quantification and predication is limited to events and states. I offer pure event semantic analyses of several phenomena, some of which have not been treated before in formal semantics. In the pure event semantics sketched in the second section, nouns are state predicates, and this
Roger Schwarzschild
wiley   +1 more source

Labelled transition systems as a Stone space [PDF]

open access: yesLogical Methods in Computer Science, 2005
A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events.
Michael Huth
doaj   +1 more source

Home - About - Disclaimer - Privacy