Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. J. Funct. Program., 13(6):961--1004, 2003.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....all the semantic approaches to subtyping previous to our work presented some limitation: no higher order functions, no complement types, and so on. The main contribution of our work is the development of a formal framework that overtakes these limitations. The starting point of this work is XDuce [7, 5, 6] a language for defining transformations of XML documents. XDuce is a functional language with an elegant definition and it provides many features and solutions that are interesting both from theoretical and practical viewpoints. Its type system relies on the observation that the types of XML ....

....to each variable x of p the exact type of its values, when the pattern is matched to an element of type t. As the previous section demonstrates, our pattern algebra allows to express complex extractions, and we get exact typing even for them, as opposed to XDuce pattern matching algorithm [6] where variables capturing subsequences that are not in tail position do not get exact typing (the idea underlying the algorithm of each theorem is to derive a system of equations on types from the semantic condition, and use a general algorithm to solve it, as described in Appendix A) For ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2001.

....analyze realistic Web services with great accuracy. The contribution described in this paper is an extension of the technique to also cover deconstruction of XML values. Furthermore, we show that summary graphs have practically the same expressive power as the regular expression types of XDuce [5, 7, 6]. 2 XML Templates We have concretely analyzed programs in the JWIG language, which is an extension of Java designed for programming interactive Web services. JWIG is a descendant of the bigwig language [2] For the current discussions, we only need to consider how XML documents are built. JWIG ....

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In Proc. 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '01, January 2001.

.... exchange on the world wide web [37] and XML data is naturally modeled as unranked trees [25, 37] This connection made recent advances in unranked tree language theory foundational for XML related research in areas such as XML pattern languages [9, 24, 26, 27, 31] and XML schema languages [18, 29]. Most crucial XML concepts are closely related to unranked tree automata. For example, DTDs (Document Type Definitions, the most common form of typing XML) correspond to a subset of tree automata, and a proposed extension, called DTDs with specialization [29] has precisely the power of tree ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In POPL'01, pages 67--80.

....a decidable emptiness test. We obtain a new flavor of rows, which allows encoding certain functions from trees into types. This may open an avenue towards full type inference for programming languages dedicated to manipulating XML structures, such as XDuce, that have regular expression types [2]. Currently, XDuce only has some (local) type inference. Again, an in depth exploration of these extensions must be left for future research. Still, we believe it is pleasing and interesting that the algorithm should exhibit such generality. 5.3 More Row Terms Figure 1 requires types of the form ....

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 2002. To appear. URL: http://www.kurims.kyoto-u.ac.jp/~hahosoya/papers/ tapat-full.ps.

....routine to build a type system around the description language, along with an operational semantics obeying standard typing soundness properties. The key problem, though, is to find rich description languages that admit satisfaction and (more crucially) validity algorithms. In the case of XDuce [HP01] for example, these algorithms are found in tree automata theory. We propose here a logic that can be used as a rich description language for tree like data. It emerges as an application of the novel area of spatial logics used for describing data and network structures. The logic of this ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 67--80, 2001.

....routine to build a type system around the description language, along with an operational semantics obeying standard typing soundness properties. The key problem, though, is to find rich description languages that admit satisfaction and (more crucially) validity algorithms. In the case of XDuce [17], for example, these algorithms are found in tree automata theory. We propose here a logic that can be used as a rich description language for tree like data. It emerges as an application of the novel area of spatial logics used for describing data and network structures. The logic of this ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 67--80, 2001.

....where nodes can have an arbitrary number of children. So, there is no fixed rank associated to each label. As the structure of XML documents can be adequately represented by unranked trees, unranked tree automata can serve XML research in four di#erent ways: i) as a basis of schema languages [10, 12, 13, 18, 19] and validating of schemas; ii) as an evaluation mechanism for pattern languages [4, 32, 24] iii ) as an algorithmic toolbox (e.g. XPath containment [16] and typechecking [15] and (iv) as a new paradigm: unranked tree automata use regular string languages to deal with unrankedness. The ....

....The #(q, a) that are not mentioned are empty. # It is not so hard to see that for every DTD there is an equivalent unranked tree automaton. Moreover, the unranked tree automata are equivalent to the specialized DTDs of Papakonstantinou and Vianu[31] and the XDuce types of Hosoya and Pierce [10]. Lee, Mani, and Murata provide provide a comparison of XML schema languages based on formal language theory [13] 4 Related work We briefly discuss a number of applications of unranked tree automata or related formalisms. We refer the interested reader to [26] for a more detailed overview of ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Proceedings of 28th Symposium on Principles of Programming Languages (POPL 2001.

....succeeds, the job will be dispatched in the environment chosen for execution. If not, a new environment that meets the specifications of the job has to be initialized. This process of matching requirements with environmental specifications can be done using XML pattern matching techniques [18]. 4.2.2 Resource management XenoServers will be able to accommodate a large number of jobs and execution environments, running at the same time. It is very important that clients get the amount of resources they pay for, and that jobs are not allowed to get any arbitrary amount of resources they ....

Haruo Hosoya and Benjamin Pierce. Regular expression pattern matching for XML. In Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 67--80. ACM Press, 2001.

....of schema languages and validating of schema s. Murata was the first to consider tree automata as a schema definition language [35] In fact, the schema language Relax, a competitor of XML schema [15] is directly inspired upon unranked tree automata. The XDuce type system of Pierce and Hosoya [27] as well as the specialized DTDs of Papakonstantinou and Vianu [47] correspond precisely to the unranked tree languages [54] Lee, Mani, and Murata provide a comparison of XML schema languages based on formal language theory [31] 2. as an evaluation mechanism for pattern languages. Several ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Proceedings of 28th Symposium on Principles of Programming Languages (POPL 2001), pages 67--80. ACM Press, 2001.

....all the semantic approaches to subtyping previous to our work presented some limitation: no higher order functions, no complement types, and so on. The main contribution of our work is the development of a formal framework that overtakes these limitations. The starting point of this work is XDuce [7, 5, 6] a language for defining transformations of XML documents. XDuce is a functional language with an elegant definition and it provides many features and solutions that are interesting both from theoretical and practical viewpoints. Its type system relies on the observation that the types of XML ....

....to each variable x of p the exact type of its values, when the pattern is matched to an element of type t. As the previous section demonstrates, our pattern algebra allows to express complex extractions, and we get exact typing even for them, as opposed to XDuce pattern matching algorithm [6] where variables capturing subsequences that are not in tail position do not get exact typing (the idea underlying the algorithm of each theorem is to derive a system of equations on types from the semantic condition, and use a general algorithm to solve it, as described in Appendix A) For ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2001.

....paper, other references, and an online interactive prototype, is http: www.cduce.org. C Duce is a general purpose typed functional programming language, whose design is guided by keeping XML applications in mind. The work on C Duce started from an attempt to overtake some limitations of XDuce [11, 9, 10]: General purpose types. XDuce is XML specific: the only datatype it can manipulate is (sequences of) XML documents; this makes it difficult to write complex applications, which are not just simple transformations (filtering, reordering, renaming) XDuce demonstrates how specific features ....

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2001.

....job will be dispatched in the environment chosen for execution. If not, a new environment that meets the specifications of the job has to be initialized. This process of matching requirements with environ mental specifications can be carried out efficiently using XML pattern matching techniques [6]. This constitutes the resource discovery process inside a XenoServer. XenoServers are able to accommodate large numbers of jobs and execution environments, running at the same time. It is very important that clients get the amount of resources they pay for, and that jobs are not allowed to get ....

Haruo Hosoya and Benjamin Pierce. Regular expression pattern matching for XML. In Proceedings of the 28th ACM SIGPLANSIGACT symposium on Principles of programming languages, pages 67--80. ACM Press, 2001.

....a more restricted class of XML transforma tions is considered in [22] The approach taken there is to extend the types from regular path expressions to context free grammars to be able to express certain inferred types. A different approach to type checking XML transformations is taken by XDuce [15, 16]. XDuce is a general purpose functional language in the style of ML [17] whose types are essentially DTDs vith types decoupled from tags. Recursive functions can be defined over XML data by pattern matching against regular expressions. XDuce performs static typechecking for these functions, ....

H. Hosoya and B.C. Pierce. Regular Expression Pattern Matching for XML. In Proc. AUM POPL, 2001.

....from select expressions. These expressions are embeddable in our general language using this nite lub construction [CGG01] We must give an in depth comparison between our query language and other query languages based on graphs [FFK 97,CM90,BDHS96] Our language is closely related to XDuce [HP01] a processing language for XML documents based on pattern matching and a simple typing scheme analogous to the structural component of our spatial logic. Our ambitious aim is to achieve a level of understanding of query languages for semi structured data which rivals that of languages associated ....

H. Hosoya and B. Pierce. Regular expression pattern matching for xml. In POPL. ACM, 2001.

....that evaluates to a string can at worst be typed : meaning any string ) and in many cases one can do better. It is not at all a new idea to use regular expressions or other formal languages to describe shapes of data or behavior of programs. The most relevant work that we know of is XDuce [5, 6], a programming language for processing XML documents, which gives regular expression types to XML documents as (labeled) trees. Theoretically, since strings are just a special case of trees (consider the encoding of lists by cons cells in Scheme) their work may seem to subsume ours. ....

....this inclusion is decidable (although its efficient implementation is beyond the scope of the present paper) This subtyping relation between string types is extended to 1 2 for types in general by a standard subtyping rule (S Fun) for functions. In fact, the definition of pattern matching in [5] has this problem. 6 [ T 1 ] T 2 ] T 1 T 2 (S Str) 1 1 2 2 T 1 T 2 1 2 (S Fun) 0(x) 0 x : T Var) 0; f : 1 2 ; x : 1 M : 2 ; T T 0 fix(f; x; M) 1 2 ; T Fix) 0 M 1 : 2 1 ; T 1 0 M 2 : 2 ; T 2 ....

[Article contains additional citation context not shown here]

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 2002.

....into the gaps, the constraint being violated, and the line numbers of the involved plug operations. Such reasonably precise error diagnostics is clearly useful for debugging. 9. RELATED WORK There are other languages for constructing XML documents that also consider validity. The XDuce language [3, 4] is a functional language in which XML templates are data types, with a constructor for each element name and pattern matching for deconstruction. A type is a regular expression over E . Type inference for pattern variables is supported. In comparison, we have a richer language and consequently ....

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In Symposium on Principles of Programming Languages (POPL'01). ACM, 2001.

....expression pattern matching, like lex [32] and ex [47] Most programming languages, such as Perl [54] provide some form of regular expression pattern matching. Regular expressions and regular expression matching have recently been used even for implementing type systems for programming languages [20, 21]. It is not always enough just to perform language recognition, that is, to nd out whether patterns of interest occur in the text. Frequently we need to know exactly where a substring matching the pattern was found and extract parts of a successful match. For example, if a pattern matches an ....

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Proceedings of the symposium on Principles of programming languages, pages 6780, London, United Kingdom, 1719 Jan. 2001.

....surprisingly, specially if we look at the evolution of programming languages, the use of a type system in XML (as well as in languages for manipulating XML documents) is not mandatory. Domain specific languages for XML proposed in the last few years are all, with the exception of XDuce [HP00, HP01] dynamically typed. Experience has showed us that statically typed languages are better suited for real world applications than dynamically typed ones. Despite requiring more from the programmer s perspective (at least in the absence of a type inference engine) the benefits greatly outcast the ....

....between markup nodes are ignored. As a result, the same tree is denoted by many (in fact, infinitely many ) XML documents. Notice, on the other hand, that whitespace inside content nodes is very important as it may change the intended meaning of the data stored in that node. 51 sion Types [HP00, HP01] At the time of writing the most widely used type system is DTDs, mainly because it was the first type system proposed and because it is simple to write tools that support it. Despite the variety of type systems, their use with the exception of Regular Expression Types in XDuce is still ....

[Article contains additional citation context not shown here]

H. Hosoya and B. Pierce. Regular expression pattern matching for xml. In Conf. Rec. POPL '01: 28th ACM Symp. Princ. of Prog. Langs., 2001. 147

No context found.

Hosoya, H. and Pierce, B. C. 2001. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 67-80.

No context found.

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 2002. To appear. Short version appeared in Proceedings of The 25th Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pp. 67-80, 2001.

No context found.

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. J. Funct. Program., 13(6):961--1004, 2003.

No context found.

H. Hosoya, B. Pierce, "Regular Expression Pattern Matching for XML" In Proc. of ACM Symposium on Principles of Programming Languages, pp. 67-80, London, 2001.

No context found.

Hosoya, H. and B. Pierce (2001). Regular expression pattern matching for XML. ACM SIGPLAN Notices 36(3), 67-80.

No context found.

H. Hosoya and B. Pierce. Regular expression pattern matching for XML. J. Functional Programming, 13(6):961--1004, 2003.

No context found.

H. Hosoya and B. Pierce. Regular expression pattern matching for XML. J. Functional Programming, 13(6):961--1004, 2003.

No context found.

H. Hosoya and B. Pierce. Regular expression pattern matching for Xml. J. Functional Programming, 13(6):961--1004, 2003.

No context found.

H. Hosoya and B. Pierce. Regular expression pattern matching for XML. J. Functional Programming, 13(6):961--1004, 2003.

No context found.

H. Hosoya and B. Pierce. Regular expression pattern matching for XML. J. Functional Programming, 13(6):961--1004, 2003.

No context found.

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 13(4), 2002.

No context found.

H. Hosoya and B. Pierce. Regular Expression Pattern Matching for XML. Journal of Functional Programming, 2002.

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 13(4), 2002. 18

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Principles of Programming Languages (POPL), pages 6780. ACM Press, 2001.

No context found.

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In Proc. 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '01, January 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Principles of Programming Languages (POPL), pp. 67--80. ACM Press, 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Principles of Programming Languages (POPL), pages 67--80. ACM Press, 2001.

No context found.

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001.

No context found.

H. Hosoya and B. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 67--80, January 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Proc. 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '01, January 2001.

No context found.

H. Hosoya, B. Pierce, "Regular Expression Pattern Matching for XML" In Proc. of ACM Symposium on Principles of Programming Languages, pp. 67-80, London, 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 67--80, 2001.

No context found.

Haruo Hosoya and Benjamin Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 2002.

No context found.

Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 67--80, January 2001.

No context found.

H. Hosoya and B. C. Pierce. "Regular Expression Pattern Matching for XML". In Proceedings of 28th Symposium on Principles of Programming Languages (POPL'01), pages 67--80. ACM Press, 2001.

No context found.

Haruo Hosoya and Benjamin Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 2002.

No context found.

H. HOSOYA AND B. C. PIERCE, Regular expression pattern matching for XML, in Proc. 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '01, January 2001.

No context found.

H. Hosoya and B. C. Pierce. "Regular Expression Pattern Matching for XML". In Proceedings of 28th Symposium on Principles of Programming Languages (POPL'01), pages 67--80. ACM Press, 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 13(4), 2002.

No context found.

H. Hosoya and B. C. Pierce. Regular Expression Pattern Matching for XML. In Proc. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL),67- 80, 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular Expression Pattern Matching for XML. In Proc. ACM POPL, 2001.

No context found.

H. Hosoya and B. C. Pierce. Regular Expression Pattern Matching for XML. In 28th ACM Symp. on Principles of Programming Languages, 2001.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC