Partial inversion of constructor term rewriting systems

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 264-278

  Nishida, Naoki ^a   Sakai, Masahiko ^a   Sakabe, Toshiki ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAM LISTINGS; PROGRAM COMPILERS; SEMANTICS; SYSTEMS ANALYSIS;

INVERSE COMPUTATION; PARTIAL-INVERSION COMPILERS; REWRITING SYSTEMS;

TECHNICAL WRITING;

EID: 24944453254     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_20     Document Type: Conference Paper

References (25)

1. Abramov, S., Glück, R.: The universal resolving algorithm: Inverse computation in a functional language. In Proceedings of the 5th International Conference on Mathematics of Program Construction. Volume 1837 of LNCS, Springer (2000) 187-212.
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998).
3. Dershowitz, N., Mitra, S.: Jeopardy. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications. Volume 1631 of LNCS, Springer (1999) 16-29.
4. Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving termination of membership equational programs. In Proceedings of the ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation. ACM Press (2004) 147-158.
5. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications. Volume 3091 of LNCS, Springer (2004) 210-220.
6. Glück, R., Kawabe, M.: A program inverter for a functional language with equality and constructors. In Proceedings of the first Asian Symposium on Programming Languages and Systems. Volume 2895 of LNCS, Springer (2003) 246-264.
7. Harrison, P.G.: Function inversion. In Proceedings of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation. North-Holland (1988) 153-166.
8. Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications. Volume 2706 of LNCS, Springer (2003) 311-320.
9. Hu, Z., Mu, S.-C., Takeichi, M.: A programmable editor for developing structured documents based on bidirectional transformations. In Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation. ACM Press (2004) 178-189.
10. Hullot, J.-M.: Canonical forms and unification. In Proceedings of the 5th International Conference on Automated Deduction. Volume 87 of LNCS, Springer (1980) 318-334.
11. Khoshnevisan, H., Sephton, K.M.: InvX: An automatic function inverter. In Proceedings of the 3rd International Conference on Rewriting Techniques and Applications. Volume 355 of LNCS, Springer (1989) 564-568.
12. Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998 (1). The MIT Press (1998) 1-61.
13. Lucas, S.: MU-TERM: A tool for proving termination of context-sensitive rewriting. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications. Volume 3091 of LNCS, Springer (2004) 200-209.
14. Marchiori, M.: Unravelings and ultra-properties. In Proceedings of the 5th International Conference on Algebraic and Logic Programming. Volume 1139 of LNCS, Springer (1996) 107-121.
15. Nishida, N., Sakai, M., Sakabe, T.: Generation of inverse term rewriting systems for pure treeless functions. In Proceedings of the International Workshop on Rewriting in Proof and Computation. Sendai, Japan (2001) 188-198.
16. Nishida, N., Sakai, M., Sakabe, T.: Narrowing-based simulation of term rewriting systems with extra variables and its termination proof. In Functional and Constraint Logic Programming. Volume 86 of ENTCS, Issue 3, Elsevier (2003) 18 pages.
17. Nishida, N., Sakai, M., Sakabe, T.: On simulation-completeness of unraveling for conditional term rewriting systems. Technical Report SS 2004-18 of IEICE (2004) 25-30.
18. Nishida, N., Sakai, M., Sakabe, T.: Partial inversion of constructor term rewriting systems. Full version of this paper including the proofs of theorems (2005). Available from http://www.sakabe.i.is.nagoya-u.ac.jp/~nishida/papers/.
19. Ohlebusch, E.: Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering, Communication and Computing 12 (2001) 73-116.
20. Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer (2002).
21. Okamoto, K., Sakai, M., Sakabe, T.: Completeness of innermost strategy for inside-LR-joinable right-linear terminating TRSs. In Record of 2003 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers. (2003) 564 (in Japanese). This is an extended result of [23], and the English version of this paper is available from http://www.sakabe.i.is. nagoya-u.ac.jp/~sakai/papers/.
22. Romanenko, A.: Inversion and metacomputation. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation. Volume 26 of SIGPLAN Notices, ACM Press (1991) 12-22.
23. Sakai, M., Okamoto, K., Sakabe, T.: Innermost reductions find all normal forms on right-linear terminating overlay TRSs. In Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming. Valencia, Spain (2003) 79-88.
24. Secher, J.P., Sørensen, M.H.: From checking to inference via driving and dag grammars. In Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. Volume 37 of SIGPLAN Notices, ACM (2002) 41-51.
25. Toyama, Y.: Confluent term rewriting systems with membership conditions. In Proceedings of the 1st International Workshop on Conditional Term Rewriting Systems. Volume 308 of LNCS, Springer (1987) 228-241.