1 / 3

Maude 2.4 !!!

Maude 2.4 !!!. at the 2nd Rewrite Engines Competition (REC). New features. Several optimizations. Several bugs fixed. Built-in C/AC unification. Unification modulo C and AC. fmod AC+C is sort Elt Set . subsort Elt < Set . ops a b c d e z : -> Elt .

ava-cummings
Télécharger la présentation

Maude 2.4 !!!

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Maude 2.4 !!! at the2nd Rewrite Engines Competition (REC)

  2. New features • Several optimizations. • Several bugs fixed. • Built-in C/AC unification.

  3. Unification modulo C and AC fmod AC+C is sort Elt Set . subsort Elt < Set . ops a b c d e z : -> Elt . op f : Set Set -> Set [assoc comm] . op g : Set Set -> Set [comm] . vars U V W X Y Z : Set . vars A B C D E F : Elt . endfm Maude> unify f(g(X, Y), g(X, Z), U) =? f(g(Y, Z), V) . Decision time: 0ms cpu (1ms real) Solution 1 U --> f(#4:Set, g(#1:Set, #3:Set)) Z --> #1:Set X --> #2:Set Y --> #3:Set V --> f(#4:Set, g(#1:Set, #2:Set), g(#2:Set, #3:Set)) Solution 2 ...

More Related