Proving injectivity of functions via program inversion in term rewriting

DOI10.1007/978-3-642-12251-4_21MaRDI QIDQ3558345zbMATH OpenOpenAlexFDO

Authors Naoki Nishida, Masahiko Sakai

Publication date 4 May 2010

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12251-4_21

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Completion after program inversion of injective functions
• Injectivity of composite functions
• Program inversion for tail recursive functions
• Term Rewriting and Applications
• On sufficient-completeness and related properties of term rewriting systems

Cited in

(3)

• Injectivity of composite functions
• Completion after program inversion of injective functions
• Program inversion for tail recursive functions

Describes a project that uses

Uses Software

• AProVE
• Slothrop

This page was built for publication: Proving injectivity of functions via program inversion in term rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558345)