383 search results - page 29 / 77 » Abstracting Complex Languages through Transformation and Com... |
117
click to vote
STOC
1993
ACM
15 years 5 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
110
click to vote
GPCE
2003
Springer
15 years 6 months ago
2003
Springer
A domain-specific language provides domain experts with a abstraction for creating computer programs. As more and more domains embrace computers, programmers are tapping into this...
115
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 ...
136
click to vote
CC
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
132
click to vote
RULEML
2009
Springer
15 years 8 months ago
2009
Springer
Rule bases are increasingly being used as repositories of knowledge content on the Semantic Web. As the size and complexity of these rule bases s, developers and end users need met...