The refinement relation of graph-based generic programs extended abstract

Karl Lieberherr, Boaz Patt-Shamir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper studies a particular variant of Generic Programming, called Adaptive Programming (AP).W e explain the approach taken by Adaptive Programming to attain the goals set for Generic Programming. Within the formalism of AP, we explore the important problem of refinement: given two generic programs, does one express a subset of the programs expressed by the other? We show that two natural definitions of refinement coincide, but the corresponding decision problem is computationally intractable (co-NP-complete).W e proceed to define a more restricted notion of refinement, which arises frequently in the practice of AP, and give an efficient algorithm for deciding it.

Original languageEnglish
Title of host publicationGeneric Programming - International Seminar on Generic Programming, 1998, Selected Papers
EditorsMehdi Jazayeri, Rudiger G.K. Loos, David R. Musser
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540410904
StatePublished - 2000
EventInternational Seminar on Generic Programming, 1998 - Dagstuhl Castle, Germany
Duration: 27 Apr 19981 May 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Seminar on Generic Programming, 1998
CityDagstuhl Castle


Dive into the research topics of 'The refinement relation of graph-based generic programs extended abstract'. Together they form a unique fingerprint.

Cite this