Mitchell Wand – författare

Visar alla böcker från författaren Mitchell Wand. Handla med fri frakt och snabb leverans.

5 produkter

Kategorier

5 produkter

Essentials of Programming Languages, third edition
AvMitchell Wand,Daniel P. Friedman
E-bok
Engelska, 2008
1 114 kr
Läs direkt efter köp
A new edition of a textbook that provides students with a deep, working understanding of the essential concepts of programming languages, completely revised, with significant new material.
This book provides students with a deep, working understanding of the essential concepts of programming languages. Most of these essentials relate to the semantics, or meaning, of program elements, and the text uses interpreters (short programs that directly analyze an abstract representation of the program text) to express the semantics of many essential language elements in a way that is both clear and executable. The approach is both analytical and hands-on. The book provides views of programming languages using widely varying levels of abstraction, maintaining a clear connection between the high-level and low-level views. Exercises are a vital part of the text and are scattered throughout; the text explains the key concepts, and the exercises explore alternative designs and other issues. The complete Scheme code for all the interpreters and analyzers in the book can be found online through The MIT Press web site. For this new edition, each chapter has been revised and many new exercises have been added. Significant additions have been made to the text, including completely new chapters on modules and continuation-passing style. Essentials of Programming Languages can be used for both graduate and undergraduate courses, and for continuing education courses for programmers.
VLISP A Verified Implementation of Scheme
A Special Issue of Lisp and Symbolic Computation, An International Journal Vol. 8, Nos. 1 & 2 March 1995
AvJoshua D. Guttman,Mitchell Wand
Inbunden, Engelska, 1995
1 716 kr
Skickas inom 10-15 vardagar
The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: • The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a "warts-and-all" verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). • Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level "byte code" language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.
VLISP A Verified Implementation of Scheme
A Special Issue of Lisp and Symbolic Computation, An International Journal Vol. 8, Nos. 1 & 2 March 1995
AvJoshua D. Guttman,Mitchell Wand
Häftad, Engelska, 2012
1 716 kr
Skickas inom 10-15 vardagar
The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: • The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a "warts-and-all" verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). • Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level "byte code" language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.
VLISP A Verified Implementation of Scheme
A Special Issue of Lisp and Symbolic Computation, An International Journal Vol. 8, Nos. 1 & 2 March 1995
AvMitchell Wand,Joshua D. Guttman
E-bok
PDF, Engelska, 2012
2 127 kr
Läs direkt efter köp
The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: • The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a "warts-and-all" verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). • Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level "byte code" language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.
Essentials of Programming Languages
AvDaniel P. Friedman,Mitchell Wand
Inbunden, Engelska, 2008
962 kr
Tillfälligt slut

Företag, bibliotek eller offentlig verksamhet?

Mitchell Wand – författare

Essentials of Programming Languages, third edition

VLISP A Verified Implementation of Scheme

VLISP A Verified Implementation of Scheme

VLISP A Verified Implementation of Scheme

Essentials of Programming Languages

Mina sidor

Mina sidor

Hjälp

Hjälp

Om Bokus

Om Bokus

Populärt

Populärt

Inspiration

Inspiration