2678 search results - page 453 / 536 » Operational Semantics of Transactions |
112
click to vote
ICFP
2002
ACM
16 years 1 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
118
click to vote
ICFP
2002
ACM
16 years 1 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
115
click to vote
PERCOM
2007
ACM
16 years 1 months ago
2007
ACM
We envisage pervasive computing applications to be predominantly engaged in knowledge-based interactions, where services and information will be found and exchanged based on some ...
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
102
Voted
ICCD
2001
IEEE
15 years 10 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...