Patrik Jansson

Professor of Computer Science


Computer Science and Engineering

Chalmers University of Technology

Blog posts

Nov 11, 2023

MSc thesis proposals

The local season for writing MSc thesis project proposal is here and I have formulated a few ideas for students to start from. They are posted in Chalmers' "MSc thesis portal" so I basically just link to them here: Computing Level-p-complexity with Ha...

Read more

Sep 15, 2023

Formalising parallel parsing (ValiantAgda code updates)

One of the lunch discussions during the recent ICFP 2023 week was about parallel parsing and I was then inspired to look up the Agda code of this paper: "Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda" Jean-Philippe Bern...

Read more

Aug 21, 2023

Types, equations, dimensions and the Pi theorem

Last week we submitted a paper to JFP about dimension analysis in a (dependently) typed functional language (like Idris or Agda). It is also available (as a pre-print) on arXiv. arXiv: 2308.09481 Authors: N. Botta, P. Jansson, G. da Silva Abstract: Th... (Link)

Read more

Aug 16, 2023

More on computing Level-p-complexity with Haskell

After the earlier posts (2022-12, 2023-03) there has been some more development on the "Level-\(p\)-complexity"-front. The topic is inspired from mathematical research by Prof. Jeffrey Steif and other colleagues, but the paper (in submission to JFP) is... (Link)

Read more

Jun 9, 2023

OptiFun: Optimising Nuclear Fusion with Functional Programming

I gave a talk at the CS division 2023 retreat at Marstrand about ongoing work in the "OptiFun" project. The project is funded by a Chalmers Energy Area of Advance grant (3M SEK) on "Optimising Fusion with Functional Programming". The project runs 2022-...

Read more

May 10, 2023

Exploring fair climate policies under uncertainty and conflicting goals: a computer-aided approach

Today we handed in a grant application to the funding agency FORMAS under the call "A sustainable transformation for climate action in a changing world". We apply for 10M SEK over 4 years and the abstract in included below.  /Patrik Some relevant link...

Read more

Apr 16, 2023

Beräkna bästa beslutet

(This post is in Swedish, in preparation for the International Science Festival in Gothenburg.) Jag är en av 42 forskare som kommer att delta i "Vetenskapsrouletten" på onsdag 2023-04-19: Vetenskapsfestivalen lånar Lisebergshjulet och fyller de 42 go...

Read more

Mar 12, 2023

Computing optimal policies for clean energy and sustainable development

Together with N Botta at the Potsdam Institute for Climate Impact Research and N Smallbone at the Chalmers FP Unit we are planning a research project around computer-aided policy-making and increasingly correct scientific computing. We have some prelim...

Read more

Mar 12, 2023

Responsibility Under Uncertainty

Early February the journal paper "Responsibility Under Uncertainty: Which Climate Decisions Matter Most?" (doi:10.1007/s10666-022-09867-w) was finally published. (It was submitted 2021-11 and accepted 2022-10.) In it we propose a new method for estima... (Link)

Read more

Mar 12, 2023

Bayesian optimization of fusion experiment simulations

Late February the paper "Bayesian optimization of massive material injection for disruption mitigation in tokamaks" was accepted for publication in the Journal of Plasma Physics. The preprint is available on arXiv. The paper reports results from earl... (Link)

Read more

Mar 12, 2023

Level-p-complexity of Boolean Functions (an update)

In an earlier post (2022-12) I mentioned work in progress and this has now (2023-02) lead to a submission of "Level-p-complexity of Boolean functions using Thinning, Memoization, and Polynomials" to the Journal of Functional Programming. A preprint is ...

Read more

Mar 12, 2023

Dimension analysis and graded algebras

Late February I gave a talk at online meeting of the IFIP Working Group 2.1 on Algorithmic Languages and Calculi. The talk presents work in progress (earlier mentioned in a post 2022-11) on "Dimension analysis and graded algebras". The talk slides and ...

Read more

Dec 14, 2022

Level-\(p\)-complexity of Boolean Functions: Using thinning, memoization, and polynomials

I gave a talk at the 2012-12 online meeting of IFIP WG 2.1 on Algorithmic Languages and Calculi. This is joint work (in progress) with Julia Jansson. The recording is available at YouTube and the slides here. The pre-print (submitted to JFP) is availab... (Link)

Read more

Nov 16, 2022

First and 31:st Agda meetings ...

Mid November I participated in the  31:st Agda Implementors' Meeting in Edinburgh. I presented work in progress about   "Dimension analysis and graded algebras" (video, Agda source code) The talks were recorded (and streamed by

Read more

Sep 20, 2022

Domain-Specific Languages for Societal Challenges

Multi-objective optimisation and exploration of system simulations A talk by Prof. Patrik Jansson as part of the session   "Structures for agent-based modeling of societal challenges"   Final conference: Mathematics of complex social systems   Themat...

Read more

Sep 9, 2022

My research related to Global challenges

I was asked to list my potential connections to a proposed profile area "Sea and society" at UGOT, so I wrote up a summary of that slice of my research work. 1. Climate Impact Research In 2007 I started working with the Potsdam Institute for Climate ...

Read more

Apr 6, 2016

From the archives: Reproducibility, Proofs and Domain Specific Languages

(This post was uploaded here in 2023 but was originally published elsewhere in 2016.) Reproducibility, Proofs and Domain Specific Languages Today (2016-04-06) I gave an invited presentation at the Alan Turing Institute Symposium on Reproducibility ...

Read more

Follow this website

You need to create an Owlstown account to follow this website.

Sign up

Already an Owlstown member?

Log in