* Scheme ( programming language )

The Lisp dialect used in Emacs differs substantially from the more modern Common Lisp and Scheme dialects commonly used for applications programming.

However, prominent functional programming languages such as Common Lisp, Scheme, ISLISP, Clojure, Racket, Erlang, OCaml, Haskell, Scala and F # have been used in industrial and commercial applications by a wide variety of organizations.

Also in the 1970s, the development of Scheme ( a partly functional dialect of Lisp ), as described in the influential Lambda Papers and the 1985 textbook Structure and Interpretation of Computer Programs, brought awareness of the power of functional programming to the wider programming-languages community.

* Lazy programming and lazy evaluation in Scheme

Mutual recursion is very common in the functional programming style, and is often used for programs written in LISP, Scheme, ML, and similar languages.

* Scheme ( programming language ), a minimalist, multi-paradigm dialect of Lisp

Scheme is a functional programming language and one of the two main dialects of the programming language Lisp.

In August 2009, the Scheme Steering Committee which oversees the standardization process announced its intention to recommend splitting Scheme into two languages: a large modern programming language for programmers, and a subset of the large version retaining the minimalism praised by educators and casual implementors ; two working groups were created to work on these two new versions of Scheme.

Scheme is primarily a functional programming language.

This subsection describes those features of Scheme that have distinguished it from other programming languages from its earliest days.

These are the aspects of Scheme that most strongly influence any product of the Scheme language, and they are the aspects that all versions of the Scheme programming language, from 1973 onward, share.

Like most modern programming languages and unlike earlier Lisps such as Maclisp or Emacs Lisp, Scheme is lexically scoped: all possible variable bindings in a program unit can be analyzed by reading the text of the program unit without consideration of the contexts in which it may be called.

* A Tour of Scheme in Gambit, introduction on how to do software development in Gambit Scheme for people with experiences in general programming languages.

simple: Scheme ( programming language )

Later programming languages, such as ML and Scheme, extended the term to refer to syntax within a language which could be defined in terms of a language core of essential constructs ; the convenient, higher-level features could be " desugared " and decomposed into that subset.

is also a special form in the Scheme programming language.

Category: Scheme programming language

# REDIRECT Scheme ( programming language )

The Scheme language standard requires implementations to recognize and optimize tail recursion.

For example, Scheme has both continuations and hygienic macros, which enables a programmer to design their own control abstractions, such as looping and early exit constructs, without the need to build them into the language.

Conversely, Scheme contains multiple coherent subsets that suffice to construct the rest of the language as library macros, and so the language designers do not even bother to say which portions of the language must be implemented as language constructs, and which must be implemented as parts of a library.

While syntax is commonly specified using a formal grammar, semantic definitions may be written in natural language ( e. g., as in the C language ), or a formal semantics ( e. g., as in Standard ML and Scheme specifications ).

Unlike Common Lisp, the other main dialect, Scheme follows a minimalist design philosophy specifying a small standard core with powerful tools for language extension.

The Scheme language is standardized in the official IEEE standard, and a de facto standard called the Revised < sup > n </ sup > Report on the Algorithmic Language Scheme ( RnRS ).

A new language standardization process began at the 2003 Scheme workshop, with the goal of producing an R6RS standard in 2006.

This section concentrates mainly on innovative features of the language, including those features that distinguish Scheme from other Lisps.

DSA is a variant of the ElGamal Signature Scheme.

* Feige-Fiat-Shamir Identification Scheme, a Fiat-Shamir Scheme variant

In cryptography, the Generalized DES Scheme ( GDES or G-DES ) is a variant of the DES block cipher designed with the intention of speeding up the encryption process while improving its security.

The language, originally developed in 1993, is a variant of APL and contains elements of Scheme.

* DL / ECIES ( Discrete Logarithm / Elliptic Curve Integrated Encryption Scheme ): Essentially the " DHAES " variant of ElGamal encryption.

Like Structure and Interpretation of Computer Programs ( SICP ), HtDP relies on a variant of the Scheme programming language.

The Compatibility Encoding Scheme for UTF-16: 8-Bit ( CESU-8 ) is a variant of UTF-8 that is described in Unicode Technical Report # 26.

Common Lisp is most frequently compared with, and contrasted to, Scheme — if only because they are the two most popular Lisp dialects.

Scheme predates CL, and comes not only from the same Lisp tradition but from some of the same engineers — Guy L. Steele, with whom Gerald Jay Sussman designed Scheme, chaired the standards committee for Common Lisp.

Unlike many earlier Lisps, Common Lisp ( like Scheme ) uses lexical variable scope by default for both interpreted and compiled code.

Scheme introduced the sole use of lexically scoped variables to Lisp ; an inspiration from ALGOL 68 which was widely recognized as a good idea.

Common Lisp is sometimes termed a Lisp-2 and Scheme a Lisp-1, referring to CL's use of separate namespaces for functions and variables.

These conventions allow some operators in both languages to serve both as predicates ( answering a boolean-valued question ) and as returning a useful value for further computation, but in Scheme the value '() which is equivalent to NIL in Common Lisp evaluates to true in a boolean expression.

; Butterfly Common Lisp: an implementation written in Scheme for the BBN Butterfly multi-processor computer

Dylan derives from Scheme and Common Lisp and adds an integrated object system derived from the Common Lisp Object System ( CLOS ).

Although deriving much of its semantics from Scheme and other Lisps — some implementations were in fact initially built within existing Lisp systems — Dylan has an ALGOL-like syntax rather than a Scheme-like prefix syntax.

Unlike Common Lisp, Scheme existed at the time Stallman was rewriting Gosling Emacs into GNU Emacs, but he chose not to use it because of its comparatively poor performance on workstations, and he wanted to develop a dialect which he thought would be more easily optimized.

Scheme and Dylan were later attempts to simplify and improve Lisp.

Today, the most widely known general-purpose Lisp dialects are Common Lisp and Scheme.

The most widely used implementations of syntactic macro systems are found in Lisp-like languages such as Common Lisp, Scheme, ISLISP and Racket.

In Python, a distinction between expressions and statements is rigidly enforced, in contrast to languages such as Common Lisp, Scheme, or Ruby.