1 / 2

Scheme

Scheme. Like ML, functional focus with imperative features anonymous functions, closures, no return statement, etc. but every binding is mutable A really minimalist syntax/semantics In the LISP tradition LISP was earliest language that targeted symbolic computation

sailor
Download Presentation

Scheme

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Scheme • Like ML, functional focus with imperative features • anonymous functions, closures, no return statement, etc. • but every binding is mutable • A really minimalist syntax/semantics • In the LISP tradition • LISP was earliest language that targeted symbolic computation • Current standard is 50 pages • Dynamically typed while still being type-safe • Less compile-time checking (run-time checking instead) • Accepts more perfectly reasonable programs • Some advanced features for decades • Programs as data, hygienic macros, continuations

  2. Scheme Syntax/Semantics • Scheme term is either: • an atom (identifier, number, symbol, string, ...) • a sequence of terms (t1 ... tn) • Semantically, identifiers are resolved in an environment and other atoms are values. • The semantics of a sequence depends on t1 : • certain character sequences are “special forms” • otherwise a sequence is a function application • Some special forms: • define • lambda • if, cond, and, or • let, let*, letrec

More Related