09/06/22 MPC and CLAS will operate in a hybrid online/in-person mode.
30/05/22 Accepted papers have been announced. See `Program` for details.
11/04/22 Deadline for submission has been extended to 29th of April.
The International Conference on Mathematics of Program Construction (MPC) aims to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs.
MPC 2022 is going to be held as part of the Computational Logic Autumn Summit of 2022 ( CLAS 2022) , and will be held in hybrid (face-2-face and online) mode. .
Previous conferences were held in:
– Porto, Portugal (2019);
– Königswinter, Germany (2015);
– Madrid, Spain (2012);
– Québec City, Canada (2010);
– Marseille, France (2008);
– Kuressaare, Estonia (2006);
– Stirling, UK (2004);
– Dagstuhl, Germany (2002);
– Ponte de Lima, Portugal (2000);
– Marstrand, Sweden (1998);
– Kloster Irsee, Germany (1995);
– Oxford, UK (1992);
– Twente, The Netherlands (1989).
MPC seeks original papers on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. Typical areas include type systems, program analysis and transformation, programming language semantics, security, and program logics. The notion of a ‘program’ is interpreted broadly, ranging from algorithms to hardware.
Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. We also encourage the submission of ‘programming pearls’ that present elegant and instructive examples of the mathematics of program construction.
Abstracts and papers will be submitted via EasyChair.
Submission is in two stages. Abstracts (plain text, maximum 250 words) must be submitted by 10th April 2022. Full papers (pdf, formatted using the llncs.sty style file for LaTex) must be submitted by 17th April 2022. There is no prescribed page limit, but authors should strive for brevity. Both abstracts and papers will be submitted using EasyChair.
Papers must present previously unpublished work, and not be submitted concurrently to any other publication venue. Submissions will be evaluated by the program committee according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Accepted papers must be presented in person at the conference by one of the authors.
The proceedings of MPC 2022 will be published in the Lecture Notes in Computer Science (LNCS) series, as with all previous instances of the conference. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose.
After the conference, authors of the best papers from MPC 2022 will be invited to submit revised versions to a special issue of Science of Computer Programming (SCP).
For any queries about submission please contact the program chair, Ekaterina Komendantskaya or publicity chair Matthew Daggitt.
Daniela Petrisan, Université de Paris
Title : TBA
Conor McBride, Strathclyde University
Title: Picking Your Way Through Pascal’s Triangle
Abstract: Every place in Pascal’s triangle enumerates the paths to that place, zig-zagging downwards from the top, but we can do more than count them. Binomial coefficients make for remarkable dependent types: bit vectors indexed by their length and one-count can document selections from data structures, or the embedding of a term’s support into its scope. They become all the more discriminating when you recognize that numerical indices are but the erasures of richer, individuating information. They compose in sequence categorically, and in parallel monoidally. Being made of bits, you can do Boolean logic with them, but with your eyes open as to their meaning. Working with Pascal’s Triangle, rendered into types, has changed the way I see and organise data in general, and syntactic data in particular. I shall recount my path to this place, and seek to find the meaning in the turns of my journey.
Mohammad Abdulaziz, Technische Universität München, Germany
Aurore Alcolei, Università di Bologna, Italy
Henning Basold, Leiden University, Netherlands
William Byrd, University of Alabama, US
Jacques Carette, McMaster University, Canada
Andrea Costea, National University of Singapore, Singapore
Peter Hoefner, The Australian National University, Australia
Johan Jeuring, Utrecht University, Netherlands
Patricia Johann, Appalachian State University, US
Ambrus Kaposi, Eötvös Loránd University, Hungary
Radu Mardare, University of Strathclyde, UK
Annabelle McIver, Macquarie University, Australia
Shin-Cheng Mu, Academia Sinica, Taiwan
Jose Oliveira, Universidade do Minho, Portugal
Grant Passmore, Imandra, US
Philip Saville, University of Oxford, UK
Ana Sokolova, Universität Salzburg, Austria
Kathrin Stark, Princeton University, US
Georg Struth, The University of Sheffield, UK
22nd April 2022 (Anywhere on Earth)
29th April 2022 (Anywhere on Earth)
27th May 2022
Camera ready copy
24th June 2022 (Anywhere on Earth)
26-28 September 2022