Sciweavers

520 search results - page 53 / 104
» An Algebraic Semantics for MOF
Sort
View
LISP
2006
105views more  LISP 2006»
13 years 8 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
SOFSEM
2009
Springer
14 years 5 months ago
Epistemic Strategies and Games on Concurrent Processes
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...
Konstantinos Chatzikokolakis, Sophia Knight, Praka...
LICS
1999
IEEE
14 years 1 months ago
Abstract Syntax and Variable Binding
Syntax and Variable Binding d Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh op a theory of abstract synt...
Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi
CSFW
1996
IEEE
14 years 27 days ago
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
Riccardo Focardi
DBPL
1991
Springer
76views Database» more  DBPL 1991»
14 years 7 days ago
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
Martin Erwig, Udo W. Lipeck