Lightweight Higher-Order Rewriting in Haskell

Axelsson, Emil,1978Chalmers tekniska högskola,Chalmers University of Technology (författare)

We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables and binders. Both sides of the rules are written as typed EDSL expressions, which leads to syntactically appealing rules and hides the underlying term representation. Matching is defined as an instance of Miller's higher-order pattern unification and has the same complexity as first-order matching. The restrictions of pattern unification are captured in the types of the library, and we show by example that the library is capable of expressing useful simplifications that might be used in a compiler.

Vezzosi, Andrea,1986Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)vezzosi (författare)
Chalmers tekniska högskola (creator_code:org_t)

Ingår i:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Cham : Springer International Publishing9547, s. 1-211611-33490302-9743

Om ämnet

NATURVETENSKAP: NATURVETENSKAP; och Data och informa ...; och Programvarutekni ...

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.