2678 search results - page 473 / 536 » Operational Semantics of Transactions |
IFM
1999
Springer
15 years 6 months ago
1999
Springer
: Some of the shortcomings of using refinement alone as the means of passing from high level simple models to actual detailed implementations are reviewed. Retrenchment is presente...
125
click to vote
POPL
1998
ACM
15 years 6 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
GI
1998
Springer
15 years 6 months ago
1998
Springer
Computing aggregates over selected categories of multidimensional discrete data (MDD) cubes is the core operation of many on-line analytical processing (OLAP) systems. In order to...
114
click to vote
POPL
1996
ACM
15 years 5 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
123
click to vote
LICS
1994
IEEE
15 years 5 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...