Results 1 to 10 of about 11,543 (183)
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 +4 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 +10 more sources
On the equivalence of game and denotational semantics for the probabilistic mu-calculus [PDF]
Logical Methods in Computer Science, 2012 The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS).
Matteo Mio
doaj +3 more sources
Denotational Semantics of A User-Oriented, Domain-Specific Language [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper presents the formal definition of a domain-specific language, named Pantagruel, following the methodology proposed by David Schmidt for language development.
Julien Mercadal +2 more
doaj +3 more sources
METRIC DENOTATIONAL SEMANTICS FOR REMOTE PROCESS DESTRUCTION AND CLONING
Studia Universitatis Babes-Bolyai: Series Informatica, 2017 We present a denotational semantics designed with continuations for a concurrent language providing a mechanism for synchronous communication, together with constructions for process creation, remote process destruction and cloning.
Eneia Nicolae TODORAN
doaj +3 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
Quantum Alternation: Prospects and Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement.
Costin Bădescu, Prakash Panangaden
doaj +1 more source
A Denotational Semantics for First-Order Logic [PDF]
, 2000 In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic.
E. M. Clarke +9 more
core +13 more sources
A Denotational Semantics for Communicating Unstructured Code [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 An important property of programming language semantics is that they should be compositional. However, unstructured low-level code contains goto-like commands making it hard to define a semantics that is compositional. In this paper, we follow the ideas
Nils Jähnig +2 more
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2018 The language Eff is an OCaml-like language serving as a prototype implementation of the theory of algebraic effects, intended for experimentation with algebraic effects on a large scale.
Oleg Kiselyov, KC Sivaramakrishnan
doaj +1 more source