Advertisement

Specifying Parameterized Data Structures in Maude

  • Manuel Clavel
  • Francisco Durán
  • Steven Eker
  • Patrick Lincoln
  • Narciso Martí-Oliet
  • José Meseguer
  • Carolyn Talcott
  • Miguel Palomino
  • Alberto Verdejo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4350)

Abstract

This chapter describes the equational specification in Maude of a series of typical data structures, complementing in this way the list and set data structures provided as predefined modules in Maude and described in Section 9.12.

We start with the well-known stacks, queues, lists, and multisets to continue with binary and search trees; not only are the simple versions considered, but also advanced ones such as AVL and 2-3-4 trees. The operator attributes available in Maude allow the specification of data based on constructors that satisfy some equational properties, like concatenation of lists which is associative and has the empty list as identity, as opposed to the free constructors available in other functional programming languages. Moreover, the expressive version of equational logic on which Maude is based, namely membership equational logic, allows the faithful specification of types whose data are defined not only by means of constructors, but also by the satisfaction of additional properties, like sorted lists, search trees, balanced trees, etc. We will see along this chapter how this is accomplished by means of membership assertions that equationally characterize the properties satisfied by the corresponding data.

Keywords

Binary Tree Search Tree Priority Queue Binary Search Tree Empty List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Manuel Clavel
    • 1
  • Francisco Durán
    • 2
  • Steven Eker
    • 3
  • Patrick Lincoln
    • 3
  • Narciso Martí-Oliet
    • 1
  • José Meseguer
    • 4
  • Carolyn Talcott
    • 5
  • Miguel Palomino
  • Alberto Verdejo
  1. 1.Universidad Complutense de Madrid, Facultad de Informática, Departamento de Sistemas Informáticos y Computación, s/n 28040 MadridSpain
  2. 2.Universidad de Málaga, Departamento de Lenguajes y Ciencias de la Computación, Boulevard Louis Pasteur, s/n. Campus de Teatinos, 29071 MálagaSpain
  3. 3.SRI International, Computer Science Laboratory, 333 Ravenswood Ave., Menlo Park, CA 94025-3493USA
  4. 4.University of Illinois at Urbana-Champaign, Department of Computer Science, Siebel Center for Computer Science, 201 N. Goodwin, Urbana, IL 61801-2302USA
  5. 5.SRI InternationalUSA

Personalised recommendations