PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Equational reasoning and term rewriting systems
Handbook of logic in artificial intelligence and logic programming (vol. 1)
Undecidable properties of deterministic top-down tree transducers
Theoretical Computer Science
Term rewriting and all that
Advanced topics in term rewriting
Advanced topics in term rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Revisiting an automatic program inverter for Lisp
ACM SIGPLAN Notices
A Method for Automatic Program Inversion Based on LR(0) Parsing
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Bidirectionalization transformation based on automatic derivation of view complement functions
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Semi-inversion of functional parameters
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Completion after Program Inversion of Injective Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational termination of conditional term rewriting systems
Information Processing Letters
Automatic partial inversion of inductively sequential functions
IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Semi-inversion of guarded equations
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Computationally equivalent elimination of conditions
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Slothrop: Knuth-Bendix completion with a modern termination checker
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A grammar-based approach to invertible programs
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A grammar-based approach to invertible programs
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient conditions for injectivity of functions in term rewriting, which are based on program inversion. More precisely, we show that functions defined by non-erasing, convergent and sufficiently complete constructor rewrite systems are injective if the corresponding inverse-computation rewrite systems generated by the inversion framework are innermost-confluent. By using this property, we also show a syntactic sufficient-condition of injectivity.