13 citations · 33 across the 8 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2023
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…
cs.PL2023
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…
cs.PL2019
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…