Sketchy LISP
Volume 2 - Reference
  Copyright (C) 2006
Nils M Holm

Buy a printed copy

Contents

1 Summary
2 Programs
2.1 Program Execution
2.2 Expressions
3 Reduction Rules
3.1 Introduction
3.2 Atoms
3.3 Lists
3.4 Primitive Functions
3.5 Lambda Functions
3.6 Variadic Lambda Functions
3.7 Empty Lists
3.8 Other Lists
4 Primitive Functions
4.1 Introduction
4.2 Bindings and Definitions
4.2.1 bottom
4.2.2 define
4.2.3 lambda
4.2.4 letrec
4.2.5 package
4.2.6 quote
4.2.7 recursive-bind
4.2.8 void
4.3 Control
4.3.1 and
4.3.2 apply
4.3.3 begin
4.3.4 call/cc
4.3.5 cond
4.3.6 or
4.4 Composition and Decomposition
4.4.1 car
4.4.2 cdr
4.4.3 cons
4.5 Predicates
4.5.1 char?
4.5.2 eq?
4.5.3 null?
4.5.4 number?
4.5.5 pair?
4.5.6 procedure?
4.5.7 string?
4.5.8 symbol?
4.6 Type Conversion
4.6.1 char->integer
4.6.2 integer->char
4.6.3 integer->list
4.6.4 list->integer
4.6.5 list->string
4.6.6 string->list
4.6.7 string->symbol
4.6.8 symbol->string
4.7 Char Functions
4.7.1 char-ci<?
4.7.2 char-ci=?
4.7.3 char<?
4.7.4 char=?
4.8 Numeric Functions
4.8.1 n+
4.8.2 n-
4.8.3 n<
4.9 String Functions
4.9.1 string-append
4.9.2 string-length
4.9.3 string-ref
4.9.4 substring
4.10 Input/Output
4.10.1 delete-file
4.10.2 display
4.10.3 eof-object?
4.10.4 read
4.10.5 read-char
4.10.6 with-input-from-file
4.10.7 with-output-to-file
4.10.8 write
5 Pre-defined Symbols
5.1 **
6 Library Functions
6.1 Type Predicates
6.2 List Functions
6.3 Logic and Combinatoric Functions
6.4 Numeric Functions
6.5 Char Functions
6.6 String Functions
6.7 Input/Output Functions
7 Differences to Scheme
7.1 First Class Environments in Closures
7.2 Functions
7.3 Dotted Pairs
8 Meta Commands
8.1 Entering Meta Commands
8.2 :A - Arrow Mode
8.3 :C - Load Conditionally
8.4 :D - Dump Image
8.5 :G - Garbage Collection
8.6 :K - Print Closures
8.7 :L - Load Program
8.8 :Q - Quit
8.9 :S - Statistics
8.10 :T - Trace Mode
8.11 :V - Version and License
8.12 :W - Wrap Column
8.13 :Y - Dump Symbols
References
Index