- ホーム
- > 洋書
- > 英文書
- > Computer / Languages
Full Description
Standard ML is a general-purpose programming language designed for large projects. This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers. Because computer programs are increasingly required to withstand rigorous analysis, it is all the more important that the language in which they are written be defined with full rigor. One purpose of a language definition is to establish a theory of meanings upon which the understanding of particular programs may rest. To properly define a programming language, it is necessary to use some form of notation other than a programming language. Given a concern for rigor, mathematical notation is an obvious choice. The authors have defined their semantic objects in mathematical notation that is completely independent of Standard ML. In defining a language one must also define the rules of evaluation precisely-that is, define what meaning results from evaluating any phrase of the language. The definition thus constitutes a formal specification for an implementation. The authors have developed enough of their theory to give sense to their rules of evaluation. The Definition of Standard ML is the essential point of reference for Standard ML. Since its publication in 1990, the implementation technology of the language has advanced enormously and the number of users has grown. The revised edition includes a number of new features, omits little-used features, and corrects mistakes of definition.
Contents
Part 1 Syntax of the coreidentifiers; lexical analysis; infixed operators; derived forms; grammar; syntactic restrictions. Part 2 Syntax of modules: reserved words; identifiers; infixed operators; grammar for modules; syntactic restrictions. Part 3 Static semantics for the core: simple objects; compound objects; projection, injection and modification; types and type functions; type schemes; scope of explicit type variables; non-expansive expressions; closure; type structures and type environments; inference rules; further restrictions. Part 4 Static semantics for modules: semantic objects; type realization; signature instantiation; functor signature instantiation; enrichment; signature matching; inference rules. Part 5 Dynamic semantics for the core: reduced syntax; simple objects; compound objects; basic values; basic exceptions; function closures; inference rules. Part 6 Dynamic semantics for modules: reduced syntax; compound objects; inference rules. Part 7 Programmes. Part 8 Appendices.
