Real World OCaml Functional programming for the masses 13631

Language Concepts
Chapter 1 : A Guided Tour
OCaml as a Calculator
Functions and Type Inference
Tuples, Lists, Options, and Pattern Matching
Records and Variants
Imperative Programming
A Complete Program
Where to Go from Here
Chapter 2 : Variables and Functions
Variables
Functions
Chapter 3 : Lists and Patterns
List Basics
Using Patterns to Extract Data from a List
Limitations (and Blessings) of Pattern Matching
Using the List Module Effectively
Tail Recursion
Terser and Faster Patterns
Chapter 4 : Files, Modules, and Programs
Single-File Programs
Multifile Programs and Modules
Signatures and Abstract Types
Concrete Types in Signatures
Nested Modules
Opening Modules
Including Modules
Common Errors with Modules
Designing with Modules
Chapter 5 : Records
Patterns and Exhaustiveness
Field Punning
Reusing Field Names
Functional Updates
Mutable Fields
First-Class Fields
Chapter 6 : Variants
Catch-All Cases and Refactoring
Combining Records and Variants
Variants and Recursive Data Structures
Polymorphic Variants
Chapter 7 : Error Handling
Error-Aware Return Types
Exceptions
Choosing an Error-Handling Strategy
Chapter 8 : Imperative Programming
Example: Imperative Dictionaries
Primitive Mutable Data
for and while Loops
Example: Doubly Linked Lists
Laziness and Other Benign Effects
Input and Output
Order of Evaluation
Side Effects and Weak Polymorphism
Summary
Chapter 9 : Functors
A Trivial Example
A Bigger Example: Computing with Intervals
Extending Modules
Chapter 10 : First-Class Modules
Working with First-Class Modules
Example: A Query-Handling Framework
Living Without First-Class Modules
Chapter 11 : Objects
OCaml Objects
Object Polymorphism
Immutable Objects
When to Use Objects
Subtyping
Chapter 12 : Classes
OCaml Classes
Class Parameters and Polymorphism
Object Types as Interfaces
Inheritance
Class Types
Open Recursion
Private Methods
Binary Methods
Virtual Classes and Methods
Initializers
Multiple Inheritance
Tools and Techniques
Chapter 13 : Maps and Hash Tables
Maps
Hash Tables
Choosing Between Maps and Hash Tables
Chapter 14 : Command-Line Parsing
Basic Command-Line Parsing
Argument Types
Adding Labeled Flags to the Command Line
Grouping Subcommands Together
Advanced Control over Parsing
Command-Line Autocompletion with bash
Alternative Command-Line Parsers
Chapter 15 : Handling JSON Data
JSON Basics
Parsing JSON with Yojson
Selecting Values from JSON Structures
Constructing JSON Values
Using Nonstandard JSON Extensions
Automatically Mapping JSON to OCaml Types
Chapter 16 : Parsing with OCamllex and Menhir
Lexing and Parsing
Defining a Parser
Defining a Lexer
Bringing It All Together
Chapter 17 : Data Serialization with S-Expressions
Basic Usage
The Sexp Format
Preserving Invariants
Getting Good Error Messages
Sexp-Conversion Directives
Chapter 18 : Concurrent Programming with Async
Async Basics
Examples: An Echo Server
Example: Searching Definitions with DuckDuckGo
Exception Handling
Timeouts, Cancellation, and Choices
Working with System Threads
The Runtime System
Chapter 19 : Foreign Function Interface
Example: A Terminal Interface
Basic Scalar C Types
Pointers and Arrays
Structs and Unions
Passing Functions to C
Learning More About C Bindings
Chapter 20 : Memory Representation of Values
OCaml Blocks and Values
Blocks and Values
Tuples, Records, and Arrays
Variants and Lists
Polymorphic Variants
String Values
Custom Heap Blocks
Chapter 21 : Understanding the Garbage Collector
Mark and Sweep Garbage Collection
Generational Garbage Collection
The Fast Minor Heap
The Long-Lived Major Heap
Attaching Finalizer Functions to Values
Chapter 22 : The Compiler Frontend: Parsing and Type Checking
An Overview of the Toolchain
Parsing Source Code
Preprocessing Source Code
Static Type Checking
The Typed Syntax Tree
Chapter 23 : The Compiler Backend: Bytecode and Native code
The Untyped Lambda Form
Generating Portable Bytecode
Compiling Fast Native Code
Summarizing the File Extensions
Colophon