Higher-order associative commutative pattern matching for component retrieval

Hemer D. (2004). Higher-order associative commutative pattern matching for component retrieval. In: Electronic Notes in Theoretical Computer Science. Proceedings of Computing: The Australasian Theory Symposium (CATS), Dunedin, (116-133). January 19, 2004-January 20, 2004. doi:10.1016/j.entcs.2003.12.008


Author Hemer D.
Title of paper Higher-order associative commutative pattern matching for component retrieval
Conference name Proceedings of Computing: The Australasian Theory Symposium (CATS)
Conference location Dunedin
Conference dates January 19, 2004-January 20, 2004
Proceedings title Electronic Notes in Theoretical Computer Science   Check publisher's open access policy
Journal name Electronic Notes in Theoretical Computer Science   Check publisher's open access policy
Publication Year 2004
Sub-type Fully published paper
DOI 10.1016/j.entcs.2003.12.008
ISSN 1571-0661
Volume 91
Start page 116
End page 133
Total pages 18
Abstract/Summary In this paper we describe a higher-order associative commutative pattern matching algorithm. We are motivated by the need for developing tool support for matching user requirements against library component interfaces, both specified using a formal language. In developing such tool support we aim for a maximum level of recall, while at the same time maintaining a reasonable level of automation and effciency. In order to support adaptation of library components we assume the library components may contain higher-order parameters (representing types, functions and relations) - components are adapted by instantiating parameters to suit the requirements of the user. However with this assumption, the usual specification matching techniques, based on proving equivalence using a theorem prover based on first-order logic, are no longer useful in general. We therefore propose building tool support based on pattern matching, and increasing recall by providing (partial) support for matching expressions that can be shown to be equivalent by applying the laws of associativity and commutativity.
Subjects 1701 Psychology
Keyword Associative commutative matching
Component retrieval
Specification matching
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Conference Paper
Collection: Scopus Import
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 2 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 26 Jul 2016, 05:10:07 EST by System User