Results 21 to 30 of about 11,408 (204)

A Simple Semantics and Static Analysis for Stack Inspection [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
The Java virtual machine and the .NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotational semantics in "eager" form, and show that it is equivalent to the "lazy"
Anindya Banerjee, David A. Naumann
doaj   +1 more source

Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces [PDF]

open access: yesScientific 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

Inductive Definition and Domain Theoretic Properties of Fully Abstract [PDF]

open access: yes, 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

Semantics for a Quantum Programming Language by Operator Algebras [PDF]

open access: yesElectronic 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

Denotational Semantics of Hybrid Automata [PDF]

open access: yesThe Journal of Logic and Algebraic Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edalat, Abbas, Pattinson, Dirk
openaire   +2 more sources

Process Algebras [PDF]

open access: yes, 2011
Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems.
De Nicola, Rocco
core   +1 more source

Unifying Theories of Mobile Channels [PDF]

open access: yesElectronic 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

A denotational semantics for Timed Linda [PDF]

open access: yesProceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, 2001
In [5] we introduced a Timed Linda language (T-Linda) whic hwas obtained by a natural timed interpretation of the usual constructs of the Linda model and by including a simple primitive for specifying time-outs. Here we define a denotational model for T-Linda which is based on timed reactive sequences.
Frank S. de Boer   +2 more
openaire   +4 more sources

An Effect System for Algebraic Effects and Handlers [PDF]

open access: yesLogical 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

Quantum Turing automata [PDF]

open access: yesElectronic 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

Home - About - Disclaimer - Privacy