Results 91 to 100 of about 11,766 (228)
Distributed measurement-based quantum computation
, 2005 We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need to model it as
D'Hondt, Ellie +3 more
core +1 more source
Displacement and quantification without representation
Mind &Language, Volume 40, Issue 4, Page 418-436, September 2025.Perry and Recanati have argued that thought and speech can concern entities that they do not represent. This is possible because speakers and thinkers are pragmatically situated within their environs. I argue that thought and speech can go much farther than that.
Mihnea Capraru
wiley +1 more source
Towards the Formal Specification and Verification of Maple Programs
, 2012 In this paper, we present our ongoing work and initial results on the formal specification and verification of MiniMaple (a substantial subset of Maple with slight extensions) programs.
D.A. Schmidt +5 more
core +1 more source
In defense of value incomparability: A reply to Dorr, Nebel, and Zuehl
Noûs, Volume 59, Issue 3, Page 796-808, September 2025.Abstract Cian Dorr, Jacob Nebel, and Jake Zuehl have argued that no objects are incomparable in value. One set of arguments they offer depart from a principle they call ‘Strong Monotonicity’, which states that if x is good and y is not good, then x is better than y.
Erik Carlson, Olle Risberg
wiley +1 more source
Disentangling Parallelism and Interference in Game Semantics [PDF]
Logical Methods in Computer ScienceGame semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a ...
Simon Castellan, Pierre Clairambault
doaj +1 more source
Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs [PDF]
, 2014 We extract a novel quantum programming paradigm - superposition of programs - from the design idea of a popular class of quantum algorithms, namely quantum walk-based algorithms.
Feng, Yuan, Ying, Mingsheng, Yu, Nengkun
core
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
, 2009 The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation.
Corrado Böhm +3 more
core +1 more source
Theoretical Computer Science, 1984 In this paper we propose a new denotational semantics for CSP. The domains used in the semantics are very simple, compared to those used in other approaches to the semantics of CSP. Moreover, our denotations are more abstract than those of the other approaches.
openaire +1 more source
Operational and denotational semantics of prolog
The Journal of Logic Programming, 1987 A Vienna Definition Language operational semantics of PROLOG, which includes the cut, the database, and the extra-logical operations, is presented. This semantics serves as the basis for deriving a denotational-continuation-style semantics of PROLOG through a systematic transformation of the operational semantics by a method described by Berry.
Arbab, Bijan, Berry, Daniel M.
openaire +1 more source
, 2014 The Clock Constraint Specification Language (CCSL) has been informally introduced in the specifications of the \uml Profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE). In a previous report entitled ``Syntax and Semantics of the Clock Constraint Specification Language'', we equipped a kernel of CCSL with an operational semantics.
Deantoni, Julien +2 more
openaire +1 more source