Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Declarative Programming with Function Patterns # Sergio Antoy 1 Michael Hanus 2
 

Summary: Declarative Programming with Function Patterns #
Sergio Antoy 1 Michael Hanus 2
1 Computer Science Dept., Portland State University, Oregon, U.S.A.
antoy@cs.pdx.edu
2 Institut f˜ ur Informatik, CAU Kiel, D­24098 Kiel, Germany.
mh@informatik.uni­kiel.de
Logic Based Program Synthesis and Transformation: 15th Int'nl Symp., LOPSTR 2005
London, UK, September 7--9, 2005
c
# Springer­Verlag LNCS Vol. 3901, pages 6--22
Abstract. 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 pat­
terns. 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. More­
over, 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

  

Source: Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences