A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Regular expression types for XML
2005
ACM Transactions on Programming Languages and Systems
We propose regular expression types as a foundation for statically typed XML processing languages. ...
We propose regular expression types as a foundation for statically typed XML processing languages. ...
This work was supported by the Japan Society for the Promotion of Science (Hosoya), the University of Pennsylvania's Institute for Research in Cognitive Science (Vouillon), and the National Science Foundation ...
doi:10.1145/1053468.1053470
fatcat:2bysls2kpnewhgubqwceks73fa
Regular expression types for XML
2000
Proceedings of the fifth ACM SIGPLAN international conference on Functional programming - ICFP '00
We propose regular expression types as a foundation for statically typed XML processing languages. ...
We propose regular expression types as a foundation for statically typed XML processing languages. ...
This work was supported by the Japan Society for the Promotion of Science (Hosoya), the University of Pennsylvania's Institute for Research in Cognitive Science (Vouillon), and the National Science Foundation ...
doi:10.1145/351240.351242
dblp:conf/icfp/HosoyaVP00
fatcat:4l5f3fnsmfayteeq44na6faqiu
Regular expression types for XML
2000
SIGPLAN notices
We propose regular expression types as a foundation for statically typed XML processing languages. ...
We propose regular expression types as a foundation for statically typed XML processing languages. ...
This work was supported by the Japan Society for the Promotion of Science (Hosoya), the University of Pennsylvania's Institute for Research in Cognitive Science (Vouillon), and the National Science Foundation ...
doi:10.1145/357766.351242
fatcat:hrbwqxwo6nfitl2nwvkk6nujoe
A Rewrite System with Incomplete Regular Expression Type for Transformation of XML Documents
2005
IPSJ Digital Courier
In this paper we propose a new framework for transformations of XML documents based on an extension of regular expression type, called incomplete regular expression type. ...
Incomplete regular expression type is a restricted second-order extension of regular expression (RE) type: An incomplete RE type can be applied to arbitrary RE types as its arguments. ...
This work is supported by Japan Society for the Promotion of Science, basic research (C) No.15500014 (Suzuki), basic research (C) No.16500014 (Okui). ...
doi:10.2197/ipsjdc.1.496
fatcat:5jdpjhhwn5eatkmnrapddagw5a
Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
2013
Theoretical Computer Science
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. ...
This happens in the following cases (in each case we use U for the human-defined expected type, and E for the expression whose type is computed by the compiler): (i) when a function, expecting a type U ...
Introduction Different extensions of Regular Expressions (REs) with interleaving operators and counting are used to describe the content models of XML in the major XML type languages, such as XML Schema ...
doi:10.1016/j.tcs.2013.04.023
fatcat:y56ykzwv2ja33edqpfvivmkkk4
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
2009
SIAM journal on computing (Print)
Is exponentially succinct with regard to standard regular expressions because integers are encoded in binary. Example a [0..2 n ] = a? · · · a? ...
Example: a [3..5] b + (cd) [0,10] Additional operator in XML Schema (minoccurs and maxoccurs). Properties Defines only regular languages. Every numerical occurrence predicate can be unfolded. ...
EDTD A single-type EDTD is an EDTD for which in no regular expression two types b i and b j with i = j occur. ...
doi:10.1137/070697367
fatcat:ciqgixqeebfw7kpwuatltsc3oi
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
[chapter]
2006
Lecture Notes in Computer Science
Is exponentially succinct with regard to standard regular expressions because integers are encoded in binary. Example a [0..2 n ] = a? · · · a? ...
Example: a [3..5] b + (cd) [0,10] Additional operator in XML Schema (minoccurs and maxoccurs). Properties Defines only regular languages. Every numerical occurrence predicate can be unfolded. ...
EDTD A single-type EDTD is an EDTD for which in no regular expression two types b i and b j with i = j occur. ...
doi:10.1007/11965893_19
fatcat:gynnid2z4nhxbo33wv23ojsp7e
V-DOM and P-XML—towards a valid programming of XML-based applications
2002
Information and Software Technology
XML object constructors are expressed in XML syntax. Previously generated XML objects can be inserted according to the declared XML schema. The main focus of the paper is the type system of XOBE. ...
Among others, this type system provides the basis for checking the validity of assignments of XML objects to variables. ...
Type Inference The type corresponding to an XML object constructor is given by a regular hedge expression. ...
doi:10.1016/s0950-5849(02)00012-5
fatcat:57cwma3mtjcoxndyin53jl5xsa
Type-Based XML Processing in Logic Programming
[chapter]
2002
Lecture Notes in Computer Science
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. ...
We implemented a standard type inference algorithm for logic programs and use the types corresponding to the DTDs as additional type declarations for logic programs for XML processing. ...
Expressiveness: More expressive languages for the validation of XML are now proposed (for instance [15] ). ...
doi:10.1007/3-540-36388-2_19
fatcat:25cniultfzb37cgy5iejx3iagq
Expressiveness of XSDs
2005
Proceedings of the 14th international conference on World Wide Web - WWW '05
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. ...
An equivalent formalism based on contextual patterns rather than on recursive types is proposed which might serve as a light-weight front end for XML Schema. ...
We thank Dan Suciu for stimulating discussions and Jan Van den Bussche for comments on a previous draft of this paper. ...
doi:10.1145/1060745.1060848
dblp:conf/www/BexMNS05
fatcat:rf2rk4mauzdujiaxg4wtpovaje
DTDs versus XML schema
2004
Proceedings of the 7th International Workshop on the Web and Databases colocated with ACM SIGMOD/PODS 2004 - WebDB '04
Among the various proposals answering the shortcomings of Document Type Definitions (DTDs), XML Schema is the most widely used. ...
Further, we introduce a class of simple regular expressions and obtain that a surprisingly high fraction of the content models belong to this class. ...
The star height of a regular expression is the maximum nesting depth of Kleene stars occurring in the expression, e.g. 2 for the last example given below, 1 for all others. ...
doi:10.1145/1017074.1017095
dblp:conf/webdb/BexNB04
fatcat:5ceckj5e2fet3dhe2s4flyucty
XML: Model, Schemas, Types, Logics, and Queries
[chapter]
2004
Logics for Emerging Applications of Databases
Regular Expression Types Extending recursive data types of functional programming languages, regular expression types allow us to enlarge the class of types of XML documents. ...
Regular Tree Languages and XML types A regular tree language L ⊆ T Σ can be thought of as an XML type. ...
doi:10.1007/978-3-642-18690-5_1
fatcat:f5mtevnovffhnpfgdpb7rqlmji
XML graphs in program analysis
2007
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '07
data), and XSLT (stylesheets for transforming XML documents). .dk (A. ...
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. ...
Regular expression types XML graphs turn out to be closely connected to the regular expression types of XDuce [19, 20] : A generalized version of regular expression types has the same expressive power ...
doi:10.1145/1244381.1244383
dblp:conf/pepm/MollerS07
fatcat:a6c3ooa6wng77cqrb5qzifzdzi
XML graphs in program analysis
2011
Science of Computer Programming
data), and XSLT (stylesheets for transforming XML documents). .dk (A. ...
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. ...
Regular expression types XML graphs turn out to be closely connected to the regular expression types of XDuce [19, 20] : A generalized version of regular expression types has the same expressive power ...
doi:10.1016/j.scico.2009.11.007
fatcat:3ojdtal5j5ajtmfoofqlzs64zu
A Typed Calculus for Querying Distributed XML Documents
[chapter]
2007
Lecture Notes in Computer Science
of the two; a type system based on regular type expressions. ...
Likewise we can type locations, expressions and processes using a combination of regular type expressions with functional and ref types. ...
doi:10.1007/978-3-540-75336-0_11
fatcat:o2mcu5pwxncxfbkwrg5vfqmhqu
« Previous
Showing results 1 — 15 out of 26,618 results