Non-Strict Pattern Matching and Delimited Control

https://pergamos.lib.uoa.gr/uoa/dl/frontend/file/lib/default/data/2182697/theFile

Non-Strict Pattern Matching and Delimited Control
Petros Barbagiannis

Pattern matching on algebraic data types is an essential feature of functional program-
ming languages. However, pattern matching is often thought to be syntactic sugar that can
be merely represented by a proper encoding. In this thesis we study the operational charac-
teristics of non-strict pattern matching. We also explore the semantics of control operators,
as well as some of their applications. Finally, we seek to examine the connection between
implementing a non-strict pattern matching evaluator and delimited continuations.