Tag: Scheme
Why Calculating is Better than Scheming
In 1987 Phil Wadler wrote the paper Why Calculating is Better than Scheming. It is an essay on the shortcomings of using Scheme as the programming language with which to teach beginning programmers in SICP, and how Miranda would have a better choice for teaching the software engineers of tomorrow. This was very fun for me to read, and might be for you, too, if you are interested in teaching or the history of both Haskell and Scheme.
Continue reading “Why Calculating is Better than Scheming”
Carneades
Carneades is an argument mapping application, with a graphical user interface, and a software library for building applications supporting various argumentation tasks.
The interesting thing about this is that it is written in both JavaFX and R6RS Scheme!
(via comp.lang.scheme)
Some discussion on call/cc
This thread on comp.lang.scheme discusses the application of call/cc, in particular this example which can be pretty difficult to understand.
LINQ for R6RS Scheme
The LINQ Project is a codename for a set of extensions to the .NET Framework that encompass language-integrated query, set, and transform operations. It extends C# and Visual Basic with native language syntax for queries and provides class libraries to take advantage of these capabilities.
Leppie has covertly added LINQ support to another language, R6RS Scheme!
- The Code; including documentation, tests, and examples
- A post about it
- A comp.lang.scheme post discussing part of its implementation
- Where I heard about it
JavaScript for PLT Scheme
This package is an implementation of the ECMAScript language specified by ECMA-262 Edition 3, better known as JavaScript.
Here is a link straight to the documentation.
A DrScheme REPL Improvement
DrScheme’s REPL has always had sort of an annoying behavior where the HOME key (or arrows) do’t respect the REPL prompt (which is the ‘>’). This is now fixed; and in SVN.
IrRegular Expressions
IrRegex version 0.7.0 is now available here:
A fully portable and efficient R[456]RS implementation of regular expressions, supporting both POSIX syntax with various (irregular) PCRE extensions, as well as SCSH’s SRE syntax, with various aliases for commonly used patterns. DFA matching is used when possible, otherwise a closure-compiled NFA approach is used. The library makes no assumptions about the encoding of strings or range of characters and can thus be used in Unicode-aware Scheme implementations. Matching may be performed over standard Scheme strings, or over arbitrarily chunked streams of strings.
IrRegex is portable between R4RS, R5RS, and R6RS; and almost completely PCRE compatible. Very nice!
(via comp.lang.scheme)
Lisp Style Rules
Riastradh’s Lisp Style Rules are a wholly holistic and unscientific take on Lisp style rules. They have helped me not only to get a better sense of how Lisp people do things, but also why. There is other stuff like this around the Internet, but this is the only I’ve found that I enjoyed reading.
While there are a lot of good rules in the guide, not all of them were new to me, so I only took notes on the ones that I found interesting for one reason or another.
Continue reading “Lisp Style Rules”
Skimp Scheme
Skimp Scheme is a toy interpreter, about which the author makes a lighthearted quip:
Early days yet, but during a couple of enthusiastic hacking sessions while on Summer holiday in Italy, Skimp started talking back. It’s a surreal moment when a new interactive language interpreter come to life… like something with legs just strolled out of your primordial C program and asking for a pan galactic gargle blaster.