Please use this identifier to cite or link to this item: doi:10.22028/D291-38730
Title: A Second-Order Matching Procedure for the Practical Use in a Program Transformation System
Author(s): Gerlach, Michael
Language: English
Year of Publication: 1983
Place of publication: Kaiserslautern
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: One way of transforming functions towards greater efficiency is to apply a transformation rule given in form of two program schemes. The first great step in applying such a rule is to recognize that a given function is an instance of such a program scheme. We describe a procedure for this task working on a second-order term language. Using this language it is possible to comprise the essential features of a wide class of programs into one scheme, independently of their arity as well as the number and arity of auxiliary functions used in their definitions.
Link to this record: urn:nbn:de:bsz:291--ds-387307
hdl:20.500.11880/35052
http://dx.doi.org/10.22028/D291-38730
Series name: Memo SEKI : SEKI-Projekt / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI
Series volume: 83,13
Date of registration: 30-Jan-2023
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Professorship: SE - Sonstige
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes



Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.