# 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: |

**Your Help Needed**

If you know

**Scheme**, please write code for some of the tasks not implemented in

**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 ^{n} Report on the Algorithmic Language Scheme*, nearly always abbreviated R

*n*RS, 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

## Subcategories

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

## Pages in category "Scheme"

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

### 2

### A

- A+B
- ABC Problem
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Align columns
- Amb
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Animate a pendulum
- Anonymous recursion
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Arithmetic evaluation
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Arrays
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average

### B

### C

- Caesar cipher
- Case-sensitivity of identifiers
- Catalan numbers
- Catamorphism
- Character codes
- Check that file exists
- Circles of given radius through two points
- Classes
- Closures/Value capture
- Collections
- Combinations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Compound data type
- Concurrent computing
- Conditional structures
- Conway's Game of Life
- Copy a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Create a file
- Create an HTML table
- Cumulative standard deviation

### D

### E

- Echo server
- Elementary cellular automaton
- Elementary cellular automaton/Random Number Generator
- Empty program
- Empty string
- Entropy
- Enumerations
- Ethiopian multiplication
- Evaluate binomial coefficients
- Even or odd
- Evolutionary algorithm
- Exceptions
- Execute a Markov algorithm
- Execute a system command
- Execute Brain****
- Exponentiation operator
- Extend your language
- Extreme floating point values

### F

- Factorial
- Factors of a Mersenne number
- Factors of an integer
- Farey sequence
- FASTA format
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- File input/output
- File size
- Filter
- Find limit of recursion
- Find palindromic numbers in both binary and ternary bases
- First-class functions
- First-class functions/Use numbers analogously
- FizzBuzz
- Flatten a list
- Formal power series
- Formatted numeric output
- Forward difference
- Fractal tree
- Fractran
- Function composition
- Function definition

### G

### H

- Hailstone sequence
- Hamming numbers
- Happy numbers
- Harshad or Niven series
- Hash from two arrays
- Hash join
- Haversine formula
- Hello world/Graphical
- Hello world/Line printer
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Higher-order functions
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Holidays related to Easter
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- HTTP
- Huffman coding

### I

### L

- Largest int from concatenated ints
- Leap year
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- List comprehensions
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long multiplication
- Longest common subsequence
- Longest increasing subsequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/N plus one half
- Loops/Nested
- Loops/While
- Lucas-Lehmer test
- Luhn test of credit card numbers
- LZW compression

### M

### N

### P

### R

- Random numbers
- Range expansion
- Range extraction
- Read a file line by line
- Read entire file
- Real constants and functions
- Reduced row echelon form
- Remove duplicate elements
- Rename a file
- Repeat
- Repeat a string
- Return multiple values
- Reverse a string
- Reverse words in a string
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a quadratic function
- Roots of unity
- Rot-13
- Run-length encoding
- Runtime evaluation
- Runtime evaluation/In an environment

### S

- S-Expressions
- Same Fringe
- Search a list
- Sequence of non-squares
- Set
- SHA-1
- Shell one-liner
- Short-circuit evaluation
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Sleep
- Sockets
- Sort an integer array
- Sort disjoint sublist
- Sort using a custom comparator
- Sorting algorithms/Bubble sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Insertion sort
- Sorting algorithms/Merge sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Quicksort
- Sorting algorithms/Tree sort on a linked list
- Soundex
- Stack
- Stair-climbing puzzle
- String case
- String comparison
- String concatenation
- String length
- Strip a set of characters from a string
- Strip comments from a string
- Substring
- Sum and product of an array
- Sum and Product Puzzle
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of squares
- System time