Tag Archives: workshop

Join The Russell Club

We are glad to announce that The Russell Club, a new fortnightly workshop series organized by Faron Moller, Markus Roggenbach and John Tucker, are starting next Monday (6pm-7pm).

The Russell Club is an informal Workshop Series where gems from the Foundations of Computer Science are explored.  It is open and accessible to all students, be they first-years or postgraduate, from any discipline. All that is required is an inquisitive mind.

Join The Russell Club

 

25th International Workshop on Algebraic Development Techniques 2020

Today Swansea is hosting the first virtual WADT, and you are gently invited to participate.

The virtual WADT is part of the 25th International Workshop on Algebraic Development Techniques 2020, which hopefully will still happen as a physical meeting in autumn this year.   The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems).

The workshop takes place under the auspices of IFIP WG 1.3.

Please see below for the programme.

2nd Proof Society Workshop on Proof Theory and its Applications

Following the Summer School, we are really proud to host the 2nd Proof Society Workshop. The workshop was an opportunity to listen to a lot of interesting invited and contributed talks on proof theory and various areas of its application:

Adam Wyner: Computational Law – The Case of Autonomous Vehicles
Yong Cheng: Exploring the incompleteness phenomenon
Matthias Baaz: Towards a Proof Theory for Henkin Quantifiers
Sonia Marin: On cut-elimination for non-wellfounded proofs: the case of PDL
Gilles Dowek: Logical frameworks, reverse mathematics, and formal proofs translation
Benjamin Ralph: What is a combinatorial proof system?
William Stirton: Ordinal assignments correlated with notions of reduction
Oliver Kullmann: Practical proof theory: practical versions of Extended Resolution
Anton Setzer and Ulrich Berger on behalf of Ralph Matthes: Martin Hofmann’s case for non-strictly positive data types – reloaded
Laura Crosilla: Philosophy of mathematics and proof theory
Takako Nemoto: Recursion Theory in Constructive Mathematics
Arno Pauly: Combinatorial principles equivalent to weak induction
Antonina Kolokolova: The proof complexity of reasoning over richer domains
Joost Joosten: The reduction property revisited
Helmut Schwichtenberg: Computational content of proofs

Thanks to all the speaker and participants and we hope to see you all again soon.

Proof Society Workshop 2019

Photo by Olga Petrovska

Logic and Computational Complexity 2019

Monika Seisenberger (Swansea University) and Lauri Hella (Tampere University, Finland) is chairing the Twenteeth International Workshop on Logic and Computational Complexity (LLC’19), which will be held in Patras, Greece, on July 8, 2019, as part of ICALP.

More information is here: