Sciweavers

1392 search results - page 63 / 279
» Staging generic programming
Sort
View
DEXA
1999
Springer
87views Database» more  DEXA 1999»
14 years 1 months ago
SECONDO/QP: Implementation of a Generic Query Processor
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...
Ralf Hartmut Güting, Stefan Dieker, Claudia F...
OOPSLA
2010
Springer
13 years 7 months ago
Type classes as objects and implicits
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
Bruno C. d. S. Oliveira, Adriaan Moors, Martin Ode...
IJCAI
2001
13 years 10 months ago
A Framework for Declarative Update Specifications in Logic Programs
Recently, several approaches for updating knowledge bases represented as logic programs have been proposed. In this paper, we present a generic framework for declarative specifica...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
IROS
2008
IEEE
122views Robotics» more  IROS 2008»
14 years 3 months ago
A probabilistic Programming by Demonstration framework handling constraints in joint space and task space
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
Sylvain Calinon, Aude Billard
TLCA
2007
Springer
14 years 3 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva