Write a Blog >>
ICFP 2020
Thu 20 - Fri 28 August 2020
Sun 23 Aug 2020 10:30 - 11:00 at Erlang - Session 2 Chair(s): Annette Bieniusa

This research is part of a wider project that aims to investigate and reason about the correctness of scheme-based source code transformations of Erlang programs. In order to formally reason about the definition of a programming language and the software built using it, we need a mathematically rigorous description of that language.

In this paper, we present an extended natural semantics for Core Erlang based on our previous formalisation implemented with the Coq Proof Assistant. This extension includes the concepts of exceptions and side effects, moreover, some modifications and updates are also discussed. Then we describe theorems about the properties of this formalisation (e.g. determinism), formal expression evaluation and equivalence examples. These equivalences can be interpreted as simple local refactorings.

Sun 23 Aug
Times are displayed in time zone: Eastern Time (US & Canada) change

10:30 - 12:00: Session 2Erlang at Erlang
Chair(s): Annette BieniusaTechnische Universität Kaiserslautern
10:30 - 11:00
Full-paper
Erlang
Simon ThompsonUniversity of Kent, Dániel HorpácsiEötvös Loránd University, Péter BereczkyEötvös Loránd University
DOI
11:00 - 11:30
Full-paper
Erlang
Viktória FördősCisco Systems
DOI
11:30 - 12:00
Full-paper
Erlang
Juan Facorro, Natalia ChechinaBournemouth University
DOI