Results 61 to 70 of about 2,907 (227)
Modern Theology, EarlyView.Abstract Examining work by Rowan Williams, this essay explores what he often refers to as the ‘difficulty’ of writing theology. The difficulty of theology lies in engaging the ruse of having ultimate answers to ultimate questions. The stakes are high: ‘God‐talk’ must concern itself with truth, with reality.
Graham Ward
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
How Many Worlds Could There Be? David Lewis and Advanced Modalizing
Analytic Philosophy, EarlyView.ABSTRACT Advanced modalizing, namely, possibilities and necessities concerning modal space itself, is problematic for a Lewis‐style analysis of modality. A popular solution, proposed by Divers, postulates explicit semantic clauses for a collapse of advanced modalizing, to the conclusion that all such matters are, if true in the first place, both ...
Lorenzo Azzano +2 more
wiley +1 more source
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
Fold and Unfold for Program Semantics [PDF]
, 1998 In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion operator fold can be used to structure denotational semantics, how the ...
Hutton, Graham, Graham Hutton
core +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
Philosophy and Phenomenological Research, EarlyView.ABSTRACT Many philosophical disputes have become so intractable that philosophers question whether there is a fact of the matter as to which side is right or whether these disputes are entirely verbal. Yet these “metadisputes” have also become intractable. This raises the question: Could they, too, be verbal? What would that even mean? Using tools from
Alexander W. Kocurek
wiley +1 more source
Denotational semantics for timed testing
, 1997 In this paper we present a denotational semantics for a timed process algebra, which is fully abstract with respect to the must testing semantics previously developed [Lla96,LdFN96]. The domain of semantic processes is made up of consistent sets of barbs,
David de Frutos Escrig +3 more
core +1 more source
Disentangling Denotational Semantics Definitions
, 2008 Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equations in a definition may have to be aware of unrelated constructs semantics.
Saraiva,Joâo +5 more
core +1 more source