13 citations · 33 across the 8 of their papers we have counts for
8 papers
Types, equations, dimensions and the Pi theorem
Nicola Botta, Patrik Jansson
The languages of mathematical physics and modelling are endowed with a rich ``grammar of dimensions'' that common abstractions of programming languages fail to represent. We propos…
Bayesian optimization of massive material injection for disruption mitigation in tokamaks
Istvan Pusztai, Ida Ekmark, Hannes Bergström +5
A Bayesian optimization framework is used to investigate scenarios for disruptions mitigated with combined deuterium and neon injection in ITER. The optimization cost function take…
Level-p-complexity of Boolean Functions using Thinning, Memoization, and Polynomials
Julia Jansson, Patrik Jansson
This paper describes a purely functional library for computing level--complexity of Boolean functions, and applies it to two-level iterated majority. Boolean functions are simpl…
Extensional equality preservation and verified generic programming
Nicola Botta, Nuria Brede, Patrik Jansson +1
In verified generic programming, one cannot exploit the structure of concrete data types but has to rely on well chosen sets of specifications or abstract data types (ADTs). Functo…
Examples and Results from a BSc-level Course on Domain Specific Languages of Mathematics
Patrik Jansson, Sólrún Halla Einarsdóttir, Cezar Ionescu
At the workshop on Trends in Functional Programming in Education (TFPIE) in 2015 Ionescu and Jansson presented the approach underlying the "Domain Specific Languages of Mathematics…
Domain-Specific Languages of Mathematics: Presenting Mathematical Analysis Using Functional Programming
Cezar Ionescu, Patrik Jansson
We present the approach underlying a course on "Domain-Specific Languages of Mathematics", currently being developed at Chalmers in response to difficulties faced by third-year stu…
Sequential decision problems, dependent types and generic solutions
Nicola Botta, Patrik Jansson, Cezar Ionescu +2
We present a computer-checked generic implementation for solving finite-horizon sequential decision problems. This is a wide class of problems, including inter-temporal optimizatio…
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
Jean-Philippe Bernardy, Patrik Jansson
Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose. In…