Learning F# by Designing Your Own Language
summary
Learns F# by actually building a parser and a small interpreter, not by definitions: uses F#, FParsec and Rider to implement a recursive descent parser, an operator‑precedence parser for correct associativity/precedence, and a runtime that applies filter/order/skip/take to in-memory records. Live coding produces a working custom data‑querying DSL with parse errors, AST types (discriminated unions, records), and an execute function; source code is on GitHub for immediate reuse.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:54What is F#? - What are functional languages?
- 7:45Parsers are functional
- 9:50Hello World from F#
- 18:38A look into FParsec
- 28:26Build our own query language
- 55:58Parsing expressions/operator precedence
- 1:19:03Summary
related talks
01h 01mLive Lambda Calculus
43mWrite your own domain specific language with F#
58mParsing in C# from first principles
01h 00mFunctional-first programming with F#
46mInventing a language (placeholder title)
33mThe Language of the Language: Comparing compiler construction in Clojure and F#
55mKeynote: Functionalist programming language design
44mRethinking compilers with live coding