2236 search results - page 226 / 448 » Language Independence and Language Tolerance in Logic Progra... |
305
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
175
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
161
click to vote
IJIT
2004
15 years 8 months ago
2004
In this paper, we describe a rule-based message passing method to support developing collaborative applications, in which multiple users share resources in distributed environments...
228
click to vote
ALP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
175
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...