Geometry.Net - Basic_S: Scheme Programming


Home - Basic_S - Scheme Programming

e99.com Bookstore

Images

Newsgroups

1-20 of 119 1 | 2 | 3 | 4 | 5 | 6 | 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 (100)

The Scheme Programming Language, 4th Edition by R. Kent Dybvig, 2009-09-30
Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science) by Jon Pearce, 1997-12-12
The Scheme Programming Language,ANSI Scheme by R. Kent Dybvig, 1996-03-18
Programming in Scheme: Trade Edition by Michael Eisenberg, 1990-05-29
Programming in Scheme: Learn Scheme Through Artificial Intelligence Programs by Mark Watson, 1996-04-25
Dynamic Programming: Foundations and Principles, Second Edition (Pure and Applied Mathematics) by Moshe Sniedovich, 2010-09-10
Optimizing Schemes for Structured Programming Language Processors (Ellis Horwood Series in Computers and Their Applications) by Tatsuo Tsuji, 1991-01
Concrete Abstractions: An Introduction to Computer Science Using Scheme by Max Hailperin, Barbara Kaiser, et all 1998-09-10
Scheme and the Art of Programming by George Springer, Daniel Friedman, 1999
An Introduction to Scheme by Jerry D. Smith, 1988-05
Scheme (Programming Language)
Scheme Programming Language
Programming Languages: Paradigm and Practice: PC Scheme Mini-Manual by Appleby, 1991-11-01
IEEE Standard for the Scheme Programming Language/Std 1178-1990 by IEEE, Ieee Computer Society, et all 1991-05

lists with details

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.
http://www.scheme.com/tspl2d/
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.
http://www.swiss.ai.mit.edu/projects/scheme/

Extractions: 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 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. The language specification: The Revised Report on the Algorithmic Language Scheme.
DrScheme
Full scheme programming environment for Macintosh, many Unixes, Windows. Has module and object systems, platformindependent graphics. Ideal for beginners; one of the major design goals is a flexible teaching environment.
http://www.drscheme.org/

Extractions: DrScheme Download DrScheme Documentation More Software Support ... HtUS DrScheme is an interactive, integrated, graphical programming environment for the Scheme MzScheme , and MrEd programming languages. DrScheme runs under Windows (95 and up), Mac OS X, and Unix/X. Download DrScheme DrScheme provides source highlighting for syntax and run-time errors, support for multiple language levels, an algebraic stepper, objects, modules, a GUI library, TCP/IP, and much more. It includes an extensive, hyper-linked help system called Help Desk, available from the Help menu. The Tour of DrScheme describes many of these features in greater detail. You can enhance DrScheme with many add-ons , including MrFlow , a static debugger, and MysterX , which adds COM support under Windows. See also Dynamic Libraries System Requirements: Windows (95 and up), Mac OS X, or Unix running the X Window System. DrScheme is useful with at least 128 MB of RAM in your computer. Installing DrScheme requires roughly 40 MB of disk space.
The Scheme Programming Language, 2/e
The scheme programming Language Second Edition. R. Kent Dybvig. The scheme programming Language has been thorougly revised and updated for the second edition.
http://www.scheme.com/tspl2ed.html

Extractions: Second Edition Prentice Hall , 1996, 250 pp., Paper. The Scheme Programming Language has been thorougly revised and updated for the second edition. The text and examples have been brought up-to-date with respect to the ANSI/IEEE standard for Scheme, the Revised^4 Report on Scheme, and the upcoming Revised^5 Report. The second edition contains a new chapter of more advanced introductory material (Chapter 3, Going Further), many new examples and exercises, and a new appendix giving the complete formal syntax of Scheme. Several of the extended examples have been updated, and three new extended examples have been added: an efficient merge sorting routine, a scheme printer, and a program that uses complex arithmetic to compute the fast fourier transform of a sequence of numbers. The chapter on syntactic extension has been rewritten to describe the new high-level macro system along with the portable and more general syntax-case macro system. The second edition is completely independent of the Chez Scheme implementation of Scheme; features specific to
PC AI - Scheme Programming Language
Contact PC AI. scheme programming Language. Glossary Link scheme programming Language. SUBMIT YOUR SITE. To Prolog Programming Language. CMU Scheme Archives. Archives of Scheme-related newsgroups
http://www.pcai.com/web/ai_info/pcai_scheme.html

Extractions: Scheme Programming Language Scheme Information on the Internet CMU Scheme Archives Archives of Scheme-related newsgroups and other information. Different Scheme Implementations and Dialects An archive of Scheme implementations and information. The Extension Language Kit (ELK) Elk is an implementation of Scheme designed as an embeddable, reusable extension language subsystem for applications written in C or C++. Free Scheme Compilers and Interpreters Free compiler site containing many languages including Scheme. The Internet Scheme Repository On-line documents, implementations, instructions, utilities, links and more. The Scheme Programming Language Find scheme resources and implementations. The Scheme Programming Language Learn about what the scheme programming language is.
The Scheme Programming Language
Scheme is a statically scoped and properly tailrecursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. implementations of the scheme programming language. Pseudoscheme embeds Scheme in Common Lisp of resources for the scheme programming language. The Schememonster's Friends is
http://www-swiss.ai.mit.edu/projects/scheme

Extractions: 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 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. The language specification: The Revised Report on the Algorithmic Language Scheme.
Scheme Programming
An archive of Scheme code Scheme Hash. XML and Scheme. Consistent or conformant Scheme implementations of W3C Recommendations XML working examples of HTML, XML, FORM, HTTP and CGI programming in Scheme
http://www.okmij.org/ftp/Scheme

Extractions: 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. Applications, Examples, Sample Code SXML Papers and Presentations CDATA #PCDATA , and ANY Evaluating SXML SOAP 1.2 and SXML
Scheme Programming
Scheme. The paper and the talk presented at the Workshop on Scheme and Functional Programming 2000 (Montreal, 17 September 2000).
http://pobox.com/~oleg/ftp/Scheme/

Extractions: 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. Applications, Examples, Sample Code SXML Papers and Presentations CDATA #PCDATA , and ANY Evaluating SXML SOAP 1.2 and SXML
The SchemeProgramming Language
The scheme programming LanguageThe scheme programming Language. Dybvig, Kent R. (1987). The scheme programming Language. Prentice Hall. Eisenberg (1988). Programming in Scheme. MIT Press.
http://www.cs.washington.edu/education/courses/341/99su/lectures/scheme/

Extractions: Click here to start The SchemeProgramming 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 Whats in a symbol? Some literalsevaluate to themselves Symbols evaluate byvariable lookup define special form Lists evaluate byprocedure application* Special forms List evaluation Creating symbol value Suppressing evaluation quote special form Quoting Forcing evaluation with eval The Lambda Calculus Creating procedures withthe lambda special form A moment for syntax Naming a procedure Shorthand forprocedure definition Procedures vs. variables Conditionals:if special form C vs. Scheme C vs. Scheme eq? proceduretests for identity equality Recursion Linear recursive process Lists are made of cons cells cons cells and thecons 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 traceLinear iterative process Contrast theinductive steps Tail-recursion our-list-ref tail recursion Re-binding is NOT assignment Iterative version offactorial Iterative factorial trace Nested procedure defines Factoring outcommon sub-expressions let special form Scope is visibility let bindings happenin parallel Bad let bindings let* special form More about conditionals:cond special form cond example Short-circuiting and, orspecial forms
The Scheme Programming Language: Paycheck Calculator.
The scheme programming Language. Paycheck Calculation Example Program. This program was found in An Introduction to Scheme by Jerry Smith, Prentice Hall, 1988
http://www.engin.umd.umich.edu/CIS/course.des/cis400/scheme/paycheck.htm

Extractions: Description Source Code Program Notes This program figures your paycheck...and that's what it's all about!! It also demonstrates the concept of abstraction in Scheme. The procedure "calc-pay" in turn calls the methods by which the employee's wages and commissions are calculated. It should be noted that the functions "commissions" and "hourly-wages" are actually passed as arguments to their calling function. <= no-hours 40) (* no-hours hourly-rate) (+(* 40 hourly-rate) (*(- no-hours 40) hourly-rate 1.5))))) ;;;;;;;;;;;;;; calc-pay ;;;;;;; (define calc-pay (lambda (formula base rate) (formula base rate))) A sample run would resemble the following: [1](commission 100 .04) 4. [2](hourly-wages 50 10) 550. [3](calc-pay commission 100 .04) 4. [4](calc-pay hourly-wages 50 10) 550. This program was found in "An Introduction to Scheme" by Jerry Smith, Prentice Hall, 1988
The Scheme Programming Language
The scheme programming Language. History. Scheme started as an experiment in programming language design by challenging some fundamental design assumptions. It emerged from MIT in the mid1970's.
http://www.engin.umd.umich.edu/CIS/course.des/cis400/scheme/scheme.html

Extractions: History 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. 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. Hello world!
Scheme Programming Language - Wikipedia, The Free Encyclopedia
scheme programming language. From Wikipedia, the free encyclopedia. The scheme programming language is a functional programming language and a dialect of Lisp.
http://en.wikipedia.org/wiki/Scheme_programming_language

Extractions: The Scheme programming language is a functional programming language and a dialect of Lisp . It was developed by Guy L. Steele and Gerald Jay Sussman in the and introduced to the academic world via a series of papers now referred to as Sussman and Steele's Lambda Papers Scheme's philosophy is unashamedly minimalist . Its goal is not to pile feature upon feature, but to remove weaknesses and restrictions that make new features appear necessary. Therefore, Scheme provides as few primitive notions as possible, and lets everything else be implemented on top of them. For example, the main mechanism for governing control flow is tail recursion Scheme was the first variety of Lisp to use lexical variable scoping (as opposed to dynamic variable scoping ) exclusively. It was also one of the first programming languages to support explicit continuations . Scheme supports garbage collection of unreferenced data. It uses lists as the primary data structure, but also has good support for arrays. Owing to the minimalist specification, there is no standard syntax for creating structures with named fields, or for doing object oriented programming , but many individual implementations have such features.
PLT Scheme
PLT Scheme. Software. Support. Learning. Publications. DrScheme. PLT is the group of people who produce PLT Scheme. DrScheme is the primary PLT Scheme implementation. PLT Scheme is an umbrella name for a family of implementations of the scheme programming language. a book about using PLT Scheme for everyday programming tasks. ( Still a work
http://www.plt-scheme.org/

Extractions: PLT Scheme Software Support Learning Publications ... HtUS PLT Scheme is an umbrella name for a family of implementations of the Scheme programming language. PLT is the group of people who produce PLT Scheme. DrScheme is the primary PLT Scheme implementation. TeachScheme! is a PLT project to turn Computing and Programming into an indispensable part of the liberal arts curriculum. How to Design Programs HtDP ) is a textbook for introductory programming that was written by several PLT members. How to Use Scheme HtUS ) is a book about using PLT Scheme for everyday programming tasks. (Still a work in progress.) MzScheme is the lightweight, embeddable, scripting-friendly PLT Scheme implementation.
Scheme Programming Language
scheme programming language. The scheme programming language is a functional programming language and a dialect of Lisp. It was developed
http://www.fact-index.com/s/sc/scheme_programming_language.html

Extractions: Main Page See live article Alphabetical index The Scheme programming language is a functional programming language and a dialect of Lisp . It was developed by Guy L. Steele and Gerald Jay Sussman in the and introduced to the academic world via a series of papers now referred to as Sussman and Steele's Lambda Papers Scheme's philosophy is unashamedly minimalist . Its goal is not to pile feature upon feature, but to remove weaknesses and restrictions that make new features appear necessary. Therefore, Scheme provides as few primitive notions as possible, and lets everything else be implemented on top of them. For example, the main mechanism for governing control flow is tail recursion Scheme was the first variety of Lisp to use lexical variable scoping (as opposed to dynamic variable scoping ) exclusively. Scheme supports garbage collection of unreferenced data. It uses lists as the primary data structure, but also has good support for arrays. Owing to the minimalist specification, there is no standard syntax for creating structures with named fields, or for doing object oriented programming , but many individual implementations have such features.
Introduction To Scheme Programming Language
The summary for this Japanese page contains characters that cannot be correctly displayed in this language/character set.
http://www.stdio.h.kyoto-u.ac.jp/~hioki/gairon-enshuu/SchemeNotes/scheme.html

Extractions: $B@$$NCf$K$OMM!9$J%W%m%0%i%_%s%08@8l$,$"$k(B $BEr@uB@0l(B $B!V(BScheme$BF~Lg!W(B $B4dGH=qE9(B K.$B%G%#%t%#%0Cx(B / $BB e2m>O(B $BLu(B $B!V(B $B%W%m%0%i%_%s%08@8l(B SCHEME $BCv8T=S8w(B, $B1W:j D.P.$B%U%j! =0l(B $BLu(B $B!V(BScheme$B H. Abelson, G.J. Sussman and J. Sussman $BCx(B " Strucuture and Interpretation of Computer Programs G.J. Sussman, H. Abelson and J. Sussman $BCx(B $BOBED1Q0lLu(B $B7W;;5!%W%m%0%i%`$N9=B$$H2r $B$J$I$N;29M=q$d!$(BWWW$B$N%j%=! ... SchemeSpace $B3$30(B $B$J$I$r;2>H$9$k$H$h$$!%(B e5-$NJ88%$r;29M$K$7$FI. $BI>2A4D(B $B6-$N%b%G%k(B $B!W$H!V(B $B%/%m! $B!W$G$O!$I. Structure and Interpretation of Computer Programs "$B$G;H(B $B$o$l$F$$$k?^ $B$O$8$a$N$$$C$](B $BJQ?t$N%9%3! let, let*, letrec ... $B$5$i$K@h$X(B elk guile scm MIT scheme TUT scheme $B!D(B
The Scheme Programming Language
The scheme programming Language. Ken Dickey. An Alternate World View. This series of articles describes the world view of the scheme programming Language.
http://www.scs.carleton.ca/~csgs/resources/scheme_intro.html

Extractions: The Scheme Programming Language Ken Dickey Each programming language presents a particular world view in the features it allows, supports, and forbids. This series of articles describes the world view of the Scheme Programming Language. This view contains many elements desired in a modern programming language: multi-paradigm support, composable, reusable abstractions, ability to create languages specialized for particular applications, clean separation of the generic and the implementation specific, and scalability from stand alone utilities to major software systems. Scheme started as an experiment in programming language design by challanging some fundamental design assumptions. It 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. Scheme is a small, exceptionally clean language which is, very importantly, fun to use. The language was designed to have very few, regular constructs which compose well to support a variety of programming styles including functional, object-oriented, and imperative. The language standard is only about 50 pages, including a formal, denotational definition of its semantics. Scheme is based on a formal model (the lambda calculus), so there are plenty of nice properties for the theoreticians and one can build knowledgeable code transformation tools reliably. Scheme has lexical scoping, uniform evaluation rules, and uniform treatment of data types. Scheme does not have the concept of a pointer, uninitialized variables, specialized looping constructs, or explicit storage management.
JPlag
An online plagiarism detection program for Java, C, C++ and scheme programming code.
http://wwwipd.ira.uka.de:2222/

Extractions: JPlag is a system that finds similarities among multiple sets of source code files. This way it can detect software plagiarism. JPlag does not merely compare bytes of text, but is aware of programming language syntax and program structure and hence is robust against many kinds of attempts to disguise similarities between plagiarized files. JPlag currently supports Java, C, C++, Scheme, and natural language text. JPlag is typically used to detect and thus discourage the unallowed copying of student exercise programs in programming education. But in principle it can also be used to detect stolen software parts among large amounts of source text or modules that have been duplicated (and only slightly modified). JPlag has already played a part in several intellectual property cases where it has been successfully used by expert witnesses. JPlag has a powerful graphical interface for presenting its results. See our example The use of JPlag is free, but you must obtain an account. This requirement is not only necessary to avoid unauthorized use of JPlag by students, but also to provide the easy and installation-free access to the software.
Scheme Programming Language - Encyclopedia Article About Scheme Programming Lang
encyclopedia article about scheme programming language. scheme programming language in Free online English dictionary, thesaurus and encyclopedia.
http://encyclopedia.thefreedictionary.com/Scheme programming language

Extractions: Dictionaries: General Computing Medical Legal Encyclopedia Word: Word Starts with Ends with Definition The Scheme programming language is a functional Functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions. In contrast to imperative programming, functional programming emphasizes the evaluation of functional expressions, rather than execution of commands. The expressions in these languages are formed by using functions to combine basic values. The functions alluded to in the title are mathematical functions. Mathematical functions have great strengths in terms of flexibility and in terms of analysis. For example, if a function is known to be idempotent, then a call to a function which has itself as its argument, and which is known to have no side-effects, may be efficiently computed without multiple calls. Click the link for more information. programming language has been proposed. Please council it when you plan to rewrite the article entirely. - A programming language or computer language is a standardized communication technique for expressing instructions to a computer. It is a set of syntactic and semantic rules used to define computer programs. A language enables a programmer to precisely specify what data a computer will act upon, how these data will be stored/transmitted, and precisely what actions to take under various circumstances.
Scheme - Beginning SCHEME Programming
TechnicalUser). Mar 19, 2003. HI, Can anyone suggest a free web resource to help me beginning programming in SCHEME, and where I can download the software?
http://www.tek-tips.com/gviewthread.cfm/pid/285/qid/504167
Scheme Programming Miscellanea
Monadic Programming in Scheme An example of a monadic programming in Scheme that juxtaposes Haskell code for a particular state monad with the corresponding
http://okmij.org/ftp/Scheme/misc.html

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

1-20 of 119 1 | 2 | 3 | 4 | 5 | 6 | Next 20