Results 21 to 30 of about 11,768 (185)
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 +1 more source
Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces [PDF]
Scientific Annals of Computer Science, 2014 In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one ...
B. Valiron, S. Zdancewic
doaj +1 more source
, 2010 The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic ...
Leroy, Xavier
core +4 more sources
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 +1 more source
Unifying Theories of Mobile Channels [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we present the denotational semantics for channel mobility in the Unifying Theories of Programming (UTP) semantics framework. The basis for the model is the UTP theory of reactive processes (precisely, the UTP semantics for Communicating ...
Gerard Ekembe Ngondi
doaj +1 more source
An Effect System for Algebraic Effects and Handlers [PDF]
Logical Methods in Computer Science, 2014 We present an effect system for core Eff, a simplified variant of Eff, which is an ML-style programming language with first-class algebraic effects and handlers. We define an expressive effect system and prove safety of operational semantics with respect
Andrej Bauer, Matija Pretnar
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
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
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
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