Deriving an Erlang Interpreter from a Mechanised Formal Semantics of Core Erlang
ACM SIGPLAN via YouTube
PowerBI Data Analyst - Create visualizations and dashboards from scratch
MIT Sloan AI Adoption: Build a Playbook That Drives Real Business ROI
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the development of an Erlang interpreter in Haskell derived from a mechanized formal semantics of Core Erlang in this 35-minute conference presentation from Erlang 2025. Learn how researchers from Eötvös Loránd University and the University of Kent extract Haskell code from Coq inductive definitions that define Core Erlang semantics, creating provably equivalent Gallina functions and optimizing the resulting interpreter. Discover the approach to handling the inherently non-deterministic nature of the semantics by introducing a scheduler component that makes the system deterministic. Examine the computation graph visualization that illustrates all non-deterministic choices arising during program execution. Gain insights into the formal verification process using Coq (Rocq) proof assistant and understand how formal semantics can be transformed into practical interpreters. Review the evaluation methodology and preliminary performance data that demonstrate the viability of this formally-based approach to interpreter construction. Access the accompanying research paper and explore the intersection of formal methods, functional programming, and concurrent systems design in the context of Erlang language implementation.
Syllabus
[Erlang'25] Deriving an Erlang Interpreter from a Mechanised Formal Semantics of Core Erlang
Taught by
ACM SIGPLAN