[Haskell-cafe] Propositional logic implementation

Miguel Mitrofanov miguelimo38 at yandex.ru
Sat Jan 10 18:04:20 EST 2009

Look at SYB (Data.Data, Data.Generics.*). For example, your "symbols"  
function can be rewritten as

symbols :: Sentence -> [Symbol]
symbols s = nub $ listify (const True) s

"true" is not that simple, because this code is NOT boilerplate - each  
alternative is valuable by itself.

On 10 Jan 2009, at 23:56, Andrew Wagner wrote:

> All,
> Is there some better way to do this? It seems like a lot of  
> boilerplate. Thanks!
> http://hpaste.org/13807#a1
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe

More information about the Haskell-Cafe mailing list