Sciweavers

46 search results - page 4 / 10
» Exact XML Type Checking in Polynomial Time
Sort
View
DBPL
2007
Springer
98views Database» more  DBPL 2007»
14 years 12 days ago
Towards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
Alain Frisch, Haruo Hosoya
JAT
2002
62views more  JAT 2002»
13 years 5 months ago
Coconvex Approximation
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
Dany Leviatan, Igor A. Shevchuk
POPL
1990
ACM
13 years 10 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
ICDE
2006
IEEE
131views Database» more  ICDE 2006»
14 years 8 days ago
On Potential Validity of Document-Centric XML Documents
Document-centric XML document creation is a process of marking up textual content rather than typing text in a predefined structure. It turns out that, although the final docume...
Ionut Emil Iacob, Alex Dekhtyar, Michael I. Dekhty...
PODS
2004
ACM
86views Database» more  PODS 2004»
14 years 6 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven