Tag Archives: polynomial

What’s the right way to QuickCheck floating-point routines?

I got a lot of great comments on my previous post about finding roots of polynomials in Haskell. One particularly promising idea I got from commenter Jake was to give up on the idea of having no external dependencies (which, … Continue reading

Posted in haskell, math | Tagged , , , , , , , , , | 12 Comments

Finding roots of polynomials in Haskell?

tl;dr: There are several Haskell packages one can use to find an individual root of a function on a certain interval. But I’ve had less luck finding a suitable package for finding all the roots of a given polynomial. This … Continue reading

Posted in haskell, math | Tagged , , , , , | 14 Comments

Polynomial Functors Constrained by Regular Expressions

I’ve now finished revising the paper that Dan Piponi and I had accepted to MPC 2015; you can find a PDF here: Polynomial Functors Constrained by Regular Expressions Here’s the 2-minute version: certain operations or restrictions on functors can be … Continue reading

Posted in math, writing | Tagged , , , , , , | 6 Comments