A Type-Safe Embedding of XDuce into ML

Sulzmann, Martin; Lu, Kenny Zhuo Ming

doi:10.1016/j.entcs.2005.11.047

Cited by 13 publications

(10 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We consider that RETs are a straightforward type representation of syntax trees, and RETs can make a theoretical bridge between declarative parsing, tree automata, and programming language design. Indeed, binding RETs with ML and OCaml has been reported in [5,22].…”

Section: Related Workmentioning

confidence: 93%

Cpeg

Yamaguchi

Kuramitsu

2019

Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing

View full text Add to dashboard Cite

CPEG is an extended parsing expression grammar with regex-like capture annotation. Two annotations (capture and left-folding) allow a flexible construction of syntax trees from arbitrary parsing patterns. More importantly, CPEG is designed to guarantee structural constraints of syntax trees for any input strings. This reduces the amount of user code needed to check whether the intended elements exist.To represent the structural constraints, we focus on regular expression types, a variant formalism of tree automata, which have been intensively studied in the context of XML schemas. Regular expression type is inferred from a given CPEG by the type inference that is formally developed in this paper. We prove the soundness and the uniqueness of the type inference. The type inference enables a CPEG to serve both as a syntactic specification of the input and a schematic specification of the output.

show abstract

Section: Related Workmentioning

confidence: 93%

Cpeg

Yamaguchi

Kuramitsu

2019

Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…Several systems integrate external data into a programming language. Those include XML [9,21] and databases [5]. In both of these, the system requires the user to explicitly define the schema (using the host language) or it has an ad-hoc extension that reads the schema (e.g.…”

Section: Related and Future Workmentioning

confidence: 99%

Types from data: making structured data first-class citizens in F#

2016

View full text Add to dashboard Cite

Most modern applications interact with external services and access data in structured formats such as XML, JSON and CSV. Static type systems do not understand such formats, often making data access more cumbersome. Should we give up and leave the messy world of external data to dynamic typing and runtime checks? Of course, not! We present F# Data, a library that integrates external structured data into F#. As most real-world data does not come with an explicit schema, we develop a shape inference algorithm that infers a shape from representative sample documents. We then integrate the inferred shape into the F# type system using type providers. We formalize the process and prove a relative type soundness theorem.Our library significantly reduces the amount of data access code and it provides additional safety guarantees when contrasted with the widely used weakly typed techniques.

show abstract

“…Indeed, both type systems (ML and XDuce) are kept apart, and a value is either seen as on the ML side -and can then be polymorphic-or on the XDuce side -and can then be precisely typed (with XDuce pattern matching for example)-. Finally, in the same spirit of combining two type systems, a more general approach was defined by Sulzmann and Lu [27] for Haskell where the authors mix Haskell type classes with XDuce regular expression types into a system called XHaskell [28]. They provide a semantics via a type-directed rewriting of the language into System F. While the decidability of the general version is not clear, some restrictions make it tractable and lead to an implementation of this work using the GHC Haskell compiler as backend.…”

Section: Related Workmentioning

confidence: 99%

Typed iterators for XML

Castagna

Nguyễn

2008

SIGPLAN Not.

View full text Add to dashboard Cite

XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore, operations, even simple ones, that modify these features may affect the types of documents. Operations on XML documents are performed by iterators that, to be useful, need to be typed by a kind of polymorphism that goes beyond what currently exists. For this reason these iterators are not programmed but, rather, hard-coded in the languages. However, this approach soon reaches its limits, as the hard-coded iterators cannot cover fairly standard usage scenarios.As a solution to this problem we propose a generic language to define iterators for XML data. This language can either be used as a compilation target (e.g., for XPATH) or it can be grafted on any statically typed host programming language (as long as this has product types) to endow it with XML processing capabilities. We show that our language mostly offers the required degree of polymorphism, study its formal properties, and show its expressiveness and practical impact by providing several usage examples and encodings.

show abstract

A Type-Safe Embedding of XDuce into ML

Cited by 13 publications

References 22 publications

Cpeg

Cpeg

Types from data: making structured data first-class citizens in F#

Typed iterators for XML

Contact Info

Product

Resources

About