Sciweavers

805 search results - page 96 / 161
» On the Semantics of Conditional Commitment
Sort
View
FPCA
1995
15 years 8 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
SLP
1997
102views more  SLP 1997»
15 years 5 months ago
Compositionality of Normal Open Logic Programs
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
Sofie Verbaeten, Marc Denecker, Danny De Schreye
POPL
2011
ACM
14 years 7 months ago
Mathematizing C++ concurrency
Shared-memory concurrency in C and C++ is pervasive in systems programming, but has long been poorly defined. This motivated an ongoing shared effort by the standards committees ...
Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewe...
WWW
2006
ACM
16 years 5 months ago
Automatic matchmaking of web services
Web services help in achieving increased automation across organizational boundaries. In this paper, we present an approach for annotating WSDL documents with semantically rich de...
Rudi Studer, Sudhir Agarwal
CSR
2009
Springer
15 years 11 months ago
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
Arnon Avron, Agata Ciabattoni, Anna Zamansky