Skip to content

Tag Archives: Programming Language

Chibi Scheme Build for an OS X library and iOS REPL

Meng Zhang set up project files for building Chibi for OS X and an iOS REPL here. With virtually no iOS knowledge I just checked it out, built it, and ran it on the simulator in a couple of minutes. Thank you Alex and Meng! (via chibi-scheme)

Distributed Computing with Gambit

Here is the link; the source has a lot more. (via comp.lang.scheme)

Sagittarius Scheme System

Sagittarius Scheme System is a “mostly R6RS Scheme system”. (via scheme-reports)

A Slow Study Group for ML

Hi, I’m going to work through http://www.ccs.neu.edu/home/matthias/BTML/ and http://www.cl.cam.ac.uk/~lp15/MLbook/ using http://www.smlnj.org/ SLOWLY over MANY MONTHS. The reason is that I’ve never learned a statically typed functional programming language, I feel weak on recursive data type definitions, and I am curious about compiler and interpreter construction. So, I’m looking for a way to learn about all [...]

Whalesong: a Racket to JavaScript compiler

Whalesong is a compiler from Racket to JavaScript; it takes Racket programs and translates them so that they can run stand-alone on a user’s web browser. It should allow Racket programs to run with (hopefully!) little modification, and provide access through the foreign-function interface to native JavaScript APIs. The included runtime library supports the numeric [...]

The rational for returning the identity for expressions such as (*) and (+)

This post in comp.lang.scheme brings up a question that inevitably everyone asks. Suppose the answer is obvious but John summed it up well: Well, if you interpret (apply + some-list) and (apply * some-other-list) as left-folds, then a starting point is needed, something to begin accumulating from. The identity is the only value that works [...]

Destructuring Lists Using CA*D*R vs First, Second, … vs Pattern Matching

This thread discusses the pros and cons of using the CA*D*R functions vs named first, second, third, list-tail, … and so on vs pattern matching for the same task. I thought that pattern-matching was the best way to do it; and now I’m curious about why CA*D*R is better.

R7RS Initial Results of Implementor Intentions Poll

The following all intend to support R7RS small: * Per Bothner (Kawa) * Will Clinger (Larceny) * Shiro Kawai (Gauche) * Manuel Serrano (Bigloo) – “not sure about libraries” * Alex Shinn (Chibi) – “already fully implemented, but lacking tests” * Felix Winkelmann (Chicken) The following were less committal, but open, and their implementations are [...]

A Nice Update on WG1 of R7RS

Here. Basically it is finished. Can’t wait for WG2 to get started. (via scheme-reports)

SISC (R5RS Scheme) on Android

Details here. (via Reddit)