This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
The paper presents a general model for persistent replicated object management and identifies what meta information about objects needs to be maintained by a naming and binding se...
Mark C. Little, Daniel L. McCue, Santosh K. Shriva...
The paper describes how the idea of persistent objects is integrated into the Timor programming language. The strategy adopted allows types to be instantiated at two levels: as &q...
James Leslie Keedy, Klaus Espenlaub, Christian Hei...