NPFL 2018 - 2018 Numerical Programming in Functional Languages
Topics/Call fo Papers
This workshop aims to bring together researchers and practitioners exploring and utilising functional or declarative programming languages to solve numerically oriented problems including but not limited to
Embedded domain specific languages for expressing numerical problems and generating efficient code e.g. generating llvm à la Julia / Haskell accelerate
Use of types to ensure static correctness of matrix and higher rank computations e.g. use Naperian aka representable functors for statically type APL-like programming
Dynamical systems / solving systems of ODEs
PDEs using e.g. grid-based methods, method of characteristics, method of lines
Inferring parameters for statistical models using techniques such as Sequential Monte Carlo / Hamiltonian Monte Carlo
Data exploration, reproducibility
Use of e.g SMT theorem proving, interval and affine arithmetic and function derivatives to prove error bounds for programs using floating point arithmetic
Formal verification of numerical analysis programs for example using e.g the Coq proof assistant
Global approximation methods chebyshev polynomials
Compiler optimisations
Exact real arithmetic / interval arithmetic
Using type systems to annotate values with physical units
Embedded domain specific languages for expressing numerical problems and generating efficient code e.g. generating llvm à la Julia / Haskell accelerate
Use of types to ensure static correctness of matrix and higher rank computations e.g. use Naperian aka representable functors for statically type APL-like programming
Dynamical systems / solving systems of ODEs
PDEs using e.g. grid-based methods, method of characteristics, method of lines
Inferring parameters for statistical models using techniques such as Sequential Monte Carlo / Hamiltonian Monte Carlo
Data exploration, reproducibility
Use of e.g SMT theorem proving, interval and affine arithmetic and function derivatives to prove error bounds for programs using floating point arithmetic
Formal verification of numerical analysis programs for example using e.g the Coq proof assistant
Global approximation methods chebyshev polynomials
Compiler optimisations
Exact real arithmetic / interval arithmetic
Using type systems to annotate values with physical units
Other CFPs
Last modified: 2018-04-26 10:22:27