Category:Scheme

From Rosetta Code
Language
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:
Listed below are all of the tasks on Rosetta Code which have been solved using Scheme.
Your Help Needed
If you know Scheme, please write code for some of the tasks not implemented in Scheme.
Try this language on Codepad.

Scheme is a multi-paradigm programming language. It is one of the two main dialects of Lisp and supports a number of programming paradigms but 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 Revisedn Report on the Algorithmic Language Scheme, nearly always abbreviated RnRS, where n is the number of the revision. The current standard is R6RS, and R7RS is in development.

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.

Citations[edit]

Scheme is an implementation of Lisp. Other implementations of Lisp.

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "Scheme"

The following 309 pages are in this category, out of 309 total.