Efficient Implementation of Concurrent Programming Languages
Erik Stenman's 2002 PhD thesis at Uppsala University studies efficient implementation of concurrent programming languages, with work connected to Erlang, native code compilation, and runtime implementation.
What It Covers
- Efficient implementation of concurrent functional languages
- Native code compilation for Erlang
- Runtime implementation trade-offs
- Performance work around language implementation
- Research from the HiPE and Uppsala University era
Connection to Later Runtime Work
The thesis belongs in the HappiHacking archive because it is part of the same long thread as The BEAM Book, BEAM runtime work, and later production systems: understand what the runtime is doing, then make better engineering decisions from that understanding.
Academic Details
- Advisor: Kostis Sagonas (Uppsala University)
- Opponent: Simon Peyton Jones (Microsoft Research)
- Institution: Uppsala University
- Year: 2002
Connection to HappiHacking
The current HappiHacking material is more practical and production-facing, but the thesis is one of the roots. It is useful for readers interested in compiler work, runtime implementation, and the academic background behind later Erlang and BEAM systems work.
Access
- Full Thesis: Available via the DiVA portal
- Title: Efficient Implementation of Concurrent Programming Languages
- Type: Doctoral dissertation
Cookie quote from the thesis: "The days are all empty and the nights are Unreal."
What People Are Saying
The days are all empty and the nights are Unreal.
- cookie
