Browsing French translation

32271.

Haskell implementation of a weighted regular expression matcher with linear worst-case time and space bounds. More specifically, the worst-case run time for matching a word against a regular expression is linearly bounded by the length of the word and the size of the regular expression. The memory requirements are independent of the length of the word and linear in the size of the regular expression. This makes this library suitable when processing untrusted data, e.g. in a web service, without risking an unexpected runtime blow-up. This package provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.