Trees for Logic and Parsing in C++

Explore an in-depth conference talk on implementing logic and parsing in C++ using tree structures. Learn about efficient techniques for constructing, inspecting, and manipulating recursive tree types, with a focus on minimizing pointer indirections and reallocations. Discover how to create clean interfaces for tree-based data structures that rival or surpass those in functional languages. Gain insights into implementing abstract syntax trees and automated theorem proving, drawing from the speaker's extensive experience in logic and compiler construction. Examine practical approaches to memory management, type checking, and subtree operations in C++, with comparisons to functional programming paradigms.

Intro
About me
About my employer
About my project
Trees for Logic
Parsing
Lambda calculus
Substitution
Better Reduction
Lambdas
Term Rewriting
Propositional Logic
Operations
Automatic Memory Management
Pointers
Options
Inheritance
Type checking
Factorlike behavior
Sharing Aware
Value Semantics
Access Subtrees
View Subtrees
Replacing Subtrees
Updating Subtrees
Deep Comparison
Very Equal
Local Copy
Code
The problem
Extract