Category:Scheme

Scheme
This programming language may be used to instruct a computer to perform a task.

Garbage collected:	Yes
Parameter passing methods:	By value
Type safety:	Safe
Type strength:	Strong
Type expression:	Implicit
Type checking:	Dynamic
See Also:	Scheme on the HOPL BNF Grammar for Scheme Scheme compared to other languages

Listed below are all of the tasks on Rosetta Code which have been solved using Scheme.

Scheme is a multi-paradigm programming language. It is one of the two main dialects of Lisp and supports a number of programming paradigms; however it is best known for its support of functional programming. It was developed by Guy L. Steele and Gerald Jay Sussman in the 1970s. Scheme was introduced to the academic world via a series of papers, now referred to as Sussman and Steele's Lambda Papers. There are two standards that define the Scheme language: the official IEEE standard, and a de facto standard called the Revisedⁿ Report on the Algorithmic Language Scheme, nearly always abbreviated RnRS, where n is the number of the revision. The current standard is R7RS, with R5RS and, less common, R6RS still in use.

Scheme's philosophy is minimalist. Scheme provides as few primitive notions as possible, and, where practical, lets everything else be provided by programming libraries.

Scheme was the first dialect of Lisp to choose static (a.k.a. lexical) over dynamic variable scope. It was also one of the first programming languages to support first-class continuations.

Running Examples[edit]

Some examples from this site require particular versions of Scheme, or libraries, to run.

• R7RS programs typically begin with a line such as (import (scheme base) ...)
• R6RS programs with a line such as (import (rnrs) ...)
• R5RS programs don't require any preamble.

A semi-standard set of libraries for Scheme is the collection SRFIs (from Scheme Requests For Implementation). These libraries provide additional functions operating on core data structures, such as SRFI-1 for lists and SRFI-13 for strings; additional data structures, such as SRFI-69 or SRFI-125 for hash tables; or additional functionality, such as SRFI-42 providing eager comprehensions. Example programs which require one or more SRFIs must be run on implementations which support that SRFI.

Scheme does not directly support a GUI library: some examples use PsTk.

Citations[edit]

• Wikipedia:Scheme (programming language)
• R7RS Scheme home page
• R6RS Scheme home page
• R5RS Scheme documentation