看到很多版本都是没书签的，所以就自己添了书签造福一下大家 小小劳动成果，还请尊重，若有错误还请多指教w Abstraction： Programming in Haskell Second Edition Haskell is a purely functional language that allows programmers to rapidly develop clear, concise and correct software. The language has grown in popularity in recent years, both in teaching and in industry. This book is based on the author’s experience of teaching Haskell for more than 20 years. All concepts are explained from first principles and no programming experience isrequired, making this book accessible to a broad spectrum of readers. While Part I focuses on basic concepts, Part II introduces the reader to more advanced topics. This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable and traversable types. GRAHAM HUTTON is Professor of Computer Science at the University of Nottingham. He has taught Haskell to thousands of students and received numerous best lecturer awards. Hutton has served as an editor of the Journal of Functional Programming, chair of the Haskell Symposium and the International Conference on Functional Programming, vice-chair of the ACM Special Interest Group on Programming Languages, and he is an ACM Distinguished Scientist.

OpenGL ES 3.0 Programming Guide(2nd Edition)配套源码，支持各个平台，编译通过，学习原书籍必备的资源。

#R 编程 我对 Coursera 上课程作业的解决方案。 [Week 1](./Week 1) -没有编程作业，只包含用于解决测验的数据集 [Week 2](./Week 2) - 编程作业（空气污染） [第 3 周](./第 3 周) - 编程赋值（缓存矩阵的逆） [第 4 周](./第 4 周) - 笔记和编程作业（医院质量）

高清非扫描版！ The C Programming Language译作《C程序设计语言》，是由著名的计算机科学家Brian W. Kernighan和C语言之父的Dennis M. Ritchie合著的一部计算机科学著作，是第一部介绍C语言编程方法的书籍。它是一本必读的程序设计语言方面的参考书。它在C语言的发展和普及过程中起到了非常重要的作用，被视为是C语言的业界标准规范，而且至今仍然广泛使用。它也被公认为计算机技术著作的典范，以清晰简洁的文字讲述而著称。书中用"hello world"为实例开始讲解程序设计，也已经成为程序设计语言图书的传统。

没有谁能比C语言的发明者更了解C语言了，阅读此书，你能清晰的理解Ｋ＆Ｒ的伟大之处

Data is at the center of many challenges in system design today. Difficult issues need to be figured out, such as scalability, consistency, reliability, efficiency, and maintainability. In addition, we have an overwhelming variety of tools, including relational databases, NoSQL datastores, stream or batch processors, and message brokers. What are the right choices for your application? How do you make sense of all these buzzwords?, In this practical and comprehensive guide, author Martin Kleppmann helps you navigate this diverse landscape by examining the pros and cons of various technologies for processing and storing data. Software keeps changing, but the fundamental principles remain the same. With this book, software engineers and architects will learn how to apply those ideas in practice, and how to make full use of data in modern applications., Peer under the hood of the systems you already use, and learn how to use and operate them more effectively, Make informed decisions by identifying the strengths and weaknesses of different tools, Navigate the trade-offs around consistency, scalability, fault tolerance, and complexity, Understand the distributed systems research upon which modern databases are built, Peek behind the scenes of major online services, and learn from their architectures

本书版权属于原作者，本人只是从网络收集到本资源，请勿用作商业用途，本人不承担任何侵权责任。 《C++程序设计语言》（原书第4版）是C++领域最经典的参考书

IT6613编程手册，此文档主要阐述芯片寄存器配置相关内容，配合相应的datasheet，即可满足该芯片开发所需。

Programming the world wide web 第8版

This text develops a comprehensive theory of programming languages based on type systems and structural operational semantics. Language concepts are precisely defined by their static and dynamic semantics, presenting the essential tools both intuitively and rigorously while relying on only elementary mathematics. These tools are used to analyze and prove properties of languages and provide the framework for combining and comparing language features. The broad range of concepts includes fundamental data types such as sums and products, polymorphic and abstract types, dynamic typing, dynamic dispatch, subtyping and refinement types, symbols and dynamic classification, parallelism and cost semantics, and concurrency and distribution. The methods are directly applicable to language implementation, to the development of logics for reasoning about programs, and to the formal verification language properties such as type safety. This thoroughly revised second edition includes exercises at the end of nearly every chapter and a new chapter on type refinements. Table of Contents Part I Judgments and Rules Chapter 1 Abstract Syntax Chapter 2 Inductive Definitions Chapter 3 Hypothetical and General Judgments Part II Statics and Dynamics Chapter 4 Statics Chapter 5 Dynamics Chapter 6 Type Safety Chapter 7 Evaluation Dynamics Part III Total Functions Chapter 8 Function Definitions and Values Chapter 9 System T of Higher-Order Recursion Part IV Finite Data Types Chapter 10 Product Types Chapter 11 Sum Types Part V Types and Propositions Chapter 12 Constructive Logic Chapter 13 Classical Logic Part VI Infinite Data Types Chapter 14 Generic Programming Chapter 15 Inductive and Coinductive Types Part VII Variable Types Chapter 16 System F of Polymorphic Types Chapter 17 Abstract Types Chapter 18 Higher Kinds Part VIII Partiality and Recursive Types Chapter 19 System PCF of Recursive Functions Chapter 20 System FPC of Recursive Types Part IX Dynamic Types Chapter 21 The Untyped λ-Calculus Chapter 22 Dynamic Typing Chapter 23 Hybrid Typing Part X Subtyping Chapter 24 Structural Subtyping Chapter 25 Behavioral Typing Chapter Part XI Dynamic Dispatch Chapter 26 Classes and Methods Chapter 27 Inheritance Part XII Control Flow Chapter 28 Control Stacks Chapter 29 Exceptions Chapter 30 Continuations Part XIII Symbolic Data Chapter 31 Symbols Chapter 32 Fluid Binding Chapter 33 Dynamic Classification Part XIV Mutable State Chapter 34 Modernized Algol Chapter 35 Assignable References Chapter 36 Lazy Evaluation Part XV Parallelism Chapter 37 Nested Parallelism Chapter 38 Futures and Speculations Part XVI Concurrency and Distribution Chapter 39 Process Calculus Chapter 40 Concurrent Algol Chapter 41 Distributed Algol Part XVII Modularity Chapter 42 Modularity and Linking Chapter 43 Singleton Kinds and Subkinding Chapter 44 Type Abstractions and Type Classes Chapter 45 Hierarchy and Parameterization Chapter Part XVIII Equational Reasoning Chapter 46 Equality for System T Chapter 47 Equality for System PCF Chapter 48 Parametricity Chapter 49 Process Equivalence Appendix A Background on Finite Sets