In article [EMAIL PROTECTED],
Mark T.B. Carroll [EMAIL PROTECTED] wrote:
I don't suppose anyone can hand-hold me through tracking this problem
down?
I've been rather neglecting JVM Bridge since I got a paying job back in
December. But I'll try to have a look at this over the weekend.
Likely
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] wrote:
Similarly, R5RS obligates any Scheme implementation to resort to
assignments when processing a letrec form.
Not mine! I do use a polyvariadic fixed-point function.
(define circular (letrec ((c (cons 'x c))) c))
(list-head circular
Christopher Milton [EMAIL PROTECTED] writes:
I think Haskell can be used to solve several, if not all, of
the seven problems.
Now I have to decide which problem to tackle first.
(a joke, I assume...)
http://www.claymath.org/Millennium_Prize_Problems/
1. Birch and Swinnerton-Dyer
Hi,
Can anyone explain to me how hugs manages to derive that
f x y z = y (y z) x
is of type
f :: a - ((a - b) - a - b) - (a - b) - b
This question was posted from an Oxford University computer; it also smells like
homework.
If it's genuinely not homework, Lee, I apologise!
See
Another bit of code that seems to work is:
convertState :: (s1 - s2)
- (s2 - s1)
- State s2 a
- State s1 a
convertState fromState toState computation =
do oldState - get
let (result, newState) =
runState computation (fromState
Ashley Yakeley wrote:
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] wrote:
Similarly, R5RS obligates any Scheme implementation to resort to
assignments when processing a letrec form.
Not mine! I do use a polyvariadic fixed-point function.
An implementation may not
use a (polyvariadic) Y
--- Keith Wansbrough [EMAIL PROTECTED] wrote:
Christopher Milton [EMAIL PROTECTED] writes:
I think Haskell can be used to solve several, if not all, of
the seven problems.
Now I have to decide which problem to tackle first.
(a joke, I assume...)
On Friday, January 09, 2004 2:48 AM, Ashley Yakeley
[SMTP:[EMAIL PROTECTED] wrote:
Do you have an example of use of Y for letrec where a program would
violate R5RS?
Sure, take a look at my implementation of Ben Rudiak-Gould's
implementation of Alan Bawden's implementation of boxes.
In 4.2.2
--- Keith Wansbrough [EMAIL PROTECTED] wrote:
Christopher Milton [EMAIL PROTECTED] writes:
I think Haskell can be used to solve several, if not all, of
the seven problems.
Now I have to decide which problem to tackle first.
(a joke, I assume...)
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] wrote:
In this post to c.l.scheme, Dorai Sitaram writes:
letrec with set! is certainly different from letrec with Y,
and you don't need call/cc to distinguish the two.
(define *keep-track* '())
(letrec ((fact (lambda (n)
Ashley Yakeley wrote:
Similarly, R5RS obligates any Scheme implementation to resort to
assignments when processing a letrec form.
Not mine! I do use a polyvariadic fixed-point function.
I'm sorry but you don't have the choice in the matter -- if you wish
to call your implementation
Hi.
I am a student, who get interesting in Haskell.
So, nowdays, I study Hakell with Introduction to Functional Programming
using Haskell - second edition
And today, I face an error from bellow code.
module OperationTest where
data Nat = Zero | Succ Nat
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] wrote:
(define circular (letrec ((c (cons 'x c))) c))
I'm afraid that is not a R5RS compliant code.
Indeed not, it merely demonstrates fixed-point behaviour. Nevertheless,
allowing this as an extension does not make my implementation
In article [EMAIL PROTECTED],
NamO [EMAIL PROTECTED] wrote:
But above source make an error like bellow
Reading file g:\Haskell\OperationTest.hs:
Dependency analysis
ERROR g:\Haskell\OperationTest.hs:8 - Ambiguous variable occurrence +
*** Could refer to: OperationTest.+ Prelude.+
There's
14 matches
Mail list logo
