All Questions
4 questions
3
votes
0
answers
130
views
Performance issue regarding Project Euler #60 in Scheme
I solved Project Euler #60:
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 ...
5
votes
1
answer
318
views
Simple evaluator of Scheme-like expressions in Haskell
This is my first nontrivial Haskell program:
...
7
votes
1
answer
1k
views
Code from "Write Yourself a Scheme in 48 Hours" tutorial
I recently went through this Haskell tutorial.
I'd be interested in any thoughts or comments at all, in terms of improving the structure, order, haskell conventions, or that long, kind of ugly eval ...
11
votes
1
answer
575
views
On Implementing a Lisp
Background:
This began with James Colgan's Lisp-Dojo for Ruby. My implementation can be found here. I then moved on to Write yourself a scheme in 48 hours. This question has to do with one of the ...