Results 51 to 60 of about 11,543 (183)
What are particularistic pejoratives?
Mind &Language, EarlyView.Particularistic pejoratives (PPs) mock individuals based on their personal attributes yet lack a precise definition. This paper seeks to refine our understanding of PPs by examining their derogatory profiles across three dimensions: descriptiveness, intensity, and slurring potential.
Víctor Carranza‐Pinedo
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
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
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
A synthesis view of counterfactuals
Philosophy and Phenomenological Research, EarlyView.Abstract There are two prominent views of counterfactuals in the literature—variably strict conditional accounts developed by Stalnaker 1968 and D. K. Lewis 1973, and strict conditional accounts defended by von Fintel 2001, Gillies 2007, and others. Unfortunately, both views face serious challenges. This paper argues that traditional strict conditional
Sarah Moss
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 algebraic basis for specifying and enforcing access control in security systems [PDF]
, 2000 Security services in a multi-user environment are often based on access control mechanisms. Static aspects of an access control policy can be formalised using abstract algebraic models.
Pahl, Claus
core
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
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