Dear list, with rewrite rules I can tell the compiler to replace "map id" by "id", but I still have to write that rule by hand.
Does anyone of you know about research into inferring such a rewrite rule automatically? I could imagine that for a function of type "f :: some -> args -> T a -> T b" and not-too-bad type constructors T it might be possible under what conditions on "some" and "args" infer when "f arg1 arg2 = id" holds, and if the conditions are fulfilled by functions like "id", generate a rewrite rule "f id id = id" automatically. Thanks, Joachim -- Joachim "nomeata" Breitner m...@joachim-breitner.de | nome...@debian.org | GPG: 0x4743206C xmpp: nome...@joachim-breitner.de | http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
