Sciweavers

39 search results - page 7 / 8
» Semantics of Higher-Order Recursion Schemes
Sort
View
JCDL
2003
ACM
94views Education» more  JCDL 2003»
13 years 11 months ago
Content Access Characterization in Digital Libraries
To support non-trivial clients, such as data exploration and analysis environments, digital libraries must be able to describe the access modes that their contents support. We pre...
Greg Janee, James Frew, David Valentine
FLOPS
2008
Springer
13 years 7 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
COLING
2010
13 years 23 days ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
PPDP
2009
Springer
14 years 9 days ago
An Isabelle/HOL-based model of stratego-like traversal strategies
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
Markus Kaiser, Ralf Lämmel
ICFP
2010
ACM
13 years 6 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat