2136 search results - page 362 / 428 » A Game-Theoretic Operational Semantics |
141
Voted
POPL
1998
ACM
15 years 8 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...
122
click to vote
GI
1998
Springer
15 years 8 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...
139
click to vote
POPL
1996
ACM
15 years 8 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...
147
click to vote
LICS
1994
IEEE
15 years 8 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 ...
160
click to vote
CSCW
1994
ACM
15 years 8 months ago
1994
ACM
The need to merge different versions of an object toa common state arises in collaborative computing due to several reasons including optimistic concurrency control, asynchronous ...