Results 111 to 120 of about 230,502 (255)
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
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 +4 more sources
Conjoined Comparison and Variation in Degree Semantics
Language and Linguistics Compass, Volume 19, Issue 4, July/August 2025.ABSTRACT Conjoined comparisons, consisting of two clauses containing antonymous or positive‐negative predicate pairs, are among the most common comparison construction types in the world's languages. As research on degree constructions from a cross‐linguistic perspective has increased, so too has the number of studies focused on conjoined comparisons ...
M. Ryan Bochnak
wiley +1 more source
Language and Linguistics Compass, Volume 19, Issue 4, July/August 2025.ABSTRACT Within formal semantics, languages with no exponent of tense, or with optional tense, have begun to be incorporated into the theory of temporality only in the last couple decades. This article traces the development of their study, identifying empirical arguments that arbitrate between competing analyses of tenselessness.
Maziar Toosarvandani
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
The agentive achievement of acceptance
Philosophy and Phenomenological Research, Volume 111, Issue 1, Page 3-24, July 2025.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
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
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
An Abstract Approach to Stratification in Linear Logic
, 2013 We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called light logics), from an abstract point of view, introducing a logical system in which stratification is
Boudes, Pierre +2 more
core +1 more source
Meaning and Reference in Programming Languages
PhilosophiesThis paper provides an analysis of the meaning–reference problem, as traditionally advanced in the philosophy of language, for imperative programming languages.
Nicola Angius
doaj +1 more source