Geometry.Net - the online learning center
Home  - Basic_S - Scheme Programming Bookstore
Page 1     1-20 of 125    1  | 2  | 3  | 4  | 5  | 6  | 7  | Next 20
A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

         Scheme Programming:     more books (88)
  1. The Scheme Programming Language, 3rd Edition by R. Kent Dybvig, 2003-10-01
  2. Scheme and the Art of Programming by George Springer, Daniel P. Friedman, 1989-10
  3. Scheme Programming Language, The: ANSI Scheme by R. Kent Dybvig, 1996-03-18
  5. Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science) by Jon Pearce, 1997-12-12
  6. Programming in Scheme: Learn Scheme Through Artificial Intelligence Programs by Mark Watson, 1996-04-25
  7. How to Design Programs: An Introduction to Programming and Computing by Matthias Felleisen, Robert Bruce Findler, et all 2001-02-12
  8. Programming in Scheme: Trade Edition by Michael Eisenberg, 1990-05-29
  9. Optimizing Schemes for Structured Programming Language Processors (Ellis Horwood Series in Computers and Their Applications) by Tatsuo Tsuji, 1991-01
  10. IEEE Standard for the Scheme Programming Language/Std 1178-1990 by IEEE, Ieee Computer Society, et all 1991-05
  11. Introduction to Programming Languages: Principles, C, C++, Scheme and Prolog by Yinong Chen, Wei-Tek Tsai, 2006-08-01
  12. Central European Functional Programming School: First Central European Summer School, CEFP 2005, Budapest, Hungary, July 4-15, 2005, Revised Selected Lectures (Lecture Notes in Computer Science)
  13. The Little Schemer - 4th Edition by Daniel P. Friedman, Matthias Felleisen, 1995-12-21
  14. An Introduction to Scheme by Jerry D. Smith, 1988-05

1. The Scheme Programming Language
Main page at MIT, Scheme s birthplace; short list of implementations, some general documentation, information on the MIT Scheme implementation,
Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman . It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme.
MIT/GNU Scheme
MIT/GNU Scheme is a complete programming environment that runs on many unix platforms, as well as Microsoft Windows and IBM OS/2. It features a rich runtime library, a powerful source-level debugger, a native-code compiler, and an integrated Emacs-like editor.
  • MIT/GNU Scheme is available for Intel-architecture (x86) machines running GNU/Linux, FreeBSD, IBM OS/2 or Microsoft Windows 9x/ME/NT/2000/XP. NWWYW: 6.001 LA Manual how to be a Lab Assistant for the introductory programming course at MIT.

2. The Scheme Programming Language, 2nd Edition
Of R. Kent Dybvig's reference manual. Describes R5RS Scheme in a style similar to K R Online fulltext version.

Prentice Hall, Inc.

A Simon and Schuster Company
Upper Saddle River, NJ 07458 ISBN: 0-13-454646-6
Library catalog: QA76.73.S34D93
Table of Contents

3. The Scheme Programming Language
PLT Scheme is an umbrella name for a family of implementations of the scheme programming language. Pseudoscheme embeds Scheme in Common Lisp.

4. Welcome To!
A collection of resources for the Scheme language. The place to go to get comprehensive, upto-date information on all aspects of Scheme

5. The Scheme Underground
software tools using a modern programming language. Our goal is to build such a system using Scheme 48, an ultraportable Scheme implementation

6. The Scheme Programming Language, 3rd Edition
The scheme programming Language. Third Edition. R. Kent Dybvig. Illustrations by JeanPierre Hébert. Table of Contents. Preface Chapter 1. Introduction
The Scheme
Programming Language Third Edition R. Kent Dybvig
Table of Contents

7. DrScheme
Full scheme programming environment for Macintosh, many Unixes, Windows. Has module and object systems, platformindependent graphics. Ideal for

8. Welcome To The SICP Web Site
An appendix summarizes the scheme programming language as used in the text, showing at what point in the text each element of Scheme is

9. Scheme Programming
A whole handfull of Scheme programs and applications, including Treaps ( A sorted dictionary data structure based on randomized search trees.
previous next contents top
Scheme Hash
XML and Scheme
Consistent or conformant Scheme implementations of W3C Recommendations: XML Infoset, XPath query language and a small subset of XSL Transformations. An XML document and operations on it can be expressed in Scheme and regarded either as data structures or as code.
  • Tools: SSAX, SXML, SXPath, SXSLT
    • A functional-style framework to parse XML documents
    • SXML specification
    • SXPath SXML query language, XPath implementation
    • SXML traversals and transformations
  • Applications, Examples, Sample Code
    • Authoring of web pages, XML documents and (PDF) papers
    • SXML as a higher-order, more expressive markup language
    • Writing LaTeX/PDF mathematical papers with SXML
    • Joint processing of two immutable SXML documents with update cursors
    • SXML as a normalized database
    • Literate XML/DTD programming
    • Complete examples of stream-wise (SAX) and DOM parsing with SSAX
    • parsing and unparsing of a namespace-rich XML document: DAML/RDF
    • Permissive parsing of perhaps invalid HTML
    • On parent pointers in SXML trees
    • XML pull parsing and SSAX
    • SSAX parsing with limited XML doctype validation and datatype conversion
    • Complete examples of practical (context-sensitive) SXML Transformations
  • SXML Papers and Presentations
  • Evaluating SXML
  • SOAP 1.2 and SXML

10. The Scheme Programming Language, 2nd Edition
Formal Syntax of Scheme Summary of Forms Index. R. Kent Dybvig The scheme programming Language, Second Edition 1996. Electronically

11. Scheme Programming: Miscellanea
An example of a monadic programming in Scheme that juxtaposes Haskell code for a particular state monad with the corresponding Scheme code.
previous next contents top
Little Oddities
Lazy evaluation and lazy recursion in flattening of a (cyclic) list
A non-traditional way to flatten a list, by infecting it with a lazy virus . The algorithm runs in truly constant working space. Each atomic element of the original list is accessed exactly once; the elements are not cloned, duplicated or even moved in memory. The flattener is properly tail-recursive and tail-infective . It is also capable of handling cyclic lists, an "infinite" data structure.

12. STk Home Page
A free R4RS Scheme interpreter which can access the Tk graphical package.

13. The Scheme Programming Language
scheme programming language Wikipedia, the free encyclopediaPLT Scheme is a suite of Scheme programs for Windows, Mac, and Unix platforms including an The scheme programming Language by R. Kent Dybvig.
The Scheme Programming Language
Click here to start
Table of Contents
The Scheme Programming Language Scheme philosophy Scheme C vs. Scheme expressions Prefix vs. infix Nested expressions 1 Nested expressions 2 Nested expressions 3 Nested expressions 4 Nested expressions 5 Evaluating arguments Types More types What’s in a symbol? Some “literals” evaluate to themselves Symbols evaluate by variable lookup define special form Lists evaluate by procedure application* Special forms List evaluation Creating symbol value Suppressing evaluation quote special form Quoting Forcing evaluation with eval The Lambda Calculus Creating procedures with the lambda special form A moment for syntax Naming a procedure Shorthand for procedure definition Procedures vs. variables Conditionals: if special form C vs. Scheme C vs. Scheme eq? procedure tests for identity equality Recursion Linear recursive process Lists are made of cons cells cons cells and the cons procedure List syntax shorthand Beware the arrow: Another look at lists car, cdr, and friends Nested lists Do not try this at home our-list-ref procedure our-list-ref trace Linear iterative process Contrast the inductive steps Tail-recursion our-list-ref tail recursion Re-binding is NOT assignment Iterative version of factorial Iterative factorial trace Nested procedure defines Factoring out common sub-expressions let special form Scope is visibility let bindings happen in parallel Bad let bindings let* special form More about conditionals: cond special form cond example Short-circuiting and, or special forms

14. Revised(4) Scheme - Table Of Contents
Revised(4) Report on the Algorithmic Language Scheme. WILLIAM CLINGER AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C. T. HAYNES

15. Talk:Scheme Programming Language - Wikipedia, The Free Encyclopedia
Scheme is a functional programming language and a dialect of Lisp. The scheme programming language was born from an attempt in 1975 to explicate
Talk:Scheme programming language
From Wikipedia, the free encyclopedia.
Hygienic macros
Hi The following text was found in Hygienic macro , but I don't know enough about Scheme to integrate properly. Please could someone else handle this: Scheme macros
  • Transforms derived expression types into primitive expression types. May use macros if we want to ommit Scheme?s call by value evaluation
DJ Clayworth 15:28, 21 Nov 2003 (UTC) It is unfortunate that hygienic macro redirects to Scheme programming language where there's only little information on the subject. MH 15:29, 16 Mar 2004 (UTC) Most of the advantages listed stem from more general design decisions than that of Scheme in particular:
  • Concerning syntax it's a feature of all Lisps (well, except for the very first design of Lisp which did not use S-exprs) Concerning the functional aspect, it is as the name suggests common to all functional languages.
I've therefore added in the section what these advantages stem from. Sam 00:15, 11 Aug 2004 (UTC)

16. Welcome To Schemers Inc.
Publishes and carries excellent educational materials, including books, using the scheme programming language. Has Windows and Macintosh Scheme

17. The Scheme Programming Language
This site publishes educational materials using the scheme programming language and provides Windows and Macintosh Scheme interpreters.
The Scheme Programming Language
Click below to go directly to a specific section:
Significant Language Features Areas of Application Sample Programs ... Acknowledgements
Scheme started as an experiment in programming language design by challenging some fundamental design assumptions. It emerged from MIT in the mid-1970's. It is a dialect of the Lisp Programming Language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. Originally called Schemer, it was shortened to Scheme because of a 6 character limitation on file names. Scheme is a small, exceptionally clean language which is fun to use. The language was designed to have very few, regular constucts which compose well to support a variety of programming styles including functional, object-oriented, and imperative.
Significant Language Features
Areas of Application
Scheme is currently gaining favor as a first programming language in universities and is used in industry by such companies as DEC, TI, Tektronix, HP, and Sun.
Sample Programs

18. Bigloo Homepage
System with one goal enable Schemebased programming style where C(++) is usually needed; makes Scheme practical via features found in most

19. The Scheme Programming Language: Substring Search
The scheme programming Language. Substring Search Example Program This program takes a string (the pattern) and returns a function which takes a string
The Scheme Programming Language
Substring Search Example Program
Click below to go directly to a specific section:
Source Code Program Notes
This program takes a string (the pattern) and returns a function which takes a string (the target) and either returns #f or the index in the target in which the pattern first occurs as a substring.
Source Code
Program Notes
This program was based on a very fast substring search algorithm, Daniel M. Sunday, CACM v33, #8, August 1990. It was written by Ken Dickey, August 6, 1991. It contains Gambit-specific compile options. Last modified: 01:30 PM on 11/25/1996

20. STeXme
Allows to manipulate TeX internals using the scheme programming language. Sourceforge project page and guides.
The TeX extension "sTeXme" allows to manipulate TeX internals using the Scheme programming language. sTeXme = TeX + Scheme. Documentation: Download: from SourceForge The [La]TeX macro language was a great development when it appeared, but now it is too out-of-date. Programming in TeX is a fun, but more often it is a pain. As it seems for me, only very few people can write [La]TeX macros, but a lot of people would like doing it (like me, for example). This is the problem. One of the solutions is to provide another scripting language for TeX. That's what is the goal of the sTeXme project. It should provide the Scheme programming language as a TeX scripting language. At the moment I've done a proof of concept. I've tested that Scheme code can be executed from TeX and that Scheme code can access TeX internals (getting a string from the TeX string pool, getting a macro definition as the Scheme list). Even in it's early state you can find sTeXme useful. I've written a Scheme procedure which recursively dumps a macro definition. For example:

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

Page 1     1-20 of 125    1  | 2  | 3  | 4  | 5  | 6  | 7  | Next 20

free hit counter