Retrieve Purchased Essay
Donate Your Essay
Contact Us
Retrieve Your Essay
Essays 1
Essays 2
Essays 3
Essays 4
Essays 5
Essays 6
Essays 7
Essays 8
Essays 9
Essays 10
Essays 11
Essays 12
Essays 13
Essays 14
Essays 15
Essays 16
Essays 17
Essays 18
Essays 19
Essays 20
Essays 21
Essays 22
Essays 23
Essays 24
Essays 25
Essays 26
Essays 27
Essays 28
Essays 29
Essays 30
Essays 31
Essays 32
Essays 33
Essays 34
Essays 35
Essays 36
Essays 37
Essays 38
Essays 39
Essays 40
Essays 41
Essays 42
Essays 43
Essays 44
Essays 45
Essays 46
Essays 47
Essays 48
Essays 49
Essays 50
Essays 51
Essays 52
Essays 53
Essays 54
Essays 55
Essays 56
Essays 57
Essays 58
Essays 59
Essays 60
Essays 61
Essays 62
Essays 63
Essays 64
Essays 65
Essays 66
Essays 67
Essays 68
Essays 69
Essays 70
Essays 71
Essays 72
Essay on Scheme Programming Language | ||
|
This is the first 1,000 characters of 3227 words (12.91 pages) in the essay titled Scheme Programming Language Each programming language presents a particular world view in thefeatures it allows, supports, and forbids. This series of articles describes the world view of the Scheme Programming Language. This view contains many elements desired in a modern programming language: multi-paradigm support, composable, reusable abstractions, ability to create languages specialized for particular applications, clean separation of the generic and the implementation specific, and scalability from stand alone utilities to major software systems. Scheme started as an experiment in programming language design by challanging some fundamental design assumptions. It is currently gaining favor as a first programming language in universities and is used in industry by such companies as DEC, Scheme is a small, exceptionally clean language which is, very importantly, fun to use. The language was designed to have very few, regular constructs which compose well to support a variety of programming styles including functional, object-oriented, and imperative. The language standard is only about 50 pages, including a formal, denotational definition of its semantics. Scheme is based on a formal model (the lambda calculus), so there are plenty of nice properties for the theoreticians and one can build knowledgeable code transformation tools reliably. Scheme has lexical scoping, uniform evaluation rules, and uniform treatment of data types. Scheme does not have ... |
||
To continue reading the complete essay right now, you must do the following:
|
| |||
|
Keywords: scheme programming language, programming language design, challanging, knowledgeable, semantics, constructs, reusable abstractions, uniform treatment, lambda calculus, uninitialized variables, paradigm support, lexical scoping, design assumptions, code transformation, transformation tools, fundamental design, programming styles, evaluation rules, formal model, functional object