Haruo Hosoya, J er ome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11--22, Sep., 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... by a notion of coinductive simulation that characterizes empty types (t is a subtype of s if the difference type t s is empty) Many optimizations and subtle implementation techniques can be applied in order to move from this specification to a practical algorithm, including those mentioned in [14] (for the informed reader, note that their algorithm can be easily improved by caching negative results in a destructive structure, since they cannot be invalidated even under different assumptions) The algorithm in [14] uses a top down approach to avoid exponential explosion (due to the presence ....

.... this specification to a practical algorithm, including those mentioned in [14] for the informed reader, note that their algorithm can be easily improved by caching negative results in a destructive structure, since they cannot be invalidated even under different assumptions) The algorithm in [14] uses a top down approach to avoid exponential explosion (due to the presence of union types) however, it requires backtracking and is thus suboptimal with respect to its theoretical complexity (and backtracking prevents the use a persistent data structure) Our implementation uses instead an ....

H. Hosoya, J. Vouillon, and B. Pierce. Regular expression types for XML. In Proc. of ICFP '00, SIGPLAN Notices 35(9), 2000.

....C Duce s type system to check it) Since the advantages of higher order programming are well known to the functional programming language community (and space is limited) we will not elaborate further. The lack of first class functions in XML languages has been identified in several papers [12, 7] and our semantic approach to subtyping [8] has succeeded in mixing classical arrow types and XML types. 3.6 Pattern matching Pattern matching is one of C Duce s key features. Although it resembles ML s, it is much more powerful, as it allows one to express in a single pattern a complex ....

Haruo Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, 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, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '00, September 2000.

....such a generic operation. Native language support of DTD. New languages are being designed with builtin XML support to help build XML related applications. XDuce is a functional language with regular expression types, so as to allow direct representations of DTDs and processing of valid elements [10, 11]. Expressions in the language are evaluated to valid XML elements, but variables must be annotated with their element types. The concept of validation is built into the language as type correctness, and programs are type checked at compile time. XDuce also provides regular expression patterns ....

Haruo Hosoya, J'erome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming, September 2000. !http://www.cis.upenn.edu/ ~ hahosoya/papers/regsub.ps?.

....one may want to know whether two succeeding XML document transformations can be fused into one so that it su#ces to traverse the input document only once. The work reported in this paper is related to the following work. XDuce is an typed XML processing language that produces valid XML documents [12, 13]. Milo, Suciu, and Vianu treated an XML transformer as a k pebble transducer whose type correctness can be checked against an output DTD [19] Both of the above two languages are first order hence cannot express composition of XML transformations in the languages themselves. Kuikka and Penttonen ....

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming, September 2000.

....: body#(H1 H2 . # . The grammar means that we at top have an html node, in which, i.e. between html and html tags, we have head and body nodes, and so on. The class of languages that grammars as above define is identical to the class of regular tree languages [HM02,HVP00,MLM01] The software that checks if XML documents comply with a schema is called a validator. A validation corresponds to the execution of a tree automata in correspondence. The ultimate goal of our study is to develop efficient and innovative tools and softwares for XML and its schemas. ....

....and softwares for XML and its schemas. Currently only established technologies for XML schemas are validators, but there are other applications. For some applications, it is important to investigate problems with higher complexity. For example, type checkers for XML processing languages [CMS02,HVP00] often use set operations on types which are essentially boolean operations on automata. In particular, they usually define subtyping relation between two types by means of the language containment testing for NTAs, which in the worst case requires EXPTIME to the size of states [Sei90] Outline ....

[Article contains additional citation context not shown here]

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11--22, Sep., 2000.

....to XML types of interest. Examples include JAXB [31] Relaxer [27] HaXML [34] and XM [23, 29] One disadvantage of these translations is that they tend to introduce spurious structure, destroying some useful exibility in the subtype relation. This point is discussed in detail in [17] and [13]. There can be varying degrees of integration of a foreign data model into the object oriented data model. One is creating a combined data model that incorporates the features of both on the equal level. A successful example is the ODMG data model [6] an accepted standard for object oriented ....

H. Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, Japan, 2000.

....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 ....

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), 2000. A. Pattern algorithms Definition A.1 Let V be a finite set of variables, written #, # 1 , # 2 , #, . . . . A right-hand side is either a type t

....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 ....

.... by a notion of coinductive simulation that characterizes empty types (t is a subtype of s if the difference type t s is empty) Many optimizations and non trivial implementation techniques can be applied to pass from this specification to a practical algorithm: among these are those mentioned in [11] (for the knowledgeable reader, note that it is also possible to cache negative results of the subtyping algorithm in a destructive structure, as they cannot be invalidated even under different assumptions) and the definition of maximal sharing and unique representation for recursive types which ....

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), volume 35(9) of SIGPLAN Notices, 2000.

....extend MSL to include most or all of XML Schema. MSL (like XML Schema) draws on standard ideas about type systems for semistructured data as described in the literature [1, 9] notably the use of regular expressions and tree grammars. In particular, MSL closely resembles the type system in Xduce [8]. Another example of formalizing part of an XML specification can be found in [12] Many important aspects of XML Schema are not modeled by MSL. We have focussed on the core material in XML Schema Part I (Structures) as we believe this is the most complex. Many features of XML Schema are not ....

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for xml. In Proceedings of the International Conference on Functional Programming (ICFP), 2000.

....rather irregular type descriptions, comprising union types, recursive types, and wildcards; coherently, the corresponding languages include operators such as alternative paths, wildcard matching, collection of descendants. One possible notion of query correctness, adopted by the XDuce language [4], is the full correspondence between the alternative paths in a query and all the possible cases of the union type that describes the input. This approach seems, however, too restrictive for many SSD specific programming tasks. At the other extreme, one may flag as non correct only those queries ....

.... correctness according to which functions are correct if and only if they specify a matching pattern (a function case) for all possible patterns described by the input type: exhaustive patterns in function definitions are required to ensure the soundness of the type system of XDuce, as stated in [4]. Indeed, the function, persons[name[frsname[String] sndname[n:String] phone[p:String] rest:person sndname[n] phone[p] selNums(rest) persons[name[firstname[String] secondname[n:String] phone[p:String] rest:person sndname[n] phone[p] selNums(rest) is statically ....

[Article contains additional citation context not shown here]

H. Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, Japan, 2000.

....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. ....

Haruo Hosoya, J'erome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In International Conference on Functional Programming, pages 11--22, 2000.

....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 ....

B. C. P. Haruo Hosoya, Jrme Vouillon. Regular expression types for XML. In Proceedings of the fth ACM SIGPLAN international conference on Functional programming, pages 1122, Montreal, Canada, 1821 Sept. 2000.

....Perhaps 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 types for xml. In Proc.

....root: dealer dealer UsedCars NewCars UsedCars (ad used ) NewCars (ad new ) ad used model year ad new model A less powerful alternative to specialization is to make type specification dependent on a context specified by a path expression. This is done, for example, in XDuce [60, 61]. Such extensions alleviate some limitations of DTDs, but there are many others. Conspicuously missing is a subtyping mechanism, a drawback partially remedied in later proposals such as XML Schema (as well as XDuce) Another interesting aspect is the specification of ordering constrains among ....

.... data inputs [45] A query language for semistructured data based on the ambient calculus (a modal logic for mobile computation) has recently been proposed [32] There has been a flurry of proposals for XML query languages, including XML QL [40] XSLT (W3C Web site) XMAS [16] XQL [95] XDuce [60, 61], and Quilt [33] A survey of the query languages for semi structured data and XML is beyond the scope of this paper (see [1] for a survey on querying semi structured data) Query languages for XML are in a state of flux, and there is no definitive winner so far 3 . However, two fairly stable ....

[Article contains additional citation context not shown here]

H. Hosoya, J. Vouillon, and B. Pierce. Regular expression types for XML. In Int. Conf. on Functional Programming, pages 11--22, 2000.

....extend MSL to include most or all of XML Schema. MSL (like XML Schema) draws on standard ideas about type systems for semistructured data as described in the literature [1, 9] notably the use of regular expressions and tree grammars. In particular, MSL closely resembles the type system in Xduce [8]. Another example of formalizing part of an XML speci cation can be found in [12] Many important aspects of XML Schema are not modeled by MSL. We have focussed on the core material in XML Schema Part I (Structures) as we believe this is the most complex. Many features of XML Schema are not ....

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for xml. In Proceedings of the International Conferenceon Functional Programming (ICFP), 2000.

....Z Ipo:comment shipComment Y, Ipo:comment shipComment Z where Ipo:comment, ShipComment and CustomerComment are non terminals. Using such substitution groups require that there be a production rule of the form: Ipo:comment ipo:comment X, and that Y, Z be derived from X. 5. 4 XDuce XDuce [HVP00] provides type definitions equivalent to regular tree grammars. The key features of XDuce are their type constructors where we can define regular expression types as derived from other types, and subtyping using subtagging. A type definition in XDuce that produces a tree is converted in our ....

....features of XDuce are their type constructors where we can define regular expression types as derived from other types, and subtyping using subtagging. A type definition in XDuce that produces a tree is converted in our framework into a production rule with a terminal. Consider the example from [HVP00]: type Addrbook = addrbook [Person ] is written as Addrbook addrbook (Person ) Any type definition that does not produce a tree is written as a production rule without a terminal. For example, type X = T, X ( represents a production rule X (T, X ) Note that XDuce writes the above type rules ....

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular Expression Types for XML". In Int'l Conf. on Functional Programming (ICFP), Montreal, Canada, Sep. 2000.

....in the inner select statement of our example query, since variable r is an IDref that references a book element. A few words about the XML OQL typing system. Schema less XML data are of the ODL type, XML, while schema based data are of the ODL type, XML[t] where t is an XDuce style XML type [13]. Schemabased XML OQL path expressions can be easily and unambiguously typechecked and translated to OQL [9] Schema less XML OQL path expressions are translated to OQL expressions against a xed schema and have a high cost: A tag projection requires unnesting (i.e. scanning of the list of ....

.... an XML object is lifted to a singleton listh XML i value, and an XML[t] value is converted to an XML object (through a schema driven function) Handling XML constructions as schema based values is a better alternative that we have not investigated, but requires a complex, incomplete type inference [13]. 3 The Construction of the Search Query This section presents the main contribution of this paper, namely the generation of a web search query from a web accessing XML OQL query. We will rst concentrate on XML OQL queries that may contain multiple document( references, but will later ....

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular Expression Types for XML. In ACM SIGPLAN International Conference on Functional Programming (ICFP'00), Montreal, Canada. ACM Press, Sept. 2000.

....to the grammar is shown in Figure 1. The type theory community uses terms such as type definitions, variables, and values. A set of type definitions is equivalent to a schema or grammar. An XML document is said to be a set of values, where each value can be viewed as being assigned to a variable [HVP00]. Example is shown below: type definitions type Book = book [Author , Publisher] type Author = author [String] type Publisher = publisher [ variables and values Book b1 = book [a1, a2, p1] Author a1 = author [ J. E. Hopcroft ] Author a2 = author [ J. D. Ullman ] Publisher p1 = publisher [ ....

....17 Ipo:comment shipComment Y, Ipo:comment shipComment Z where Ipo:comment, ShipComment and CustomerComment are non terminals in N1. Using such substitution groups require that there be a rule in P1 of the form: Ipo:comment ipo:comment X, and that Y, Z be derived from X. 4. 4 XDuce XDuce [HVP00] provides type definitions equivalent to regular tree grammars. The key features of XDuce are their type constructors where we can define regular expression types as derived from other types, and subtyping using subtagging. A type definition in XDuce that produces a tree is converted in our ....

[Article contains additional citation context not shown here]

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular Expression Types for XML". In Int'l Conf. on Functional Programming (ICFP), Montreal, Canada, Sep. 2000. Makoto Murata, Dongwon Lee and Murali Mani . Taxonomy of XML Schema Languages using Formal Language Theory Extreme Markup Languages 2000 23

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. ACM Trans. Program. Lang. Syst., 27(1):46--90, 2005.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), 2000.

No context found.

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), 2000.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), 2000.

....the subtype relation. A linear time emptyness test now solves the subtyping problem. This fact, plus the quadratic complexity of product construction and linear time conversion from types to automata, gives an overall quadratic complexity for the subtyping algorithm. Hosoya, Vouillon, and Pierce [HVP00] use a related automata theoretic approach, associating recursive types (with unions) to tree automata in a subtyping algorithm tuned to XML processing applications. Jim and Palsberg [JP99] address type inference for languages with subtyping and recursive types. Like us, they adopt a coinductive ....

Haruo Hosoya, , J'erome Vouillon, and Benjamin C. Pierce. Regular expression types for xml. Submitted for publication, 2000.

No context found.

Haruo Hosoya, J er ome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11--22, Sep., 2000.

No context found.

Hosoya, H., Vouillon, J., and Pierce, B. C. 2005. Regular expression types for XML. ACM Transactions on Programming Languages and Systems 27, 1, 46--90.

No context found.

Haruo Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, December 2000.

No context found.

Hosoya, H., J. Vouillon, and B. C. Pierce (2000). Regular expression types for XML. ACM SIGPLAN Notices 35(9), 11-22.

No context found.

H. Hosoya, J. Vouillon, and B. Pierce. Regular expression types for XML. In Proc. of ICFP '00, SIGPLAN Notices 35(9), 2000.

No context found.

Haruo Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, 2001.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the Fifth International Conference on Functional Programming, pages 11--22, 2000.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the Fifth International Conference on Functional Programming, pages 11--22, 2000.

No context found.

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '00, September 2000.

No context found.

H. Hosoya. Regular Expression Types for XML. PhD thesis, Dec. 2000.

No context found.

Haruo Hosoya and Jerome Vouillon and Benjamin C. Pierce, "Regular Expression Types for XML", Proceedings of the International Conference on Functional Programming (ICFP), 2000.

No context found.

H. Hosoya, J. Vouillon, and B.C. Pierce. Regular expression types for XML. In Proceedings of ICFP, 2000.

No context found.

Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In ICFP '00, volume 35(9) of SIGPLAN Notices, 2000.

No context found.

Haruo Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, 2001.

No context found.

Haruo Hosoya, Jerome Vouilon, and Benjamin Pierce. Regular expression types for XML. In Proceedings of 2000.

No context found.

H. Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, Japan, 2000.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11--22, 2000.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proc. of the ACM ICFP-00, volume 35.9 of ACM Sigplan Notices, pages 11--22, N.Y., September 18--21 2000. ACM Press.

No context found.

Haruo Hosoya. Regular expression types for XML. Ph.D thesis. The University of Tokyo, 2000.

No context found.

Haruo Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, December 2000.

No context found.

H. Hosoya, J. Vouillon, and B.C.Pierce. Regular expression types for XML. In Proc. of the International Conference on Functional Programming, pages 11--22. ACM Press, 2000.

No context found.

Haruo Hosoya. Regular expression types for XML. Ph.D thesis. The University of Tokyo, 2000.

No context found.

H. HOSOYA, J. VOUILLON, AND B. C. PIERCE, Regular expression types for XML, in Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '00, September 2000.

No context found.

Haruo Hosoya, Jerome Vouilon, and Banjamin Pierce. Regular expression types for xml. In Proceedings of 2000 ACM SIGPLAN International Conference on Functional Programming, pages 11--22. ACM Press, 2000. 11

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of ICFP, pages 11-22, 2000.

No context found.

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular Expression Types for XML. In 5th ACM Int. Conf. on Functional Programming, pages 11--22, 2000.

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