comp.lang.scheme Google Group

ANN: bigloo3.8c

manuel.serr...@inria.fr (Manuel Serrano) — Fri, 01 Jun 2012 14:28:11 UT

------------------------------ ------------------------------ ----
Bigloo (3.8c) ,--^,
`a practical Scheme compiler' _ ___/ /|/
Fri Jun 1 10:11:19 CEST 2012 ,;'( )__, ) '
Inria -- Sophia Antipolis ;; // L__.

SICP: orders of growth

nkw...@gmail.com (.) — Thu, 31 May 2012 00:53:58 UT

Hello,

Could you explain the following?
"The tree-recursive Fibonacci computation requires theta(phi^n) steps
and space theta(n), where phi is the golden ratio described in
section 1.2.2." [1]
Why theta(phi^n), not theta(phi^n/sqrt5)?
How to check this?

Could you also comment on the Exercise 1.14?

problem with lat? (TLS 4ed)

co...@howarth.de (colin howarth) — Tue, 29 May 2012 10:12:34 UT

Hi, I'm just starting out with Scheme (and Lisp) and am going through The Little Schemer.

I'm confused, right at the beginning and wanted to ask, since this seems important (cf. The First Commandment)...

lat? is defined in the book as

(define lat?
(lambda (l)
(cond
((null? l) #t)

Call for Papers: Implementation and Application of Functional Languages 2012

j...@cs.ox.ac.uk (José Pedro Magalhães) — Wed, 23 May 2012 11:19:16 UT

------------------------------ ------------------------------ -------------------

CALL FOR PAPERS

24th Symposium on Implementation and
Application of Functional Languages (IFL 2012)

University of Oxford, UK, August 30-September 1, 2012

ssax-sxml to ignore namespaces

abm221...@gmail.com (Armando Blancas) — Mon, 21 May 2012 15:10:05 UT

I'm using ssax-sxlm to parse Maven's pom.xml files. Some will have namespaces and the rest just a plain project tag. I'd like to get the sxml with the simple local names even when the namespaces are present but haven't figured out how to use ssax-sxml for doing that.

Alternatively, I defined two aliases, for ns and xsi, but can't get the sxpath function to recognize the aliases (I get "unknown namespace ns") using a string path like "//project/dependencies/*".

is there a prevalence layer in scheme?

gavcom...@gmail.com (quiet_lad) — Mon, 21 May 2012 01:16:18 UT

[link]

NEW HOT PHOTOS & VIDEOS

sravanthi.sravy...@gmail.com (SRAVANTHI LOVE) — Sun, 20 May 2012 15:50:21 UT

ALL INTERVIEW QUESTIONS& STUDY MATERIAL
[link]

TOP DATING TIPS TO ENCOURAGE WOMEN FOR DATING
[link]

FOR LATEST MOVIE UPDATED LINKS
MR 7 MOVIE FILM GALLERY

SICP: Exercise 1.11.

nkw...@gmail.com (.) — Sun, 20 May 2012 02:06:56 UT

Hello,

I've got stuck with another exercise.

"A function f is defined by the rule that f(n) = n if n<3 and f(n) =
f(n - 1) + 2f(n - 2) + 3f(n - 3) if n> 3. Write a procedure that
computes f by means of a recursive process. Write a procedure that
computes f by means of an iterative process." [1]

SICP: Counting change

nkw...@gmail.com (.) — Thu, 17 May 2012 08:54:25 UT

Hello,

"If a is exactly 0, we should count that as 1 way to make change." [1]
Could you explain this? I thought that we should count that as 0 ways
to make a change.

[1] [link]

Regards

in search of a cute type predicate syntax

ma...@maggi.invalid (Marco Maggi) — Sun, 13 May 2012 08:51:55 UT

Ciao,

I am redesigning the class libraries in Nausicaa[1]; one goal
is to allow use of classes and labels by importing only the type
identifier (which is a macro keyword) and not the full language
(nausicaa). For example:

#!r6rs
(library (alpha)
(export <alpha>)
(import (nausicaa))

Why is (eqv? g g) unspecified in R6RS when g is a procedure?

johnwco...@gmail.com (John Cowan) — Tue, 08 May 2012 12:24:21 UT

One of the changes between R5RS and R6RS is that (eqv? x x), where
x is a variable whose value is a procedure, is allowed to return #f.
The R6RS Rationale, section 11.5.1, says in its entirety:

The definition of eqv? allows implementations latitude in their
treatment of procedures: implementations are free either to detect or

NYC LOCAL: Tuesday 8 May 2012 Lisp NYC Eating and Drinking

secret...@lxny.org — Tue, 08 May 2012 04:04:49 UT

Date: Mon, 07 May 2012 12:06:04 -0400
From: Heow Goodman <li...@alphageeksinc.com>
To: l...@lispnyc.org, lisp-annou...@lispnyc.org
Subject: Lisp Meeting, Tue May 8th at Amsterdam Ale House

Re: Faster remove-duplicates with sorted list.

w_a_x_...@yahoo.com (WJ) — Sat, 05 May 2012 04:51:51 UT

Using Racket instead of COBOL:

(define (remove-duplicates-sorted xs [prev xs])
(define (test x) (begin0 (equal? x prev) (set! prev x)))
(filter-not test xs))

(remove-duplicates-sorted '(a a b c c c d d))
=> '(a b c d)

Always remember, and never forget:
WE DON'T NEED NO STINKIN' LOOPS!

Suggested Scheme Interpreter/Compiler for Learning the Language?

hsa...@gmail.com (haziz) — Fri, 04 May 2012 17:51:34 UT

Which Scheme interpreter or Compiler do you suggest for learning the language? I will be reading from Dybvigs "The Scheme Programming Language" book (probably the third rather than the fourth edition) and the Little Schemer. I have installed Guile and was considering adding the Petite Chez Scheme interpreter. Another option would be the PLT-Scheme, which I did not warm up to in the past on very superficial use, or MIT Scheme.

Dybvig's TSPL 3rd vs 4th Edition?

hsa...@gmail.com (haziz) — Fri, 04 May 2012 10:39:47 UT

I am trying to learn the basics of Scheme, while going through the "open-courseware" Stanford Programming Paradigms CS107 course (2008), which touches very lightly on Scheme at the end of the course.

I have a hard-copy of the 3rd edition of Dybvig's The Scheme Programming Language, and obviously can access the 4th edition online? I also have the Little Schemer book but find it a bit weird.