211 search results - page 12 / 43 » Reflective Programming in the Relational Algebra |
163
Voted
PEPM
2011
ACM
14 years 6 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
133
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
140
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
114
Voted
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
129
Voted
PASTE
1998
ACM
15 years 7 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...