The'Scrap your boilerplate'approach to generic programming allows the programmer to write
generic functions that can traverse arbitrary data structures, and yet have type-specific …

This article is the first part of a two articles series about a calculus with higher-order
polymorphic functions, recursive types with arrow and product type constructors and set …

We define and study parametric polymorphism for a type system with recursive, product,
union, intersection, negation, and function types. We first recall why the definition of such a …

Different XML formats are widely used for data exchange and processing, being often
necessary to mutually convert between them. Standard XML transformation languages, like …

Abstract Types and formal type systems have proven invaluable in the design and use of
modern declarative languages. The Hindley/Milner type system forms the basis of many type …

Regular expression sub-matching is the problem of finding for each sub-part of a regular
expression a matching sub-string. Prior work applies Thompson and Glushkov NFA methods …

THÈSE l’Université Paris 7 – Denis Diderot Docteur en Sciences Théorie, conception et
réalisation d’un langage de prog Page 1 THÈSE présentée à l’Université Paris 7 – Denis …

We present an extension of Haskell, baptized XHaskell, which combines parametric
polymorphism, algebraic data types and type classes found in Haskell with regular …

XML (eXtensible Markup Language) is a current standard format for exchanging semi-
structured data, which has been applied to web services, database, research on formal …

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 …