Dimpl: An Efficient and Expressive DSL for Discrete Mathematics by Ronit Jha.
Abstract:
This paper describes the language
DIMPL, a domain-specific language (DSL) for discrete mathematics. Based on Haskell,DIMPLcarries all the advantages of a purely functional programming language. Besides containing a comprehensive library of types and efficient functions covering the areas of logic, set theory, combinatorics, graph theory, number theory and algebra, the DSL also has a notation akin to one used in these fields of study. This paper also demonstrates the benefits ofDIMPLby comparing it with C, Fortran, MATLAB and Python &emdash; languages that are commonly used in mathematical programming.
From the comparison, solving simultaneous linear equations:
Much more is promised in the future for DIMPL:
Future versions of
DIMPLwill have an extended library comprising of modules for lattices, groups, rings, monoids and other discrete structures. They will also contain additional functions for the existing modules such as Graph and Tree. Moreover, incorporating Haskell’s support for pure parallelism and explicit concurrency in the library functions could significantly improve the efficiency of some functions on multi-core machines.
Can you guess the one thing that Ronit left out of his paper?
You guessed it!
Discrete Mathematics Programming Language – A Domain-Specific Language for Discrete Mathematics.
The Github URL for the repository. 😉
You should check out his homepage as well.
I have only touched the edges of this paper but it looks important.
Comments/suggestions?
I first saw this in a tweet by José A. Alonso