Sciweavers

34 search results - page 7 / 7
» The Rewriting Calculus as a Semantics of ELAN
Sort
View
TACS
1994
Springer
15 years 3 months ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...
PODS
2004
ACM
120views Database» more  PODS 2004»
15 years 11 months ago
Locally Consistent Transformations and Query Answering in Data Exchange
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions ? ta...
Marcelo Arenas, Pablo Barceló, Ronald Fagin...
HASKELL
2009
ACM
15 years 6 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 11 months ago
Expressiveness of Generic Process Shape Types
METAI is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the -calculus,...
Jan Jakubuv, J. B. Wells