We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as found in Haskell. It has proven useful for string manipulation and for processing structured data such as XML. Regular expression patterns can be used with arbitrary lists, and work seamlessly together with ordinary pattern matching in Haskell. Our extension is lightweight, it is little more than syntactic sugar. We present a semantics and a type system, and show how to implement it as a preprocessor to Haskell
We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables...
This thesis consists of two separate parts. Both concernprogramming language design, the first in th...
AbstractThis paper presents a Boyer–Moore-type algorithm for regular expression pattern matching, an...
We propose regular expression pattern matching as a core feature of programming languages for manipu...
We propose an extension to patterns and pattern matching in Haskell. The idea is to o er the option ...
We define the pattern expressions as an extension of both regular expressions and patterns. We prove...
Regular expression pattern matching for XML We propose regular expression pattern matching as a core...
Haskell is a functional programming language with nominally non-strict semantics, implying that eval...
AbstractWe propose three extensions to patterns and pattern matching in Haskell. The first, pattern ...
We propose regular expression pattern matching as a core feature of programming languages for manipu...
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular e...
Regular expressions are used in many practical applications. Practical regular expressions are commo...
Most major programming languages support regular expressions, but the features, performance, and mat...
The problem of supporting the modular extensibility of both data and functions in one programming la...
A usage of regular expressions to search text is well known and understood as a useful technique. Re...
We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables...
This thesis consists of two separate parts. Both concernprogramming language design, the first in th...
AbstractThis paper presents a Boyer–Moore-type algorithm for regular expression pattern matching, an...
We propose regular expression pattern matching as a core feature of programming languages for manipu...
We propose an extension to patterns and pattern matching in Haskell. The idea is to o er the option ...
We define the pattern expressions as an extension of both regular expressions and patterns. We prove...
Regular expression pattern matching for XML We propose regular expression pattern matching as a core...
Haskell is a functional programming language with nominally non-strict semantics, implying that eval...
AbstractWe propose three extensions to patterns and pattern matching in Haskell. The first, pattern ...
We propose regular expression pattern matching as a core feature of programming languages for manipu...
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular e...
Regular expressions are used in many practical applications. Practical regular expressions are commo...
Most major programming languages support regular expressions, but the features, performance, and mat...
The problem of supporting the modular extensibility of both data and functions in one programming la...
A usage of regular expressions to search text is well known and understood as a useful technique. Re...
We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables...
This thesis consists of two separate parts. Both concernprogramming language design, the first in th...
AbstractThis paper presents a Boyer–Moore-type algorithm for regular expression pattern matching, an...