Wed 24 Mar 2021 18:00 - 18:30 at Virtual Space B - Session 6 Chair(s): Ademar Aguiar
Thu 25 Mar 2021 15:00 - 15:30 at Virtual Space C - Session 11 Chair(s): Jeremy Gibbons

Throughout the history of functional programming, recursion has emerged as a natural method for describing loops in programs. However, there does often exist a substantial cognitive distance between the recursive definition and the simplest explanation of an algorithm even for the basic list processing functions such as map, concat, or unique; when we explain these functions, we seldom use recursion explicitly as we do in functional programming. For example, map is often explained as follows: the map function takes a function and a list and returns a list of the results of applying the function to all the elements of the list.

This paper advocates a new programming paradigm called pattern-match-oriented programming for filling this gap. An essential ingredient of our method is utilizing pattern matching for non-free data types. Pattern matching for non-free data types features non-linear pattern matching with backtracking and extensibility of pattern-matching algorithms. Several non-standard pattern constructs, such as not-patterns, loop patterns, and sequential patterns, are derived from this pattern-matching facility. Based on that result, this paper introduces many programming techniques that replace explicit recursions with an intuitive pattern by confining recursions inside patterns. We classify these techniques as pattern-match-oriented programming design patterns.

These programming techniques allow us to redefine not only the most basic functions for list processing such as map, concat, or unique more elegantly than the traditional functional programming style, but also more practical mathematical algorithms and software such as a SAT solver, computer algebra system, and database query language that we had not been able to implement concisely.

Conference Day
Wed 24 Mar

Displayed time zone: Belfast change

17:30 - 19:00
Session 6Research Papers at Virtual Space B
Chair(s): Ademar AguiarFEUP, Universidade do Porto
17:30
30m
Live Q&A
Constructing Hybrid Incremental Compilers for Cross-Module Extensibility with an Internal Build System
Research Papers
Jeff SmitsDelft University of Technology, Netherlands, Gabriël KonatDelft University of Technology, Eelco VisserDelft University of Technology
DOI Media Attached
18:00
30m
Live Q&A
Functional Programming in Pattern-Match-Oriented Programming Style
Research Papers
Satoshi EgiRakuten Institute of Technology, Rakuten, Inc. / The University of Tokyo, Yuichi NishiwakiThe University of Tokyo
DOI Media Attached
18:30
30m
Live Q&A
Sthread: In-Vivo Model Checking of Multithreaded Programs
Research Papers
Gene CoopermanNortheastern University, Martin QuinsonÉcole Normale Supérieure Rennes
DOI Media Attached

Conference Day
Thu 25 Mar

Displayed time zone: Belfast change

15:00 - 16:30
Session 11Research Papers at Virtual Space C
Chair(s): Jeremy GibbonsDepartment of Computer Science, University of Oxford
15:00
30m
Live Q&A
Functional Programming in Pattern-Match-Oriented Programming Style
Research Papers
Satoshi EgiRakuten Institute of Technology, Rakuten, Inc. / The University of Tokyo, Yuichi NishiwakiThe University of Tokyo
DOI Media Attached
15:30
30m
Live Q&A
Lake symbols for island parsing
Research Papers
Katsumi OkudaThe University of Tokyo / Mitsubishi Electric Corporation, Shigeru ChibaThe University of Tokyo
DOI Media Attached
16:00
30m
Live Q&A
Programming Paradigms, Turing Completeness and Computational Thinking
Research Papers
Greg MichaelsonHeriot-Watt University
DOI Media Attached