The general idea behind the design of this http server is that interacting with it should be fundamentally an interaction with Lisp objects. Instead of a read-eval-print loop it's a submit-request - eval - generate-html loop.
The source code is available at http://kevin.casa.cavewallarts.com/LISP/http.lisp and is distributed under the terms of the GPL.
We are a UK-based software development consultancy specialising in bespoke internet applications. Here are some examples of our services:
We work with small and medium enterprises, delivering everything from small web sites to web applications that serve thousands of people every day.
syntax-rules that most Scheme implementations include. It is quite simple relative to its power. But if you want to start making macros as quickly as possible, especially if you just want to get call-by -reference, -name or -need semantics, you can use the following even simpler (but less powerful) system. Just load the definition provided at the end into any Scheme implementation that has syntax-rules. ; Define a simple macro to add a value to a variable. ; (define-simple-syntax (+= variable value) (set! variable (+ variable value))) ; Use it. ; (define v 2) (+= v 7) v ; => 9For a fixed number of arguments followed by an unknown number of arguments we use
... after a single argument to represent the unknown number (possibly zero) of arguments. For example, let's revise our definition of += to allow zero or more values to be added: ; Define a simple macro to add a zero or more values to a variable ; (define-simple-syntax (+= variable value ...) (set! variable (+ variable value ...))) ; Use it ; (define v 2) (+= v 7) v ; => 9 (+= v 3 4) v ; => 16 (+= v) v ; => 16Simple-syntax allows more advanced handling of arguments based on their structure: you can require a certain structure and rearrange the components. The definition of for is a good start (though it doesn't actually rearrange any components). But if you start using structured arguments seriously you may need to read about patterns and templates in
syntax-rules. ; Syntax for defining macros in a simple style similar to function definiton, ; when there is a single pattern for the argument list and there are no keywords. ; ; (define-simple-syntax (name arg ...) body ...) ; (define-syntax define-simple-syntax (syntax-rules () ((_ (name arg ...) body ...) (define-syntax name (syntax-rules () ((name arg ...) (begin body ...)))))))
s7 is a Scheme implementation intended as an extension language for other applications, primarily Snd and Common Music. It exists as just two files, s7.c and s7.h, that want only to disappear into someone else's source tree. There are no libraries, no run-time init files, and no configuration scripts. It can be built as a stand-alone interpreter (see below). s7test.scm is a regression test for s7. A tarball is available: ftp://ccrma-ftp.stanford.edu/pub/Lisp/s7.tar.gz.
s7 is the default extension language of Snd and sndlib (http://ccrma.stanford.edu/software/snd/), and Rick Taube's Common Music (commonmusic at sourceforge). There are X, Motif, Gtk, and openGL bindings in libxm (in the Snd tarball, or at ftp://ccrma-ftp.stanford.edu/pub/Lisp/libxm.tar.gz). If you're running s7 in a context that has getenv, file-exists?, and system (Snd for example), you can use s7-slib-init.scm to gain easy access to slib (this init file is named "s7.init" in the slib distribution).
Although it is a descendent of tinyScheme, s7 is closest as a Scheme dialect to Guile 1.8. I believe it is compatible with r5rs: you can just ignore all the additions discussed in this file. It has full continuations, dynamic-wind, sort!, error handling, ratios and complex numbers, define-macro, keywords, hash-tables, block comments, threads, multiprecision arithmetic for all numeric types, generalized set!, format, define*, and so on. It does not have syntax-rules or any of its friends, and it does not think there is any such thing as an "inexact integer".
Now Avg Turnover 1956 1824 Op Profit 70 100 EV/Sales 0.18 0.40 PE 5.0 11.0 EPS 11 10.8
(defmacro aif (a b c)You may need to
`(let ((it ,a))
(if it ,b ,c)))
(aif #f 2 3) ; returns 3
(require mzlib/defmacro)
Posts
All Comments
