Thread: MAUDE

So I've been asked to implement a linked list in java using the following maude specification:


Below is a Maude specification of ‘Sorted Lists’: lists of integers in increasing order.

 
mod SORTED-LIST is
    protecting INT .
 
    sort SortedList .
 
    op empty : -> SortedList .
    op add : Int SortedList -> SortedList .
    op insert : Int SortedList -> SortedList .
 
    vars I J : Int .
    var L : SortedList .
 
    eq insert(I, empty) = add(I, empty) .
    cq insert(I, add(J, L)) = add(I, add(J,L)) if I <= J .
    cq insert(I, add(J, L)) = add(J, insert(I, L)) if I > J .
endm

What I would like to know, is what is the difference is between add and insert!?

Apparently they need to be implemented as two separate methods, but apart from this maude specification and the description above it, there is no other information available.

thanks!

Thanks Norm, found out that for this particular problem add is defined as a constructor in the Node class.

Ye that's what I thought, and I can't remember where I read it now but it said somewhere that the add operation itself should be implemented as a Node constructor, with the add functions in it but I guess it would still be called Node(). I'll have to have a look again tomorrow...

Is Maude quite commonly used amongst java programmers as a specification language? I really don't like it and it definitely annoys me more than it helps..