Journal of KIISE:Software and Applications (한국정보과학회논문지:소프트웨어및응용)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Transformation of Orthogonal Term Rewriting Systems based on Separability

분리성에 기반한 직교항 개서 시스템의 변환

  • 변석우 (경성대학교 정보과학부)
  • Published : 2001.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

직교항 개서 시스템은 함수형 언어와 그 구현 과정을 잘 반영하고 있다. 본 논문에서는 룰의 왼쪽 부분을 매우 간략한 형태로 된 flat 시스템으로 번역하는 기법에 대해서 논의한다. 직교항 개서 시스템의 한 부류인 transformable OTRSs를 정의하고, 이 시스템들은 flat 시스템으로 변환될 수 있음을 보인다. 이 변환은 람다 계산법에서 연구된 분리성 이론을 기반으로 하고 있는데, 본 논문에서는 직교항 개서 시스템에서의 분리성과 강력 순차성에 대한 연관성에 대해서도 논의하고 있다.

Keywords

References

  1. G. Huet and J.-J. Levy. Computations in orthogonal rewrite systems I and II. In Lassez and Plotkin[12], pp. 394-443. (Originally appeared as[13].)
  2. J.W. Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. CWI, Amsterdam, 1980. PhD Thesis
  3. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In van Leeuwen[14], chapter 15
  4. J.W. Klop. Term rewriting systems. In Abramsky et al. [15], pp. 1-116
  5. J.R. Kennaway. Implementing term rewriting languages in Dactl. Theoretical Computer Science, 72 : 225-249, 1990 https://doi.org/10.1016/0304-3975(90)90036-H
  6. L. Maranget. Two techniques for compiling lazy pattern matching. Technical Report 2385, INRIA, 1994
  7. Y. Toyama, S. Smetsers, M.C.J.D. van Eekelen, and M. J. Plasmeijer. The functional strategy and transitive term rewriting systems. In Sleep et al. [16], pp. 61-75
  8. J.W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewriting systems. Journal of Symbolic Computation, 12 : 161-195, 1991
  9. H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, second edition, 1984
  10. Z. Ariola, J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Syntactic definitions of undefined: On defining the undefined. In Theoretical Aspect of Computer Software, Springer-Verlag, Lecture Notes in Computer Science 789, pp. 543-554, 1994
  11. S. Byun. The Simulation of Term Rewriting Systems by the Lambda Calculus. PhD thesis, Univeristy of East Anglia, 1994
  12. J.-L. Lassez and G.D. Plotkin, editors. Computational Logic:Essay in Honor of Alan Robinson. MIT Press, 1991
  13. G. Huet and J.-J. Levy. Call-by-need computations in non-ambiguous. Technical Report 359, INRIA, 1979
  14. J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Method and Semantics. North-Holland, Amsterdam, 1990
  15. S. Abramsky, D. Gabbay, and T. Maibaum, editors. Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992
  16. M.R. Sleep, M.J. Plasmeijer, and M.C.J.D. van Eekelen, editors. Term Graph Rewriting Theory and Practice. John Wiley & Sons, 1993