Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP

An Experiment in Haskell Symbolic Algebra

branch: master

Fetching latest commit…

Octocat-spinner-32-eaf2f5

Cannot retrieve the latest commit at this time

Octocat-spinner-32 Algebra
Octocat-spinner-32 HaskSymb.cabal
Octocat-spinner-32 README.md
README.md

HaskSymb: An Experiment in Haskell Symbolic Algebra

HaskSymb is a quickly hacked together proof of concept that I may expand at some point. That said, it has some cool features.

The biggest one is that it provides mathematical pattern matching via quasiquoters. So one can write code like this:

expand [m|  a+b  |] = expand a + expand b
expand [m|a*(b+c)|] = expand (a*b) + expand (a*c)
expand       a      = a

The patterns match up to trivial mathematical equivalency. For example, because multiplication is commutative, [m|a*(b+c)|] matches (x+1)*y in addition to 2*(x+1). On the other hand, it doesn't attempt to do deeper analysis, like expanding expressions. It does support using the same variable multiple times (eg. [m|a+a|] which will match x+x but not x+1) and constants (eg. [m|2*a|]).

(In fact, at the time of writing that is actual code in BasicAlg.hs.)

Example Use

A short ghci session with HaskSymb, using the MExpr symbolic type

Prelude> import Algebra.HaskSymb
Prelude Algebra.HaskSymb> -- Let's make some variables!
Prelude Algebra.HaskSymb> let (a,b)  = (V "a", V "b")

Prelude Algebra.HaskSymb> -- Basic Expression manipulation
Prelude Algebra.HaskSymb> (a+1)^3
(a + 1)³
Prelude Algebra.HaskSymb> expand $ (a+1)^3
a³ + a² + a² + a² + a + a + a + 1
Prelude Algebra.HaskSymb> collectTerms $ expand $ (a+1)^3
a³ + 3a² + 3a + 1
Prelude Algebra.HaskSymb> collectTerms $ expand $ (a+b)^4
6a²*b² + 4a³*b + 4a*b³ + b + a

Prelude Algebra.HaskSymb> -- Derivatives!
Prelude Algebra.HaskSymb> diff a $ a^4 + 3*a^2 + 5
4a³ + 6a

How does it work?

The basic idea is the constructor-destructor class pattern. For example, the class SymbolicSum is defined:

class SymbolicSum a where
    sumC :: [a] -> a
    sumD ::  a  -> Maybe [a]

sumC constructs a value of type a representing a sum of as. sumD attempts to destruct a value of type a into a list that could be summed into them.

Then, using View Patterns, we can write stuff like:

foo (sumD -> Just vals) = "input is a sum of" ++ show vals
foo          _          = "input is not a sum"

Our quasiquoter, m, will build smarter destructors based off of these. Then if someone implements SymbolicSum, etc, they can use our patterns!

(The actual pattern matching has been abstracted to colah/pattern-power which you need installed to run this.)

Fun Hacking!!

As mentioned earlier, HaskSymb is a quickly hacked together proof of concept. It is not a serious project, isn't useful for anything, and has fairly ugly code. At some point, it may become something else, but that isn't right now.

So, I can't in good conscience recommend hacking on most of the code base. It was my first time writing Template Haskell and that shines through with the sort of code that will making you want to bang your head against the wall repeatedly.

That said, BasicAlgs.hs is really cool and may be worth hacking on. It's just simple procedures to apply to symbolic expressions, made really pleasant by the m quasiquoter. Check it out! Right now, there's just expand and collectTerms -- I don't really know what the building blocks of procedural algebra should be...

I'd be thrilled to accept pull requests here.

Where I'm Kind Of Stuck

So this is a quickly hacked together proof of concept. The code is kind of ugly. Substantially, this is because I haven't figured out how to do things well.

The big issue I'm facing is appropriate types for symbolic expressions. In particular, how do I handle variables in types?

My ideal solution would involved dependent types, eg. SymbolicExpr (Set [Var "x", Var "y"]). This would allows all sorts of nice things like set :: SymbolicExpr vars -> Var name -> Float -> SymbolicExpr (delete (Var name) vars), (+) :: SymbolicExpr vars1 -> SymbolicExpr vars2 -> SymbolicExpr (union vars1 vars2) and eval :: SymbolicExpr (Set []) -> Float. We could even give the variables types, eg. SymbolicExpr (Set [Var "x" Float, Var "y" (Vector 3 Float)])!

Sadly, I live in the real world and not fantasy land. (It may be possible to implement this with data promotion? I haven't done much with it yet. But I'm skeptical of it typechecking nicely...)

One thing I've considered is using GADTs as in Dan Burton's really cool approach to implementing System F. But variables really shouldn't be ordered in this context; I really don't want to have something like SymbolicExpr (Int -> Int -> Int) for a symbolic expression with 2 integer variables, because there's no real reason for x or y to be the variable in first or second position. And for relationships between expressions, it would be the programmers job to relate positions, which is silly (locally, a monad could generate variables, but globally this would get ugly). It really needs to be a type-level thing.

My bad solution for now has been to just not have type-level variable representation, which kind of bothers me. And generally, when one part of a program is ugly, I find it difficult to motivate myself to make other parts pretty. :(

I'm planning to come back to this at some point, but I want to sit on it for a little while and think. Your feedback would be greatly appreciated; you can reach me at chris@colah.ca.

Something went wrong with that request. Please try again.