Niklas Broberg wrote:
.. We came up with the idea of HaRP: Haskell Regular Patterns.
taking data and patterns as typed trees
obviously is the right thing (tm).
in principle, such patterns describe regular tree languages
(if we disregard nested data types for the moment - they give CF
languages)
Subject: [Haskell] regular expression syntax - perl ain't got nothin on
haskell
Agreed, Perl certainly ain't got nothing on Haskell, but we could go even
further than just imitating (although better than the original) Perl
functionality. =)
Hence:
As a spin-off of another project [1], we found