Declarative Programming with Function Patterns

  • Sergio Antoy
  • Michael Hanus
Conference paper

DOI: 10.1007/11680093_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3901)
Cite this paper as:
Antoy S., Hanus M. (2006) Declarative Programming with Function Patterns. In: Hill P.M. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2005. Lecture Notes in Computer Science, vol 3901. Springer, Berlin, Heidelberg


We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns” have many advantages over traditional constructor patterns. They allow a direct representation of specifications as declarative programs, provide better abstractions of patterns as first-class objects, and support the high-level programming of queries and transformation of complex structures. Moreover, they avoid known problems that occur in traditional programs using strict equality. We define their semantics via a transformation into standard functional logic programs. Since this transformation might introduce an infinite number of rules, we suggest an implementation that can be easily integrated with existing functional logic programming systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sergio Antoy
    • 1
  • Michael Hanus
    • 2
  1. 1.Computer Science Dept.Portland State UniversityOregonUSA
  2. 2.Institut für Informatik, CAU KielKielGermany

Personalised recommendations