Sciweavers

258 search results - page 45 / 52
» Proof Styles in Operational Semantics
Sort
View
HASKELL
2009
ACM
14 years 2 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...
PODS
2010
ACM
173views Database» more  PODS 2010»
14 years 21 days ago
Foundations of schema mapping management
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
PPOPP
2012
ACM
12 years 3 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ANLP
1994
101views more  ANLP 1994»
13 years 9 months ago
Sublanguage Engineering In The Fog System
FoG currently produces bilingual marine and public weather forecasts at several Canadian weather offices. The system is engineered to reflect "good professional style" a...
Richard I. Kittredge, Eli Goldberg, Myunghee Kim, ...