Sciweavers

850 search results - page 31 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
POPL
2003
ACM
14 years 11 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
14 years 11 months ago
XML query optimization in the presence of side effects
The emergence of database languages with side effects, notably for XML, raises significant challenges for database compilers and optimizers. In this paper, we extend an algebra fo...
Giorgio Ghelli, Nicola Onose, Kristoffer Hø...
CAISE
2008
Springer
14 years 25 days ago
Model Transformations powered by Rewriting Logic
This paper shows a rigorous approach based on algebraic specications and rewriting logic which makes up for the lack of current transformation languages and oers a balanced rigour-...
Francisco J. Lucas, José Ambrosio Toval &Aa...
ICFP
2003
ACM
14 years 10 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
ICML
1989
IEEE
14 years 2 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning