mized recursion algorithm. I am just looking
into prompts which apparently will let me break out of folds which was
often an annoyance for me in Haskell. Thanks for all the responses.
Hi Jerry!
For this to work guile would need to be either pure or lazy. Lazy, because a
value would only be pulled th
On 6/19/21 7:20 AM, Christopher Lam wrote:
Agree set! is not a desirable form. It is not consistently optimisable.
I cannot find the reference in the manual.
Also consider the first form: you're building a list in 3 passes -- call
iota to generate a list, call filter to navigate the list again
On 6/19/21 6:25 AM, Tim Van den Langenbergh wrote:
On Saturday, 19 June 2021 02:55:34 CEST jerry wrote:
I am fairly new to guile and scheme. People tell me that I should use a
functional style.
I have 3 solutions for project euler problem #1. The first is
functional, the second is imperative
I am fairly new to guile and scheme. People tell me that I should use a
functional style.
I have 3 solutions for project euler problem #1. The first is
functional, the second is imperative and the third is written in "Little
Schemer" style.
I was hoping other guile users would comment on pre
