Does pure have some nice properties?

[DAY]

Hi,

Since Pure is essentially based on Term Rewriting, I wonder if there is some calculus behind.  If there is one, does it have some nice properties like confluence, etc?  Thanks.

[John Cowan]

DAY scripsit:

> Since Pure is essentially based on Term Rewriting, I wonder if there is
> some calculus behind. If there is one, does it have some nice properties
> like confluence, etc? Thanks.

Pure is definitely not confluent. It resolves that by applying earlier
rules before later ones, and within a rule, from inner to outer and from
left to right. Most of the built-in rules are in fact locally confluent,
which is not surprising because most of them come from Haskell.

--
John Cowan co...@ccil.org http://www.ccil.org/~cowan
Any day you get all five woodpeckers is a good day. --Elliotte Rusty Harold

[Yuri D'Elia]

On 06/13/2012 09:21 AM, John Cowan wrote:
> Pure is definitely not confluent. It resolves that by applying earlier
> rules before later ones, and within a rule, from inner to outer and from
> left to right. Most of the built-in rules are in fact locally confluent,
> which is not surprising because most of them come from Haskell.

Is haskell fully confluent? (pattern matching is actually evaluated
sequentially AFAIK)