|
|
|
Nils M Holm
|
| Email: |
Log in to view email |
| Address: |
Robert-Bosch-St 2 |
| |
Hemsbach,
69502
|
| |
Germany |
|
|
|
|
 |
Sketchy LISP
Sketchy LISP is an introduction to functional programming in Scheme.
Functional programming is an approach that focuses on the evaluation
of expressions. Programs are formed by combining functions. Most
functions are free of side effects which allows to examine programs
formally and prove properties of algorithms.
This tutorial provides a step-by-step introduction to functional
programming in Scheme. It covers various aspects of the language like
data types, conditions, recursion, list processing, lexical scoping,
closures, function definitions, dynamic typing, etc. By means of
numerous examples of varying complexity, it takes the reader on an
entertaining and informative tour through the language.
Print: $12.00
Download: $1.00
|
|
|
 |
Scheme 9 from Empty Space
A Guide to Implementing Scheme in C.
Scheme 9 from Empty Space reproduces the completely self-contained and
heavily commented C and Scheme source code to an interpreter for a broad
subset of the Scheme programming language. By means of extensive annotations,
examples, and numerous figures, it answers a lot of questions about
crafting an interpreter, including:
- How does automatic memory management work?
- How is macro expansion implemented?
- How do lexical scoping and dynamic scoping work?
- How is arbitrary precision arithmetics implemented?
- How does tail call elimination work?
- How are Scheme procedures called from C?
Print: $13.00
Download: $1.00
|
|
|
 |
zen style programming
The primary purpose of programs is to be understood by human
beings.
Part 1 of this book introduces the concept of functional
programming and describes a purely symbolic, minimalistic dialect
of Scheme that is designed to be comprehensible.
Part 2 applies symbolic programming techniques to
problems of varying complexity. Topics of this part range
from functions for sorting or permuting lists to "lazy"
data structures, regular expression matching, formal language
translation, and declarative programming.
Part 3 implements the abstraction layer that is necessary
for solving problems in an abstract way on a concrete computer. It
reproduces the complete annotated source code for an interpreter of
symbolic Scheme and delivers an example of clear and readable C code.
The book contains the full source code to a compiler, a
meta-circular interpreter, a logic programming system, and to
the language that is used to implement all of these.
Print: $20.00
Download: $1.00
|
|
|
 |
Logic Programming in Scheme
- What are goals and queries?
- Why is negation hard in logic programming?
- What is cutting?
- How do I solve logic puzzles?
- How is logic programming implemented?
This booklet answers all these questions in merely 40 pages of terse
prose and lots of examples. If you are into Scheme programming and
always wanted to know how to integrate the power of logic programming
into your code, this text is for you.
Print: $9.00
Download: $1.00
|
|
|
 |
Lightweight Compiler Techniques
Although compiler construction is a well-studied part of
computer science, there are only few books that cover both
theory and practical compiler crafting in-depth.
This book is here to fill this niche. It explains compiler
construction in simple terms and by means of practical examples,
but without avoiding the fundamental theory.
It does not stop where other books do, and takes you on a tour
through the whole compilation process.
Print: $17.00
Download: $1.00
|
|
|
|
|
|
|
![[]](http://static.lulu.com/images/persuasion/footer/line.gif?20090625163709)
