Sciweavers

66 search results - page 5 / 14
» Rewriting Haskell Strings
Sort
View
ICFP
2004
ACM
14 years 7 months ago
Regular expression patterns
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 ...
Niklas Broberg, Andreas Farre, Josef Svenningsson
FUIN
2007
120views more  FUIN 2007»
13 years 7 months ago
Concurrent Turing Machines
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
Berndt Farwer, Manfred Kudlek, Heiko Rölke