237 search results - page 32 / 48 » Modular Monad Transformers |
130
click to vote
ICLP
1999
Springer
15 years 6 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
130
click to vote
EUROCRYPT
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...
132
Voted
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
105
click to vote
ICFP
2006
ACM
16 years 2 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
141
Voted
EACL
2006
ACL Anthology
15 years 3 months ago
2006
ACL Anthology
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...