939 search results - page 120 / 188 » Semantic Abstraction and Quantum Computation |
POPL
1998
ACM
15 years 2 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
110
click to vote
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
ICFP
2002
ACM
15 years 9 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 ...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
114
click to vote
MOBISYS
2003
ACM
15 years 9 months ago
2003
ACM
3], in that it integrates a service-oriented abstraction with the operating system socket interface and provides adaptive service access at the end-host session layer. However, our...