Haruo Hosoya, Benjamin C. Pierce
XDuce is a statically typed programming language for XML processing. Its basic data values are XML documents, and its types (so-called regular expression types) directly correspond to document...
Pergamon Press Ltd. ©1983 IUPAC REVISIT TO THE ELECTRON DENSITY, BOND ORDER, AND AROMATICITY (2008)
Haruo Hosoya, Maki Shobu, Keiko Takano, Yukari Fujii
Abstract—Spatial distribution of electrons in a molecule is analyzed by several different approaches, i.e., MO, VB, and graph—theoretical methods. Quantum chemical interpretation of the concept...
XML Transformation Language Based on Monadic Second-order Logic (2008)
Abstract. Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO can express...
Haruo Hosoya, Jérôme Vouillon, Benjamin C. Pierce
We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations...
Mariangiola Dezani, Alain Frisch, Haruo Hosoya, Daniele Varacca
Abstract. Semantic subtyping is a relatively new approach to define subtyping relations where types are interpreted as sets and union, intersection and negation types have the corresponding...
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have given an answer to this...
The Topological Index Z Before and After 1971 (2008)
Haruo Hosoya, Biochem Press, H. Hosoya, Haruo Hosoya
The author’s first paper on the topological index Z was published in Bull. Chem. Soc. Jpn. in 1971, where good correlation was found between the boiling points of alkane isomers and their Z values....
Multi-Return Macro Tree Transducers (2008)
Macro tree transducers are a simple yet expressive formal model for XML transformation languages. The power of this model comes from its accumulating parameters, which allow to carry around several...
Datatypes and Subtyping (2007)
Haruo Hosoya, Benjamin C. Pierce, David N. Turner, An Teallach Limited
We study a calculus with both subtyping and datatype definitions. Our primary goal is to understand the interaction of subtyping with mutually recursive types, which raises difficulties beyond those...
Haruo Hosoya, Benjamin C. Pierce
XDuce is a statically typed programming language for XML processing. Its basic data values are XML documents, and its types (so-called regular expression types) directly correspond to document...
Mathematical Meaning and Importance of the Topological Index Z (2007)
The role of the topological index, Z G, proposed by the present author in 1971, in various problems and topics in elementary mathematics is introduced, namely, (i) Pascal’s and asymmetrical...
A New View of Hybridized Atomic Orbitals from N-dimensional World (2007)
Haruo Hosoya, Fuyuko Kido, Sumio Tokita
By taking a birds-eye view from the n-dimensional world (or n-space), it was found that thež conventionally used sp, sp2, and sp3 hybridized atomic orbitals belong to the spn hybridization and their...
Towards Practical Typechecking for Macro Tree Transducers (2007)
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 toward an...
Towards Practical Typechecking for Macro Tree Transducers (2007)
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 toward an...
Towards Practical Typechecking for Macro Tree Transducers (2007)
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 toward an...
Towards Practical Typechecking for Macro Tree Transducers (2007)
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 toward an...
Towards Practical Typechecking for Macro Tree Transducers (2007)
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 toward an...
XML Transformation Language Based on Monadic Second Order Logic (2007)
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO formulae are capable...
Foundations of XML Processing (2007)
1.1 Documents, Schemas, and Schema Languages........... 7
Towards practical typechecking for macro tree transducers (2007)
Abstract. 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 toward an...
Purifying XML Structures by (2006)
XML has a tree structure, which allows various data expressions. In this work, we show the well-known notion of the functional dependency has an essential role in XML data modeling. The existing...
Regular Expression Types for XML (2005)
Hosoya, Haruo, Vouillon, Jerome, Pierce, Benjamin C.
We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations...
Regular expression types for XML (2005)
Hosoya, Haruo, Vouillon, Jérôme, Pierce, Benjamin
We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations...
Regular expression pattern matching for XML (2003)
Hosoya, Haruo, Pierce, Benjamin C
We propose regular expression pattern matching as a core feature of programming languages for manipulating XML. We extend conventional pattern-matching facilities (as in ML) with regular expression...
Regular expression pattern matching — a simpler design (2003)
Regular expression pattern matching is a programming language feature designed for the analysis and decomposition of XML documents. Since the basis is regular expressions, a pattern may ambiguously...
Validation algorithm for attribute-element constraints of RELAX NG (2003)
Montréal Québec, Makoto Murata, Haruo Hosoya
Patterns of RELAX NG can represent interdependencies between attributes and elements. Such patterns are useful for schema authors. However, they make validator implementation algorithmically...
Boolean operations and inclusion test for attribute-element constraints (2003)
Abstract The history of schema languages for XML is an increase of expressiveness. While early schema languages mainly focused on the element structure, Clark first paid an equal attention to...
The Topological Index Z Before and After 1971 (2002)
The author's first paper on the topological index Z was published in Bull. Chem. Soc. Jpn. in 1971, where good correlation was found between the boiling points of alkane isomers and their Z values....
Regular expression pattern matching for XML (2001)
We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats). We extend conventional pattern-matching...
Regular expression pattern matching for XML (2001)
We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats). We extend conventional pattern-matching...
Regular Expression Pattern Matching for XML (2001)
Haruo Hosoya, Benjamin C. Pierce
We propose regular expression pattern matching as a core feature of programming languages for manipulating XML. We extend conventional pattern-matching facilities (as in ML) with regular expression...
Regular Expression Types for XML (2000)
Haruo Hosoya, Jérôme Vouillon, Benjamin C. Pierce
We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in...
Tree Automata and Pattern Matching (2000)
Tree automata have been used both in program analyses for functional languages and in type systems for tree-like data such as SGML and XML. They also form a natural basis for rich forms of pattern...
Regular Expression Types for XML (2000)
Haruo Hosoya, Jérôme Vouillon, Benjamin C. Pierce
We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in...
XDuce: A Typed XML Processing Language (Preliminary Report) (2000)
Haruo Hosoya And, Haruo Hosoya, Benjamin Pierce
this paper, we present a preliminary design for a statically typed programming language, XDuce (pronounced "transduce"). XDuce is a tree transformation language, similar in spirit to...
XDuce: A Typed XML Processing Language (2000)
Haruo Hosoya, Benjamin C. Pierce
this paper, we present a preliminary design for a statically typed programming language, XDuce (pronounced "transduce "). XDuce is a tree transformation language, similar in spirit to...
How Good is Local Type Inference? (1999)
Hosoya, Haruo, Pierce, Benjamin C
A partial type inference technique should come with a simple and precise specification, so that users predict its behavior and understand the error messages it produces. Local type inference...
How Good is Local Type Inference? (1999)
Haruo Hosoya, Benjamin C. Pierce
A partial type inference technique should come with a simple and precise specification, so that users predict its behavior and understand the error messages it produces. Local type inference...
XDuce: An XML Processing Language (1999)
Haruo Hosoya, Benjamin C. Pierce
this report, we give a formal specification of the XDuce language (omitting all proofs of its properties). In the next section, we define the syntax of values and types and the subtyping relation. In...
Formal Description for Collecting Reachable Garbage via Dynamic Type Inference (1998)
Haruo Hosoya, Akinori Yonezawa
A garbage collection (GC) scheme --- what we call type inference GC --- that dynamically performs type inference is studied. In contrast to conventional garbage collection that can collect only...
Garbage Collection via Dynamic Type Inference - A Formal Treatment (1998)
Haruo Hosoya, Akinori Yonezawa
. A garbage collection (GC) scheme --- what we call type inference GC --- that dynamically performs type inference is studied. In contrast to conventional garbage collection that can collect only...