66 search results - page 5 / 14 » Rewriting Haskell Strings |
91
Voted
AC
1993
Springer
15 years 4 months ago
1993
Springer
JALC
2007
15 years 10 days ago
2007
89
Voted
TCS
1998
15 years 2 days ago
1998
ICFP
2004
ACM
16 years 12 days ago
2004
ACM
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 ...
102
click to vote
FUIN
2007
15 years 11 days ago
2007
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 ...