Category Archives: Research trip



Wordpress is loading infos from loria

Please wait for API server to collect data from

Ulrich Berger is currently attending the 3rd Workshop on Mathematical Logic and its Applications, Nancy, France, where he will present a talk on Extracting the Fan Functional.

Collaboration at HIM Trimester Program

Ulrich, Monika and Olga attended Hausdorff Trimester Program Types, Sets and Constructions in Bonn, Germany. During this research trip they have participated in the Constructive Mathematics workshop and had a chance to collaborate with partners from the past and existing projects, including COMPUTAL, CONRCON and CID.

Break through result

Photo of Oliver KullmannOliver Kullmann and his co-authors Marein 

Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek. Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. In Nadia Creignou and Daniel Le Berre (Ed.), Theory and Applications of Satisfiability Testing – SAT 2016. (pp. 228-245). Springer.

Hideki Tsuiki visiting

Hideki Tsuiki from Kyoto University is visiting Swansea from 15 to 28 August 2016. He is an expert in Domain Theory, Effective Topology and Exact Real Number Computation. He is working with Ulrich Berger and the Munich Minlog group on the Extraction of infinity Gray code for real numbers.

Nao Hirokawa visiting

Nao Hirokawa from the Japan Advanced Institute of Science and Technology (JAIST) is visiting Swansea from 15 to 17 March. Nao is an expert in Term rewriting theory.

The abstract of his seminar talk about Basic Normalization on Thursday, 15 March can be found here.


Achim Jung visiting

Achim Jung from the University of Birmingham is visiting Swansea on Wednesday, 20 January 2016. He will give a talk in the PCV seminar series.

Title: On the sobriety of domains

Abstract: There are two ways in which a domain (in the sense of Dana
Scott) may arise from countable data: The classic way is via
order-theoretic approximation inside the domain, and leads to the
notion of algebraic and continuous domains. Alternatively, one can
view a domain as arising from the lattice of predicates that may be
formulated for a data type. This latter approach was pioneered and
developed by Samson Abramsky in his Domain Theory in Logical Form.
I will explain these two approaches and then present an example that
illustrates some of the subtlety that we may observe with the latter.

Time: 4-5 pm

Venue: Robert Recorde Room (Faraday Building 205)

The talk will be preceded by a talk by Margarita Korovina.