An Implementation of Subtyping Among Regular Expression Types

Lu, Kenny Zhuo Ming; Sulzmann, Martin

doi:10.1007/978-3-540-30477-7_5

Cited by 14 publications

(21 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that similar proof systems can be found for recursive type equality and subtyping [5]. A major achievement in [23] is to derive coercions for regular hedges. Although, we will not make use of this case here.…”

Section: Regular Expression Containment Proof Systemmentioning

confidence: 81%

“…The following result from [23] is an important corner stone on our way to achieve a type-safe embedding of XDuce into ML. …”

Section: Proof Derivations Proof Termsmentioning

confidence: 95%

“…Fortunately, in our own previous work [23] we show how to construct such coercions out of the proof of language containment among regular expression types. There, we define a proof system for deciding regular containment where a judgment…”

Section: Overviewmentioning

confidence: 99%

“…We review our own work reported in [23] where we devise a proof system for deciding regular expression language containment which additionally computes down-cast and up-cast coercions among structured ML representations of regular expressions. Note that similar proof systems can be found for recursive type equality and subtyping [5].…”

Section: Regular Expression Containment Proof Systemmentioning

confidence: 99%

See 3 more Smart Citations

A Type-Safe Embedding of XDuce into ML

Sulzmann

2006

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We consider the problem of integrating XDuce into ML. This is difficult because of incompatible type and value representations. Our solution is a type-driven translation scheme from XDuce to ML based on a structured representation of XDuce values. XDuce type inference guides the insertion of appropriate coercion functions to translate regular expression pattern matching and uses of semantic subtyping. We can extend our translation scheme to include ML function calls and patterns into XDuce. Thus, we can embed XDuce into ML. Our results allow to enrich the ML language with support for dealing with semi-structured data.

show abstract

Section: Regular Expression Containment Proof Systemmentioning

confidence: 81%

“…The following result from [23] is an important corner stone on our way to achieve a type-safe embedding of XDuce into ML. …”

Section: Proof Derivations Proof Termsmentioning

confidence: 95%

Section: Overviewmentioning

confidence: 99%

Section: Regular Expression Containment Proof Systemmentioning

confidence: 99%

See 2 more Smart Citations

A Type-Safe Embedding of XDuce into ML

Sulzmann

2006

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Regular expression patterns were first introduced in the XDuce [HP00] programming language and then adopted by other projects such as CDuce [BCF03] and its query language CQL [BCM05], Xtatic [GP03], Scala [OAC + 04], XHaskell [LS04] as well as the extension of Haskell proposed in [BFS04].…”

Section: Introductionmentioning

confidence: 99%

Error Mining for Regular Expression Patterns

Castagna

Colazzo

Frisch

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically checking that a transformation always yields data of an expected output type. While being crucial for correct program composition, result analysis is not sufficient to guarantee that patterns used in the transformation are correct. In this paper we motivate the need of static detection of incorrect patterns, and provide a formal characterization based on pattern matching operational semantics, together with locally exact type analysis techniques to statically detect them.

show abstract

Patterns and Types for Querying XML Documents

Castagna

2005

Database and XML Technologies

View full text Add to dashboard Cite

Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, and regular expression patterns, mainly developed and studied in the programming language community. We think that the two approaches are complementary and should be both integrated in languages for XML, and we see in that an opportunity of collaboration between the two communities. With this aim, we give a presentation of regular expression patterns and the type systems they are tightly coupled with. Although this article advocates a construction promoted by the programming language community, we will try to stress some characteristics that the database community, we hope, may find interesting.

show abstract

An Implementation of Subtyping Among Regular Expression Types

Cited by 14 publications

References 11 publications

A Type-Safe Embedding of XDuce into ML

A Type-Safe Embedding of XDuce into ML

Error Mining for Regular Expression Patterns

Patterns and Types for Querying XML Documents

Contact Info

Product

Resources

About