Results 11 to 20 of about 85,558 (251)
Semantics for a Quantum Programming Language by Operator Algebras [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 This paper presents a novel semantics for a quantum programming language by operator algebras, which are known to give a formulation for quantum theory that is alternative to the one by Hilbert spaces.
Kenta Cho
doaj +7 more sources
A Model of Cooperative Threads [PDF]
Logical Methods in Computer Science, 2010 We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until they terminate or explicitly yield control.
Martín Abadi, Gordon D. Plotkin
doaj +11 more sources
Theorem proving support in programming language semantics [PDF]
arXiv, 2007 We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation.
Bertot, Yves
arxiv +5 more sources
On 0-Complete Partial Metric Spaces and Quantitative Fixed Point Techniques in Denotational Semantics [PDF]
Abstract and Applied Analysis, 2013 In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification.
N. Shahzad, O. Valero
doaj +2 more sources
Denotational Semantics of the Simplified Lambda-Mu Calculus and a New Deduction System of Classical Type Theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Classical (or Boolean) type theory is the type theory that allows the type inference (σ \to \bot) \to \bot => σ (the type counterpart of double-negation elimination), where σ is any type and \bot is absurdity type.
Ken Akiba
doaj +4 more sources
Probabilistic modal {\mu}-calculus with independent product [PDF]
Logical Methods in Computer Science, 2012 The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj +4 more sources
Disentangling Denotational Semantics Definitions [PDF]
, 2008 JUCS - Journal of Universal Computer Science Volume Nr.
Fábio Tirelo +2 more
openalex +4 more sources
Smart Choices and the Selection Monad [PDF]
Logical Methods in Computer Science, 2023 Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized by ...
Martin Abadi, Gordon Plotkin
doaj +1 more source
A Denotational Semantics for SPARC TSO [PDF]
Logical Methods in Computer Science, 2019 The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult.
Ryan Kavanagh, Stephen Brookes
doaj +1 more source
Biological Reviews, Volume 98, Issue 1, Page 81-98, February 2023., 2023 ABSTRACT The evolution of language has been investigated by several research communities, including biologists and linguists, striving to highlight similar linguistic capacities across species. To date, however, no consensus exists on the linguistic capacities of non‐human species.
Mélissa Berthet +3 more
wiley +1 more source