|
From: Robert D. <rob...@gm...> - 2017-08-29 06:11:58
|
On 2017-08-28, Dimiter Prodanov <dim...@gm...> wrote: > Reg pattern matching. I have a general function called oppart , look into > clifford. It is very useful for expression transformations. It simply > splits an expression by a predicate and returns a pair of expressions. It > is definitely more useful for complicayed cases rather than simple pattern > matching. I dunno. The existing pattern matching code checks arguments against predicates too. What is the class of expressions for which oppart works and the existing pattern matcher does not? We are talking about embarking on a project to implement some substantial new functionality for the inverse Laplace transform. As we start down this road, I am pretty much dead set against reimplementing the existing pattern matching code in Maxima; there simply is no justification for it. We may well discover that there are gaps in the existing code for the purposes of this new project. When that happens, it's OK by me to implement the stuff that is missing. What I'm opposed to is reinventing the existing functionality. best Robert Dodier |