Results 1 to 10 of about 246 (185)
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 +5 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
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 +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 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
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 +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
Abstract Interpretation as a Programming Language [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In David Schmidt's PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators.
Mads Rosendahl
doaj +1 more source
Logical Methods in Computer Science, 2006 Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications.
Jiri Adamek, Stefan Milius, Jiri Velebil
doaj +1 more source
Denotational Semantics and Refinement [PDF]
Electronic Workshops in Computing, 1997 Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may
S. Riddle, P. Wallis
openaire +2 more sources