The Scheme Programming Language, 4th Edition pdf epub mobi txt 电子书下载 2026

简体网页||繁体网页

☆☆☆☆☆

出版者:The MIT Press

作者:R. Kent Dybvig

出品人:

页数:504

译者:

出版时间:2009-7-31

价格:USD 55.00

装帧:Paperback

isbn号码:9780262512985

丛书系列:

图书标签:

scheme
函数式编程
Scheme
Lisp
计算机科学
编程
Programming
计算机
Scheme
Programming
Language
4th
Edition
Functional
Programming
Lisp

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

具体描述

Scheme is a general-purpose programming language, descended from Algol and Lisp, widely used in computing education and research and a broad range of industrial applications. This thoroughly updated edition of The Scheme Programming Language provides an introduction to Scheme and a definitive reference for standard Scheme, presented in a clear and concise manner. Written for professionals and students with some prior programming experience, it begins by leading the programmer gently through the basics of Scheme and continues with an introduction to some of the more advanced features of the language.

The fourth edition has been substantially revised and expanded to bring the content up to date with the current Scheme standard, the Revised6 Report on Scheme. All parts of the book were updated and three new chapters were added, covering the language's new library, exception handling, and record-definition features.

The book offers three chapters of introductory material with numerous examples, eight chapters of reference material, and one chapter of extended examples and additional exercises. All of the examples can be entered directly from the keyboard into an interactive Scheme session. Answers to many of the exercises, a complete formal syntax of Scheme, and a summary of forms and procedures are provided in appendixes.

The Scheme Programming Language is the only book available that serves both as an introductory text in a variety of courses and as an essential reference for Scheme programmers.

探寻编程的精妙逻辑：语言、范式与优雅的解法本书将引领您深入探索一种强大而优雅的编程语言——Scheme。它不仅仅是一种工具，更是一种思维方式，一种能够培养您严谨逻辑、抽象思维和解决问题能力的媒介。我们不在此详述特定书籍的细节，而是聚焦于Scheme所代表的编程哲学、核心概念及其在现代软件开发中的深远影响。 Scheme，作为Lisp家族的一员，以其简洁的语法和强大的表达力著称。它深深植根于lambda演算，这使得函数成为Scheme的核心构建块，一切皆可视为函数。这种函数式的范式，鼓励开发者将复杂的计算分解为一系列可组合的、无副作用的函数，从而极大地提高了代码的可读性、可维护性和可测试性。在本书的旅程中，您将理解函数作为一等公民的重要性，学习如何通过匿名函数、高阶函数以及闭包来构建富有表现力的程序。我们不仅仅停留在理论层面。Scheme的精髓在于其高度的灵活性和可扩展性。它的宏系统（macros）允许您在编译时扩展语言本身，创造出属于您自己的语法结构和抽象，这为解决特定领域问题提供了无与伦比的能力。想象一下，您不再受限于预定义的语法，而是可以根据项目的需求量身定制开发语言，这便是Scheme宏系统带来的强大力量。您将学习如何设计和实现宏，从而提升代码的表达力，甚至创造出领域特定语言（DSL）。本书的探索将围绕Scheme的核心机制展开。您将深入理解递归的艺术，学会如何利用递归优雅地处理列表、树形结构等数据，并理解尾递归优化在性能上的重要性。垃圾回收机制，作为Scheme运行时的重要组成部分，也将得到细致的阐释，帮助您理解内存管理是如何在幕后高效运作的。此外，我们还将触及Scheme的标准库，了解其提供的丰富功能，以及如何利用这些库来快速构建各种应用。 Scheme的魅力不仅仅在于其理论的深度，更在于其实践的广泛性。虽然它可能不是最常见的商业开发语言，但它在学术界、研究领域以及许多注重代码质量和设计优雅的项目中扮演着重要角色。许多重要的计算机科学概念，例如编译器设计、操作系统内核、人工智能的早期研究，都曾受益于Scheme及其前身Lisp。学习Scheme，您将能够更好地理解计算机科学的基础原理，并为深入学习其他编程语言和技术打下坚实的基础。我们将逐步剖析Scheme的各项特性，从最基本的变量绑定、条件表达式，到复杂的模块系统、并发编程支持。您将学习如何构建数据结构，如何进行错误处理，以及如何利用Scheme的强大工具进行调试。这本书也将引导您理解Scheme在软件工程中的价值，如何利用其简洁的语法和强大的抽象能力来设计出健壮、可扩展且易于维护的软件系统。无论您是初次接触编程，希望领略不同于命令式语言的全新思维方式，还是经验丰富的开发者，渴望拓展视野、深入理解函数式编程的精髓，这本书都将是您不可或缺的伙伴。它将帮助您培养一种更加抽象、更加灵活的编程思维，让您在面对复杂问题时，能够找到那些优雅、高效的解决方案。通过对Scheme的深入学习，您将不仅仅掌握一门编程语言，更将获得一种解决问题的强大视角。您将学会如何化繁为简，如何通过精妙的逻辑组合来构建出富有生命力的程序。这是一种对编程艺术的极致追求，一种对代码优雅的执着探索。准备好迎接这场思维的盛宴，一同揭开Scheme编程语言的神秘面纱，体验那份纯粹的编程之美。

作者简介

目录信息

Table of Contents
Preface
Chapter 1. Introduction
Section 1.1. Scheme Syntax
Section 1.2. Scheme Naming Conventions
Section 1.3. Typographical and Notational Conventions
Chapter 2. Getting Started
Section 2.1. Interacting with Scheme
Section 2.2. Simple Expressions
Section 2.3. Evaluating Scheme Expressions
Section 2.4. Variables and Let Expressions
Section 2.5. Lambda Expressions
Section 2.6. Top-Level Definitions
Section 2.7. Conditional Expressions
Section 2.8. Simple Recursion
Section 2.9. Assignment
Chapter 3. Going Further
Section 3.1. Syntactic Extension
Section 3.2. More Recursion
Section 3.3. Continuations
Section 3.4. Continuation Passing Style
Section 3.5. Internal Definitions
Section 3.6. Libraries
Chapter 4. Procedures and Variable Bindings
Section 4.1. Variable References
Section 4.2. Lambda
Section 4.3. Case-Lambda
Section 4.4. Local Binding
Section 4.5. Multiple Values
Section 4.6. Variable Definitions
Section 4.7. Assignment
Chapter 5. Control Operations
Section 5.1. Procedure Application
Section 5.2. Sequencing
Section 5.3. Conditionals
Section 5.4. Recursion and Iteration
Section 5.5. Mapping and Folding
Section 5.6. Continuations
Section 5.7. Delayed Evaluation
Section 5.8. Multiple Values
Section 5.9. Eval
Chapter 6. Operations on Objects
Section 6.1. Constants and Quotation
Section 6.2. Generic Equivalence and Type Predicates
Section 6.3. Lists and Pairs
Section 6.4. Numbers
Section 6.5. Fixnums
Section 6.6. Flonums
Section 6.7. Characters
Section 6.8. Strings
Section 6.9. Vectors
Section 6.10. Bytevectors
Section 6.11. Symbols
Section 6.12. Booleans
Section 6.13. Hashtables
Section 6.14. Enumerations
Chapter 7. Input and Output
Section 7.1. Transcoders
Section 7.2. Opening Files
Section 7.3. Standard Ports
Section 7.4. String and Bytevector Ports
Section 7.5. Opening Custom Ports
Section 7.6. Port Operations
Section 7.7. Input Operations
Section 7.8. Output Operations
Section 7.9. Convenience I/O
Section 7.10. Filesystem Operations
Section 7.11. Bytevector/String Conversions
Chapter 8. Syntactic Extension
Section 8.1. Keyword Bindings
Section 8.2. Syntax-Rules Transformers
Section 8.3. Syntax-Case Transformers
Section 8.4. Examples
Chapter 9. Records
Section 9.1. Defining Records
Section 9.2. Procedural Interface
Section 9.3. Inspection
Chapter 10. Libraries and Top-Level Programs
Section 10.1. Standard Libraries
Section 10.2. Defining New Libraries
Section 10.3. Top-Level Programs
Section 10.4. Examples
Chapter 11. Exceptions and Conditions
Section 11.1. Raising and Handling Exceptions
Section 11.2. Defining Condition Types
Section 11.3. Standard Condition Types
Chapter 12. Extended Examples
Section 12.1. Matrix and Vector Multiplication
Section 12.2. Sorting
Section 12.3. A Set Constructor
Section 12.4. Word Frequency Counting
Section 12.5. Scheme Printer
Section 12.6. Formatted Output
Section 12.7. A Meta-Circular Interpreter for Scheme
Section 12.8. Defining Abstract Objects
Section 12.9. Fast Fourier Transform
Section 12.10. A Unification Algorithm
Section 12.11. Multitasking with Engines
References
Answers to Selected Exercises
Formal Syntax
Summary of Forms
Index
· · · · · · (收起)