Results 91 to 100 of about 85,558 (251)
The agentive achievement of acceptance
Philosophy and Phenomenological Research, EarlyView.Abstract Is acceptance an act or a state? Jonathan Cohen is often seen as a proponent of the view that acceptance is a mental act. In contrast, Michael Bratman claims that acceptance is a mental state. This paper argues that the evidence supports a more subtle approach.
Samuel Boardman
wiley +1 more source
A Categorical Model for a Quantum Circuit Description Language (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Quipper is a practical programming language for describing families of quantum circuits. In this paper, we formalize a small, but useful fragment of Quipper called Proto-Quipper-M.
Francisco Rios, Peter Selinger
doaj +1 more source
Denotational semantics for thread algebra
The 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 +3 more sources
The Sigma-Semantics: A Comprehensive Semantics for Functional Programs [PDF]
, 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
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
Service-Oriented Logic Programming [PDF]
Logical Methods in Computer Science, 2015 We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work builds on recent theoretical advancements in the algebraic structures that capture the way services are orchestrated and in the processes that
Ionut Tutu, Jose Luiz Fiadeiro
doaj +1 more source
The Correctness of Launchbury's Natural Semantics for Lazy Evaluation [PDF]
arXiv, 2014 In his seminal paper "A Natural Semantics for Lazy Evaluation", John Launchbury proves his semantics correct with respect to a denotational semantics. We machine-checked the proof and found it to fail, and provide two ways to fix it: One by taking a detour via a modified natural semantics with an explicit stack, and one by adjusting the denotational ...
arxiv
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
Divergence and unique solution of equations [PDF]
Logical Methods in Computer Science, 2019 We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations ...
Adrien Durier +2 more
doaj +1 more source
Denotational semantics of recursive types in synthetic guarded domain theory [PDF]
arXiv, 2018 Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has proven challenging.
arxiv