Geometry.Net - the online learning center
Home  - Basic_S - Scheme Programming Bookstore
Page 3     41-60 of 125    Back | 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. Simulation of decentralized planning in two Danish organizations using the decomposition scheme from linear programming (Skrifter fra Institut for historie ... universitet : Samfundsvidenskab ; nr. 37) by John Christensen, 1976
  2. Simply Scheme - 2nd Edition: Introducing Computer Science by Brian Harvey, Matthew Wright, 1999-08-27
  3. Tolerance representation scheme for a three-dimensional product in an object-oriented programming environment.: An article from: IIE Transactions by Utpal Roy, Ying-Che Fang, 1996-10-01
  4. Recueil de petits problèmes en Scheme (SCOPOS) by L. Moreau, C. Queinnec, et all 1999-09-15
  5. Pc Scheme to Accompany Appleby: Programming Languages:paradigm and Practice by Hull, 1991
  6. A radomization scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (DIMACS technical report) by Ilan Adler, 1989
  7. A semantic algebra for logic programming (Technical report / Computer Science Dept., Indiana University) by Mitchell Wand, 1983
  8. Prototyping Data Flow by translation into Scheme (Technical report / Computer Science Dept., Indiana University) by Pee-Hong Chen, 1983
  9. Designing a majorization scheme for the recourse function in two-stage stochastic linear programming (Technical report / Dept. of Computer Science and Engineering, Southern Methodist University) by José H Dulá, 1992
  10. LOG(F): A new scheme for integrating rewrite rules, logic programming and lazy evaluation (Report. University of California, Los Angeles. Computer Science Dept) by Sanjai Narain, 1987
  11. Linear Programming and Genetic Algorithm Based Optimization for the Weighting Scheme of a Value Focused Thinking Hierarchy
  12. Exploring Computer Science with Scheme (Undergraduate Texts in Computer Science) by Oliver Grillmeyer, 1998-10-30
  13. Lisp in Small Pieces by Christian Queinnec, 2003-12-04
  14. PC Scheme: User's Guide and Language Reference Manual - Trade Edition by Texas Instruments, 1990-05-29

41. Scheme-faq-programming
See The scheme programming Language, Third Edition by Kent Dybvig, It can take almost any R5RScompliant Scheme program and perform a partial evaluation

42. Envision: Scheme With Pictures
An extension of the scheme programming language to support research in computer vision.
Envision: scheme with pictures
Daniel E. Stevenson and Margaret M. Fleck This document describes an implementation which still being debugged. We hope for an alpha release in the near future. However, please don't expect the same quality control you might expect in a finished product. This document describes Envision, an extension of the Scheme programming language to support research in computer vision. It includes high-level discussion, a user reference manual, example code, and directions on how to obtain and install a copy of the language. A paper on Envision appeared in the 1997 Usenix Conference on Domain-Specific Languages ( postscript ), pp. 271-284.
What is Envision?
Computer vision algorithms are notoriously difficult to implement, read, maintain, adapt, and share. This slows the progress of research in computer vision and discourages other computer scientists from using techniques developed in computer vision. We have developed a solution to this problem, where previous researchers have failed , by combining insights from computer vision and programming language design. Envision improves computer vision programming in two ways.

43. - Portal To Lehalle Family
A version of AWK in the scheme programming language. It goal is to offer the same features as awk to scheme programmers.
Home page of Scawk
Scawk is a port of awk to scheme. The implementation of scheme used is siod, but it is planned to extend scawk to other scheme implementations. The interressant point with siod is that a scheme file can be compiled into an executable one. So I use scawk as an exec file for WinNT (scawk.exe). I tied to give to scawk all the features of awk. It is not completed actually, but I think scawk has enough functions to be used. Actually I use scawk instead of awk for a very large number of applications. The point is that I have not actually a CWEB-like application to use with scawk, but I work on it. The use of awkweb is the only point that makes me prefer awk to scawk sometimes. You can download the full version 1.0 of scawk here (including binaries for WinNT). You can read the documentation (pdf format) here Links :
  • awk FAQ
  • siod
  • scheme
Here is an example of scawk file : ; contants : (define *example* 0) (define *classic* 1) (define *paragra* 2) (define *section* 3) (define *nothing* 4) (define section-s '( )) (define paragra-s '( )) (define example-s '( )) (define replace-strings '( ( ))) (define *nbsp* ; I cut this line for HTML pretty printing reasons : (define head-and-foot '( ; global variables : (define current-type *nothing*) (define special-end #f) (define (*begin* ) (display (car head-and-foot)) ) (define (*end* ) ; do not forget to close current env type : ; and write the foot (display (cadr head-and-foot)) )

44. IU Programming Languages Research
The scheme programming Language, Third Edition The entire text, online. Documentation can be found in either The scheme programming Language or The
IU Programming Languages Research
Current programming language research at IU explores a variety of semantic and pragmatic issues and their relation to other areas of theory and application. The work of Kent Dybvig, Dan Friedman, Amr Sabry, and Chris Haynes focuses on functional, object-oriented, dynamic, and symbolic programming mechanisms, often expressed via extensions and derivatives of the Scheme programming language. This work often involves formal methods of static program analysis, such as partial evaluation, abstract interpretation, and type systems. Through such methods, and imaginative engineering, one hopes to combine expressive abstraction mechanisms and efficient execution. A number of faculty have interests that tie programming language research with other areas of research.
  • Dennis Gannon explores aspects of programming language design related to parallel and scientific computation.
  • Steve Johnson uses transformation techniques developed for programming languages in the formal derivation of hardware systems
  • Daniel Leivant has worked on logics of programs, and on applicative programming languages that capture computational complexity classes.

45. Scheme Standards Documents
From the Scheme FAQ. IEEE P1178 is IEEE Standard 11781990, IEEE Standard for the scheme programming Language , published by IEEE in 1991.
Scheme Standards documents
This area contains various documents from the RNRS Authors. It does not contain the IEEE standard document (P1178), as that document is not freely distributable. From the Scheme FAQ: IEEE P1178 is IEEE Standard 1178-1990, "IEEE Standard for the Scheme Programming Language", published by IEEE in 1991. ISBN 1-55937-125-0. It is now also an ANSI standard. It may be ordered from IEEE by calling 1-800-678-IEEE or 908-981-1393 or writing IEEE Service Center, 445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, and using order number SH14209 ($28 for IEEE members, $40 others).
  • The summary of the work of the task force appointed to study Scheme compatiblity with Dylan (DYLAN.txt)
  • Jonathan Rees' The Scheme of Things article describing the RNRS Authors' meeting in San Francisco, June 1992 ( . The LaTeX source is also available (june-92-meeting.tar.gz)
  • The R3RS document ( . The LaTeX source is also available (r3rs.tar.gz)
  • The R4RS document (
  • 46. Scheme Programming - OFSET
    scheme programming. Hilaire Fernandes; 200506-09 2154. Accueil Documentation about Dr. Geo Get Dr. Geo Participate to the development Scheme
    PROJECTS ...
    Scheme programming
    Accueil Documentation about Dr. Geo Get Dr. Geo ... Scheme programming
    What is Scheme?
    OFSET , Mont-de-Marsan, Landes, Europe
    Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved.

    47. The Lisp And Scheme Programming Languages
    The Lisp and scheme programming languages. Tech Computer Center logo Scheme is a recent language in the Lisp family that is very popular for instruction
    Next Previous Index TCC Help System ... NM Tech homepage
    The Lisp and Scheme programming languages
    Lisp dialects
    Lisp , an acronym for Lis t P rocessing, is simultaneously one of the most modern and one of the oldest and most venerable of programming languages. Its strengths are in its clear, simple structure and its great flexibility. It is often used in research and development, yet it has also been used for huge commercial packages (such as Interleaf
    Scheme is a recent language in the Lisp family that is very popular for instruction and real-world applications.
    • We have a Scheme interprete called scm available on Linux and Sparc architectures. Please refer to the man page

    48. The Scheme Programming Language Ken Dickey An Alternate World View
    Scheme started as an experiment in programming language design by challanging IEEE Standard for the scheme programming Language , IEEE, New York, 1991,
    < low x high) ((low ... ) The semantics of LET is to evaluate the expressions in an environment extended by the names which have initial values obtained by evaluating the expressions . An example is: (let ( (a 1) (b 2) ) (+ a b) ), which binds the value 1 to a, 2 to b and then evaluates the expression (+ a b). LET is syntactic sugar for lambda binding: ( (lambda ( ...) ; before ; rewrites to ((lambda ( ) ((or ...) ;=> (let ( (temp ) ) (if temp temp (or ...)) ) ) ) ) Form: (and ) ((and ...) ;=> (if (and ...) #f) )) ) ) Forms: (let ( ( ...) (let < n 2) accum (loop (- count 1) (* count accum)) Semantics: LET evaluates the s in the enclosing environment in some unspecified order and then extends the environment by binding the values to the s and evaluates the expressions from left to right, returning the value of the last expression as the value of the LET. LET can be thought of as a "parallel assignment". Note that the value of B in the first example depends on the value of A in the outer environment. The second form is known as NAMED LET and allows recursion within the let form. For the example above, the call to LOOP acts as a goto which rebinds the ...) ;=> ((lambda (

    49. Advanced Scheme Programming And Implementation *
    After a quick review of the basic features of the scheme programming language, The scheme programming Language ANSI Scheme by R. Kent Dybvig,
    CS 491/591: Advanced Scheme Programming and Implementation *
    Instructor: Lance Williams
    Time: TR 2:00-3:15
    Location: BIOL B35
    Office Hours: Mon. 4:00-5:00, Tues. 4:00-5:00.
    Office: FEC 349C
    I'd rather write programs to write programs than write programs. -D. Sites What I cannot create I do not understand. - R. Feynman After a quick review of the basic features of the Scheme programming language, we will explore advanced language features not normally covered in CS 257. These include macros, lazy evaluation, streams, continuation passing style, and call/cc. We'll also look at the lambda calculus and the Y-combinator. The bulk of the course will focus on implementation of Scheme interpreters and compilers. Topics will include scanning, parsing, evaluation, macro-expansion, compilation, and garbage collection. Each student will write a working Scheme interpreter or compiler in a non-garbage-collected language (e.g., C). Undergraduates who have taken CS 257, and who want to learn more about Scheme and its implementation are welcome to take CS 491. Graduate students who have taken CS 257 (or have equivalent proficiency in Scheme) are welcome to take CS 591.
    The text for the course will be Scheme and the Art of Programming by George Springer and Daniel P. Friedman (MIT Press, 1989). You may purchase a copy of the text at the Engineering Copy Center which is located on the first floor of Farris Engineering Center. You might also want to look at

    50. XML MATTERS #31: SXML And SSAX -- Manipulating XML In The Scheme Programming Lan
    I feel almost the same way about Lisp and scheme programming. I can tell that it is an area filled with sophistication and intelligence, but somehow both
    Xml Matters #31: Sxml And Ssax
    Manipulating XML in the Scheme Programming Language
    David Mertz, Ph.D.
    Parenthesizer, Gnosis Software, Inc.
    October 2003
    Previous installments have looked at XML libraries for various programming languages, and with various strengths and weaknesses. The Lisp family of languages remains popular, especially in teaching and among purists. The SSAX library for Scheme is an efficient pure-functional parser; SXML is a tree library (like DOM); and related tools SXSLT and SXPath have been created to work with these. This installment looks at the advantages of parsing in a strongly functional language, and compares SSAX with libraries for other languages.
    I am awareas a factual matterthat there are connoisseurs of single-malt scotches. But given that I rarely drink alcohol at all; and when I do it in less concentrated amounts as beer or wine, I have trouble fully understanding the mindset or discourse of these connoisseurs. I feel almost the same way about Lisp and Scheme programming. I can tell that it is an area filled with sophistication and intelligence, but somehow both the Polish (prefix) notation and endless parentheses, and the fervent semantic eshewal of a distinction between code and data, continue to feel alien to me. Nonetheless, I have enough of a fascination that I want to see how these languages approach XML processing.

    51. The Schememonster's Friends: Some Scheme Related Links
    The scheme programming Language Standardization Experience. Implementations. Implementations Scheme Implementations (The Internet Scheme
    Some Scheme Related Links
    Front Page Our purpose Projects The Schememonster ... Contact Info
    General Documentation Literature Tutorials, manuals and references Essays etc. Implementations

    52. Re: Scheme Programming Reference
    There are some excellent text s, eg Dybvig s The scheme programming Language that make it accessible to even us cookbook programmers (not just guru
    <-prev Thread next-> <-prev ... List Home
    Re: Scheme Programming Reference
    Subject : Re: Scheme Programming Reference
    Date : Tue, 22 Jun 1999 12:40:51 -0500
    Current Thread

    53. Scheme Programming Reference
    references to a readily available introduction to scheme programming. As it happens, a document of this type exists The scheme programming language,
    <-prev Thread next-> <-prev ... List Home
    Scheme Programming Reference
    Subject : Scheme Programming Reference
    Date : Mon, 21 Jun 1999 16:48:52 -0400
    Hi All, Looking over the various DSSSL sites, I haven't come across any references to a readily available introduction to Scheme programming. As it happens, a document of this type exists: The Scheme programming language, by Ken Dickey, Interestingly enough, the author states: "Scheme is a small, exceptionally clean language which is, very importantly, fun to use." This is in contrast to many descriptions of DSSSL, which frequently seem to start out by saying "DSSSL style sheets are based on Scheme, this dialect of Lisp, and you're really going to be confused ..." Nothing like encouraging folks at the outset. Best regards, Ralph E. Ferris HyBrick Program Manager Fujitsu Software Corporation HyBrick: DSSSList info and archive:

    54. Schemers Inc. - Other Scheme Books
    The authors use the programming language Scheme and a menu of interesting foods to This revised edition of The scheme programming Language provides an
    Other Scheme Books
    Schemers Inc. is pleased to announce the availability of the following Scheme-related texts: "The Little Schemer" "The Seasoned Schemer" "Structure and Interpretation of Computer Programs", 2nd edition "Essentials of Programming Languages", 1st edition ... Other books
    "The Little Schemer"
      [Fourth Edition]
      by Daniel P. Friedman and Matthias Felleisen
      Drawings by Duane Bibby
      Foreword by Gerald J. Sussman
    Schemers Recommendation
    "The Little Schemer" and "The Seasoned Schemer" would prove popular as companion texts for any complete introductory course in Computer Science. The notion that thinking about computing is one of the most exciting things the human mind can do sets both "The Little Schemer" (formerly known as "The Little LISPer") and its new companion volume, "The Seasoned Schemer", apart from other books on LISP and its dialects. The author's enthusiasm for their subject is compelling as they present abstract concepts in a humorous and easy-to-grasp fashion. Together, these books will open new doors of thought to anyone who wants to find out what computing is really about. "The Little Schemer" introduces computing as an extension of arithmetic and algebrathings that everyone studies in grade school and high school. It introduces programs as recursive functions and briefly discusses the limits of what computers can do. The authors use the programming language Scheme and a menu of interesting foods to illustrate these abstract ideas. "The Seasoned Schemer" introduces the reader to additional dimensions of computing: functions as values, change of state, and exceptional cases.

    55. Scheme Programming With MIT/GNU Scheme
    Information on programming in Scheme, in particular using MIT/GNU Scheme.
    Scheme Programming with MIT/GNU Scheme
    Scheme is a programming language. It is a dialect (derivative) of Lisp . It was originally developed by Guy Steele and Gerald Sussman in 1975. It is a functional programming language and has lexical scoping tail-recursion applicative order reduction first-class functions, first-class continuations garbage collection and uses lambda calculus References above are to the Free On Line Dictionary of Computing ( FOLDOC
    Using MIT/GNU Scheme

    56. The SCHEME Programming Language
    ShoHuan Simon Tung, Interactive modular programming in Scheme, ACM SIGPLAN Lisp Pointers, vV n.1, p.86-95, Jan. 1992 GL Lovegrove , GJ Curtis , RA Farrar

    57. The Scheme Programming Language
    Scheme is a general purpose programming language descended from Algol and Lisp. This revised edition of The scheme programming Language provides an

    58. Class 2: Scheme Programming Primer
    scheme programming Primer. Class 2 Section 1.1. Contents Most scheme programming constructs seem quite straightforward, but there are certain
    CprS376 Schedule
    CprS376 Class 1

    CprS376 Class 3
    Scheme Programming Primer Class 2 - Section 1.1
    Getting Started Reading through the following transcript should give you a quick introduction to the interactive nature of Scheme programming and a number of the most fundamental and useful scheme programmming constructs. Note that this transcript was prepared using a different scheme interpreter, so you may see slight variations when using Petite Chez Scheme. ) ... (else ( >>> (lambda (obj) (cond ((symbol? obj) 'symbol) ((number? obj) 'number) (else 'something-else))) # Notions of Equivalence in Scheme Most scheme programming constructs seem quite straightforward, but there are certain subtleties involved in scheme's notions of equivalence and equality. ;; ;; = = = = = FLAVORS OF EQUALITY = = = = = ;; for numbers >>> (= 45 (+ 40 5)) #t ;; for symbols >>> (eq? 'a (car '(a b c))) #t ;; for numbers, symbols, booleans >>> (eqv? #f (= 2 3)) #t ;; for all of the above, and lists as well >>> (equal? ( >> (equal? '(a b c d) '(a b c 3)) #f ; = = = = = SUMMARY OF EQUIVALENCE = = = = = ; the operators: =, eq?, eqv?, equal? ; = tests sameness of numbers ; eq? tests sameness of symbols ; note: each application of cons constructs a new cell ; (eq? (cons 1 2) (cons 1 2)) returns #f! ; eqv? tests sameness of numbers, symbols and booleans ; (as well as vectors, strings, and chars) ; equal? is a universal test for sameness ; (tests all of the above and lists as well) ; note: (equal? (cons 1 2) (cons 1 2)) returns #t! ; the difference is mainly one of efficiency ; use the predicate designed for the task at hand

    59. Class 1: Scheme Programming In A Linux Environment
    In order to enjoy programming with Scheme on a machine running the Linux operating sytem, Exercise Learn to Use Emacs for Your scheme programming
    CprS376 Schedule
    CprS376 Class 2
    Scheme Programming in a Linux Environment Class 1 - Chapter 1
    In order to enjoy programming with Scheme on a machine running the Linux operating sytem, you will first need to obtain an account on such a machine (see Prof. Parrish) and then you will need to become familiar with a few basic operations:
    • Logging in (login name and password)
    • Filesystem commands (pwd, ls, ls -l, mkdir, cd, rmdir, cp, mv, rm)
    • Using the emacs editor
    • Configuring emacs to facilitate programming with Petite Chez Scheme
    • (Optional) Configuring bash (the shell that interprets commmands) to facilitate programming with mit-scheme
    • Using zip and unzip to archive file systems and expand such archives
    • Using ftp to transfer files from one machine to another
    • Logging out

    Exercise: Use Petite Chez Scheme To Run Several Scheme Programs To invoke the scheme interpreter, type

    60. MIT/GNU Scheme
    MIT/GNU Scheme is an implementation of the scheme programming language, MIT/GNU Scheme is best suited to programming large applications with a rapid
    Top All GNU Packages MIT/GNU Scheme
    MIT/GNU Scheme - MIT/GNU Scheme programming language
    MIT/GNU Scheme is an implementation of the Scheme programming language, providing an interpreter, compiler, source-code debugger, integrated Emacs-like editor, and a large runtime library. MIT/GNU Scheme is best suited to programming large applications with a rapid development cycle.
    Web page Source tarball Version 7.7.90 (stable) released on 2004-01-01 Licensed under The GNU General Public License, Version 2 or later This is a GNU package.
    Documentation Reference manual included from ; Programmer reference in HTML at Support contacts
    Announce List Help List Help News comp.lang.scheme.c

    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 3     41-60 of 125    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | Next 20

    free hit counter