CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Regular Expression Patterns

Niklas Broberg (Institutionen för datavetenskap, Funktionell programmering) ; Andreas Farre (Institutionen för datavetenskap) ; Josef Svenningsson (Institutionen för datavetenskap, Funktionell programmering)
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming p. 67 - 78. (2004)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: regular expressions, pattern matching, Haskell

Denna post skapades 2006-10-09.
CPL Pubid: 22484


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap, Funktionell programmering (2002-2004)
Institutionen för datavetenskap (2002-2004)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Scalable Program Analysis and topics in Programming Language Design and Transformation