PLT Scheme version 4.0 is now available from
http://plt-scheme.org/
This major new release offers many improvements over version 372, and
we encourage everyone to upgrade.
* The PLT Scheme language now provides better syntax for modules,
better support for optional and keyword arguments to functions, a
more complete syntax for structure types, new syntax for list
comprehensions and iterations, a more complete and consistent set
of list operations, a more complete set of string operations, and
streamlined hash-table operations.
* The documentation has been re-organized and re-written. New
tutorials and overviews offer a clearer introduction to Scheme and
PLT Scheme.
* New documentation tools help programmers create and install
documentation for libraries and Planet packages. All installed
documentation can be read though the user's web browser, and even
searching within the browser works on local files.
The language for writing documentation is an extension of Scheme,
and document sources are linked to implementations through the
module system. The module connection allows, for example,
reliable automatic hyperlinking of identifiers mentioned in
documentation to their specifications in other documentation.
* R6RS programs are supported in two ways: though the `plt-r6rs'
executable and through the `#!r6rs' prefix. The latter allows an
R6RS library or program to serve as a PLT Scheme module.
* Legacy R5RS support is improved, partly through a separate
`plt-r5rs' executable.
* Pairs are immutable within the PLT Scheme language; mutable pairs
(which are the same as R6RS and R5RS pairs) are provided as a
separate datatype. For more information, see
http://blog.plt-scheme.org/2007/11/getting-rid-of-set-car-and-set-cdr.html
* ProfessorJ uses a new and improved parser, it evaluates programs
faster, and it includes a Java-specific indenter.
* Testing frameworks for the HtDP and HtDC (ProfessorJ) teaching
languages have been unified. Both support systematic unit testing
in a comprehensive fashion. When programs lack tests, students
are asked to add test cases. When all tests succeed, a simple
message says so; otherwise, a pop-up window (dockable) displays
URLs to the failed test cases and explains why the cases failed.
* Typed Scheme, a statically typed dialect of Scheme, is now
included with PLT Scheme. While Typed Scheme is still in its
early stages of development, it supports modular programming with
types and full interaction with existing untyped code. Safe
interactions between typed and untyped modules are enforced via
contracts. Typed Scheme also features a novel type system
designed to accommodate Scheme programming idioms. For more
information, see http://www.ccs.neu.edu/~samth/typed-scheme/ .
Feedback Welcome,
--
((lambda (x) (x x)) (lambda (x) (x x))) Eli
Barzilay:
http://www.barzilay.org/ Maze is
Life!
On Jun 13, 8:52 pm, Eli Barzilay <····@barzilay.org> wrote:
> PLT Scheme version 4.0 is now available from
>
> http://plt-scheme.org/
>
> This major new release offers many improvements over version 372, and
> we encourage everyone to upgrade.
>
> * The PLT Scheme language now provides better syntax for modules,
> better support for optional and keyword arguments to functions, a
> more complete syntax for structure types, new syntax for list
> comprehensions and iterations, a more complete and consistent set
> of list operations, a more complete set of string operations, and
> streamlined hash-table operations.
>
> * The documentation has been re-organized and re-written. New
> tutorials and overviews offer a clearer introduction to Scheme and
> PLT Scheme.
>
> * New documentation tools help programmers create and install
> documentation for libraries and Planet packages. All installed
> documentation can be read though the user's web browser, and even
> searching within the browser works on local files.
>
> The language for writing documentation is an extension of Scheme,
> and document sources are linked to implementations through the
> module system. The module connection allows, for example,
> reliable automatic hyperlinking of identifiers mentioned in
> documentation to their specifications in other documentation.
>
> * R6RS programs are supported in two ways: though the `plt-r6rs'
> executable and through the `#!r6rs' prefix. The latter allows an
> R6RS library or program to serve as a PLT Scheme module.
>
> * Legacy R5RS support is improved, partly through a separate
> `plt-r5rs' executable.
>
> * Pairs are immutable within the PLT Scheme language; mutable pairs
> (which are the same as R6RS and R5RS pairs) are provided as a
> separate datatype. For more information, see
>
> http://blog.plt-scheme.org/2007/11/getting-rid-of-set-car-and-set-cdr...
>
> * ProfessorJ uses a new and improved parser, it evaluates programs
> faster, and it includes a Java-specific indenter.
>
> * Testing frameworks for the HtDP and HtDC (ProfessorJ) teaching
> languages have been unified. Both support systematic unit testing
> in a comprehensive fashion. When programs lack tests, students
> are asked to add test cases. When all tests succeed, a simple
> message says so; otherwise, a pop-up window (dockable) displays
> URLs to the failed test cases and explains why the cases failed.
>
> * Typed Scheme, a statically typed dialect of Scheme, is now
> included with PLT Scheme. While Typed Scheme is still in its
> early stages of development, it supports modular programming with
> types and full interaction with existing untyped code. Safe
> interactions between typed and untyped modules are enforced via
> contracts. Typed Scheme also features a novel type system
> designed to accommodate Scheme programming idioms. For more
> information, seehttp://www.ccs.neu.edu/~samth/typed-scheme/.
>
> Feedback Welcome,
> --
> ((lambda (x) (x x)) (lambda (x) (x x))) Eli
> Barzilay:
> http://www.barzilay.org/ Maze is
> Life!
While I like scheme because it is simple and nice for educational
purposes (I am currently doing SICP in my spare time and I did HTDP a
couple of years ago), I pose the same question as I did regarding Java
on Slashdot : how long before scheme morphs into Common Lisp ?
Regards,
Jurgen
P� Sat, 14 Jun 2008 09:07:20 +0200, skrev jurgen_defurne
<··············@pandora.be>:
>
> While I like scheme because it is simple and nice for educational
> purposes (I am currently doing SICP in my spare time and I did HTDP a
> couple of years ago), I pose the same question as I did regarding Java
> on Slashdot : how long before scheme morphs into Common Lisp ?
>
> Regards,
>
> Jurgen
Scheme borrows ideas from a lot of languages. It is effectivly language
labratory worbench of sometimes conflicting and overlapping goals.
Looking through PLT Scheme I see a object system that looks like
Smalltalk, Design by contract from Eiffel, units look a lot like Ada
packages.
Modules look like a extension of the module system in Common lisp. Swindle
looks a lot like Common Lisp..
The typed Scheeme looks like it borrows from Haskell.
I don't know why you think all languages are morphing into Lisp.
--------------
John Thingstad