Inversion Framework: Reasoning about Inversion by Conditional Term Rewriting Systems

Maja Hanne Kirkeby, Robert Glück

Publikation: KonferencebidragPaperForskningpeer review

Abstract

We introduce a language-independent framework for reasoning about program inverters by conditional term rewriting systems. These systems can model the three fundamental forms of inversion, i.e., full, partial and semi-inversion, in declarative languages.

The correctness of the generic inversion algorithm introduced in this contribution is proven for all well-behaved rule inverters, and we demonstrate that this class of inverters encompasses several of the inversion algorithms published throughout the past years.

This new generic approach enables us to establish fundamental properties, e.g., orthogonality, for entire classes of well-behaved full inverters, partial inverters and semi-inverters regardless of their particular local rule inverters. We study known inverters as well as classes of inverters that yield left-to-right deterministic systems; left-to-right determinism is a desirable property, e.g., for functional programs; however, at the same time it is not generally a property of inverted systems. This generic approach enables a more systematic design of program inverters and fills a gap in our knowledge of program inversion.
OriginalsprogEngelsk
Publikationsdato1 sep. 2020
Antal sider14
DOI
StatusUdgivet - 1 sep. 2020
BegivenhedInternational Symposium on Principles and Practice of Declarative Programming - University of Bologna, Bologna, Italien
Varighed: 8 sep. 202010 sep. 2020
Konferencens nummer: 22
http://www.cse.chalmers.se/~abela/ppdp20/

Konference

KonferenceInternational Symposium on Principles and Practice of Declarative Programming
Nummer22
LokationUniversity of Bologna
LandItalien
ByBologna
Periode08/09/202010/09/2020
Internetadresse

Emneord

  • program inversion

Citer dette