Sciweavers

3311 search results - page 118 / 663
» Deductive Object Programming
Sort
View
FOCS
1998
IEEE
15 years 6 months ago
The Complexity of Acyclic Conjunctive Queries
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...
Georg Gottlob, Nicola Leone, Francesco Scarcello
118
Voted
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 5 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
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...
Carlos Gómez-Rodríguez, Miguel A. Al...
95
Voted
JAR
2006
71views more  JAR 2006»
15 years 1 months ago
Mathematical Induction in Otter-Lambda
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...
Michael Beeson
ICDCS
1993
IEEE
15 years 5 months ago
Maintaining Information about Persistent Replicated Objects in a Distributed System
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...
JOT
2007
81views more  JOT 2007»
15 years 1 months ago
Persistent Objects and Capabilities in Timor
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...