Skip to content

Monthly Archives: September 2008

ICFP 09 programming contest results presentation

The ICFP 09 programming contest results presentation is here on video.
(via comp.lang.scheme)

When your debugger is just a library

Q. Can you’re debugger just be a library?
A. Seemingly, yes.

Remove .svn files recursively

Today I needed to convert a Subversion working copy (aka a checkout) into an export. Recursively blowing away all of the .svn directories in DOS (Windows XP) didn’t seem to be straightforward so I ended up using UNIX find in cygwin. Here is the command:

find . -type d -name ‘.svn’ -exec rm -rf {} \;

The [...]

Updated: Switching Caps Lock with Control on Windows

See here.

HtDP: Problem 9.5.5

In problem 9.5.5, I knew I wasn’t understanding something. I thought that I had followed the recipe, yet I couldn’t solve the problem. That alone was a red flag indicating that I most probably did not follow the recipe!
In this discussion everyone helped me to see what I was missing. The thing was that I [...]

HtDP: Problem 10.1.9

In problem 10.1.9, I wanted to force a problem to be recursive when it really wasn’t. Matthias and Carl helped me see the difference here in the discussion that followed. Here are some notes:
Matthias:

In HtDP, the word “natural” is a technical word. It means
if your INPUT data definition has a self-reference in the Nth clause [...]

The essence of form abstraction

Formlets:
Abstraction is the cornerstone of high-level programming; HTML forms are the principal medium of web interaction. However, most web programming environments do not support abstraction of form com- ponents, leading to a lack of compositionality. Using a semantics based on idioms, we show how to support compositional form construction and give a convenient syntax. [...]

Packed Binary Routines for PLT Scheme

Per Doug’s post:

I have implemented an equivalent of the Python pack/unpack functions in PLT Scheme. I needed it primarily to be able to (more easily) read binary data from other applications for analysis in PLT Scheme.

Here is what it does:

This module performs conversions between PLT Scheme values and C structs represented as PLT Scheme byte [...]

Checking Errors

Originally posted here:

You can check for error messages on your functions by using:
(check-error (fun arg1 … argn) “fun: <err message>”)
See also: here

PLT search plugin

Marek Kubica created a Mozilla search provider plugin for PLT Scheme. Check it out here.
(via PLT)