Results 51 to 60 of about 228,658 (258)
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [PDF]
Logical Methods in Computer Science, 2021 We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
James Laird
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2014 A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces.
Miklós Bartha
doaj +1 more source
Inductive Definition and Domain Theoretic Properties of Fully Abstract [PDF]
, 2007 A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent non-deterministic ...
Luke Ong, Vladimir Sazonov
core +3 more sources
Reversible Barbed Congruence on Configuration Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e.
Clément Aubert, Ioana Cristescu
doaj +1 more source
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 +1 more source
QWIRE Practice: Formal Verification of Quantum Circuits in Coq [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The
Robert Rand +2 more
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
Steve Riddle, Peter J. L. Wallis
openaire +2 more sources
Semantics of a Typed Algebraic Lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space.
Benoît Valiron
doaj +1 more source
Analyzing logic programs with dynamic scheduling [PDF]
, 1994 Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in ...
García de la Banda, M. +2 more
core +2 more sources
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation [PDF]
Logical Methods in Computer ScienceWe propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with a denotational semantics, ERC provides a formal programming language-theoretic foundation to the algorithmic ...
Sewon Park +9 more
doaj +1 more source