| Can we have extensional products and functions (or at least the means
| to define them) please?
Does anyone want to come up with a concrete language proposal?
Language issues
~~~
A significant difficulty is that seq is essentially un-implementable
for unlifted products (requires
| Can we have extensional products and functions (or at least the means
| to define them) please?
Language issues
~~~
A significant difficulty is that seq is essentially un-implementable
for unlifted products (requires parallelism).
Well, all you need is an evaluation with a
On Wed, Jan 19, 2000 at 03:18:34PM -0700, Joe Fasel wrote:
*Sigh* And the language named in honor of Haskell Curry
for which Currying is not a valid transformation strikes
again!
Worse, not only are the built-in product and function types lifted,
but one can't define the unlifted ones.
Ross Paterson wrote:
On Wed, Jan 19, 2000 at 03:18:34PM -0700, Joe Fasel wrote:
*Sigh* And the language named in honor of Haskell Curry
for which Currying is not a valid transformation strikes
again!
Worse, not only are the built-in product and function types lifted,
but one can't
Folks,
I claimed that these are different functions:
partition1 p xs = (filter p xs, filter (not . p) xs)
partition2 p = foldr (\x (ys, zs) - if p x then (x:ys,zs) else (ys,x:zs))
([],[])
I was correct, but not for the reason I thought. Nota bene:
partition1 p
