CL
2000
Springer
13 years 7 months ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
CL
2000
Springer
13 years 7 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
CL
2000
Springer
13 years 7 months ago
2000
Springer
CL
2000
Springer
13 years 7 months ago
2000
Springer
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
CL
2000
Springer
13 years 7 months ago
2000
Springer
The extension of the XSL (eXtensible Style sheet Language) by variables and passing of data values between template rules has generated a powerful XML query language: XSLT (eXtens...
CL
2000
Springer
13 years 11 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
CL
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purp...
CL
2000
Springer
13 years 11 months ago
2000
Springer
This paper reports on the design and implementation of FLORA -- a powerful DOOD system that incorporates the features of F-logic, HiLog, and Transaction Logic. FLORA is implemented...
CL
2000
Springer
13 years 11 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
CL
2000
Springer
13 years 11 months ago
2000
Springer