Browse > Article

Index Transitivity and Transformation of Separable Systems  

변석우 (경성대학교 컴퓨터과학과)
Publication Information
Journal of KIISE:Software and Applications / v.31, no.5, 2004 , pp. 658-666 More about this Journal
Abstract
Separable systems are defined in term rewriting systems, respecting the notion of separability in the λ-calculus. In this research, we generalize separable systems of term rewriting systems, which was studied in restrictive systems such as constructive systems. We also associate separability with index-transitivity and with forward branching Separability is identified with forward branching, and strong sequentiality with index-transitivity satisfies separability. These are such good properties that enable us to describe the procedure of pattern-matching as an index tree, which is a sort of automata, and to transform separable systems into a constructor system with a simple pattern. Separable systems, in particular, can be translated into the λ-calculus. This research can serve a theoretical basis which allows functional languages to be explained by the λ-calculus, since functional languages such as ML and Haskell belong to a subclass of separable systems.
Keywords
the lambda calculus; term rewriting systems; sequentiality; separability;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Byun, J.R. Kennaway, R. Sleep, Transformation of orthogonal term rewriting systems, Lecture Notes in Computer Science 1023, pp. 73-87, Springer-Verlag, 1995   DOI
2 H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North-Holland, 1984
3 I. Durand, Bounded, strongly sequential, and forward branching term rewriting systems, J. of Symbolic Computation, 18:319-352, Springr-Verlag, 1994   DOI   ScienceOn
4 B. Saliner and R. Strandh, Simulating forward-branching systems with constructor systems. TAPSOFT '97, M. Bidoit and M. Dauchet (eds.), Lecture Notes in Computer Science No. 1214, 153-164, 1997   DOI   ScienceOn
5 S. Thatte, On the correspondence between two classes of reduction systems, 20:83-85, 1985   DOI   ScienceOn
6 S. Peyton-Jones, The Implementation of Functional Programming Languages, Prentice-Hall, 1987
7 J.W. Klop. Term rewriting systems, In Abramsky et al., editors, Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992
8 N. Dershowitz and J.-P. Jounnaud, Rewrite Systems, in van Leeuwen (eds.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, 1990
9 G. Huet and J.-J. Levy, Computations in Orthogonal Rewrite Systems {Ⅰ} and {Ⅱ}, in Lassez and Plotkin, eds., Computatinal Logic : Essay in Honor of Alan Robinson, MIT Press, 1991. (Originally appeared as Technical Report 359, INRIA, 1979)
10 J.W. Klop and A. Middeldorp, Sequentiality in orthogonal term rewriting systems, Journal of Symbolic Computation, 12:161-195, 1991   DOI
11 Satish Thatte, On the correspondence between two classes of reduction systems, Information Processing Letters, 20:83-85, 1985   DOI   ScienceOn
12 J.R. Kennaway, The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewriting Systems, ESOP '90, Lecture Notes in Computer Science No. 432, Springer-Verlag, 1990   DOI
13 S. Byun, J.R. Kennaway, and R. Sleep, Lambda-definable Term Rewriting Systems, Lecture Notes in Computer Science 1179, pp. 106-115, Springer-Verlag, 1996   DOI   ScienceOn
14 R. Plasmeijer and M. Eekelen, Functional programming and parallel Graph rewriting, Addison-Wesley, 1993
15 S. Byun, Some properties of separable systems, J. of Korean Information Science Society (A), vol. 25, No. 4, April 1989