Completion after Program Inversion of Injective Functions

Electronic Notes in Theoretical Computer Science

Volumn 237, Issue C, 2009, Pages 39-56

  Nishida, Naoki ^a   Sakai, Masahiko ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

conditional term rewriting system; convergence; innermost reduction; unraveling

Indexed keywords

CONDITIONAL TERM REWRITING SYSTEM; CONVERGENCE; CONVERGENT SYSTEMS; INNERMOST REDUCTION; INVERSE RELATIONS; INVERSE SYSTEMS; KNUTH-BENDIX COMPLETIONS; POST PROCESSORS; PROGRAM INVERSIONS; TERM REWRITING SYSTEMS; UNRAVELING;

PROGRAM COMPILERS;

EID: 62949230354     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.03.034     Document Type: Article

References (34)

1. Abramov S., and Glück R. The universal resolving algorithm and its correctness: Inverse computation in a functional language. Science of Computer Programming 43 (2002) 193-229
2. Almendros-Jiménez, J.M. and G. Vidal, Automatic partial inversion of inductively sequential functions, in: Proc. of the 18th International Symposium on Implementation and Application of Functional Languages, Lecture Notes in Computer Science 4449 (2006), pp. 253-270
3. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press, United Kingdom
4. Dershowitz, N. and S. Mitra, Jeopardy, in: Proceedings of the 10th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1631, 1999, pp. 16-29
5. Fülöp Z. Undecidable properties of deterministic top-down tree transducers. Theoretical Computer Science 134 (1994) 311-328
6. Giesl, J., P. Schneider-Kamp and R. Thiemann, Automatic termination proofs in the dependency pair framework, in: Proc. of the 3rd International Joint Conference on Automated Reasoning, Lecture Notes in Computer Science 4130 (2006), pp. 281-286
7. Glück R., and Kawabe M. A method for automatic program inversion based on LR(0) parsing. Fundam. Inform. 66 4 (2005) 367-395
8. Gramlich, B., On the (non-)existence of least fixed points in conditional equational logic and conditional rewriting, in: Proc. 2nd Int. Workshop on Fixed Points in Computer Science - Extended Abstracts (2000), pp. 38-40
9. Kawabe, M. and Y. Futamura, Case studies with an automatic program inversion system, in: Proc. of the 21st Conference of Japan Society for Software Science and Technology, 6C-3, 2004, pp. 1-5
10. Kawabe, M. and R. Glück, The program inverter LRinv and its structure, in: Proc. of the 7th International Symposium on Practical Aspects of Declarative Languages, Lecture Notes in Computer Science 3350 (2005), pp. 219-234
11. Knuth D.E., and Bendix P.B. Simple word problems in universal algebra. Computational Problems in Abstract Algebra (1970) 263-297
12. Krishna Rao M.R.K. Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems. Acta Informatica 33 6 (1996) 595-606
13. Lucas S. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998 1 (1998)
14. Lucas S., Marché C., and Meseguer J. Operational termination of conditional term rewriting systems. Information Processing Letters 95 4 (2005) 446-453
15. Marchiori, M., Unravelings and ultra-properties, in: Proc. of the 5th International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science 1139 (1996), pp. 107-121
16. Marchiori, M., On deterministic conditional rewriting, Computation Structures Group, Memo 405, MIT Laboratory for Computer Science (1997)
17. Matsuda, K., Z. Hu, K. Nakano, M. Hamana and M. Takeichi, Bidirectionalization transformation based on automatic derivation of view complement functions, in: Proc. of the 12th ACM SIGPLAN International Conference on Functional Programming (2007), pp. 47-58
18. McCarthy J. The inversion of functions defined by Turing machines. Automata Studies (1956), Princeton University Press 177-181
19. Mogensen, T. Æ., Semi-inversion of guarded equations., in: Proc. of the 4th International Conference on Generative Programming and Component Engineering, Lecture Notes in Computer Science 3676 (2005), pp. 189-204
20. Mogensen, T. Æ., Semi-inversion of functional parameters, in: Proc. of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (2008), pp. 21-29
21. Nishida N., and Sakai M. Completion as Post-Process in Program Inversion of Injective Functions. http://www.trs.cm.is.nagoya-u.ac.jp/~nishida/papers/ (2008), the full version of this paper
22. Nishida, N., M. Sakai and T. Kato, Convergent term rewriting systems for inverse computation of injective functions, in: Proc. of the 9th International Workshop on Termination (2007), pp. 77-81
23. Nishida, N., M. Sakai and T. Sakabe, On simulation-completeness of unraveling for conditional term rewriting systems, IEICE Technical Report SS2004-18, (2004), vol. 104, No. 243, pp. 25-30
24. Nishida N., Sakai M., and Sakabe T. Generation of inverse computation programs of constructor term rewriting systems. The IEICE Trans. Inf.& Syst. J88-D-I 8 (2005) 1171-1183 (in Japanese)
25. Nishida, N., M. Sakai and T. Sakabe, Partial inversion of constructor term rewriting systems, in: Proc. of the 16th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3467 (2005), pp. 264-278
26. Ohlebusch E. Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering, Communication and Computing 12 1-2 (2001) 73-116
27. Ohlebusch E. Advanced Topics in Term Rewriting (2002), Springer-Verlag
28. Romanenko A. Inversion and metacomputation. Proc. of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SIGPLAN Notices 26 (1991) 12-22
29. Schernhammer, F. and B. Gramlich, On proving and characterizing operational termination of deterministic conditional rewrite systems, in: Proc. of the 9th International Workshop on Termination (2007), pp. 82-85
30. Serbanuta, T.-F. and G. Rosu, Computationally equivalent elimination of conditions, in: Proc. of the 17th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 4098 (2006), pp. 19-34
31. Terese. Term Rewriting Systems (2003), Cambridge University Press
32. Toyama Y. How to prove equivalence of term rewriting systems without induction. Theoretical Computer Science 90 2 (1991) 369-390
33. Viry P. Elimination of conditions. Journal of Symbolic Computation 28 3 (1999) 381-401
34. Wehrman, I., A. Stump and E.M. Westbrook, Slothrop: Knuth-Bendix completion with a modern termination checker, in: Proc. of the 17th International Conference on Term Rewriting and Applications, Lecture Notes in Computer Science 4098 (2006), pp. 287-296