Browse > Article

Translation of Separable Systems into the Lambda Calculus  

Byun, Sug-Woo (경성대학교 컴퓨터정보학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.35, no.4, 2008 , pp. 178-185 More about this Journal
Abstract
This research presents an translation technique of encoding rewrite rules with patterns into the lambda calculus. We show, following the theory of Böhm separability, rewrite rules with distinctive patterns, called separable systems, can be translated into the lambda calculus. Moreover, according to the property of Böhm equivalence classes, we can also encode rewrite systems with default rules, which allows to interpret some of 'undefined' terms of TRSs as an identified lambda term.
Keywords
Separability; Term Rewriting Systems; Bö hm trees; Lambda Calculus; Translation;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 G. Berry. Stable models of typed ${\lambda}-calculi.$ In Automata and Languages and Programming. Lecture Notes in Computer Science 62, pp. 72-89, Springer-Verlag, 1978
2 G. Huet and J.-J. Levy. Computations in Orthogonal Rewrite Systems I and II. In Lassez and Plotkin, eds., Computational Logic: Essay in Honor of Alan Robinson, MIT Press 1991. (Originally appeared as Technical Report 359, INRIA, 1979.)
3 S. Byun, Translation of Functions into the Lambda- Calculus. 기초과학연구소 논문집, 제 15권, 3호, pp 261-269, 경성대학교 기초과학연구원, 2004
4 A. Berarducci and C. Bohm, A self-interpreter of lambda calculus having a normal form. In CSL- 92, Lecture Notes in Computer Science 702, pp. 85-99, Springer-Verlag, 1992
5 J.R. Kennaway, F.J. de Vries and V. van Oostrom, Meaningless terms in rewriting. Journal of Functional and Logic Programming, 1999
6 C. Bohm. Alcune proprieta delle forme ${\beat}-{\eta}-normalinel$ {\lambda}-K-calcolo.$ IAC Pubbl., 696:19, 1968
7 S. Byun, J.R. Kennaway, and R. Sleep. Lambda- definable Term Rewriting Systems. In Asian Computer Science Conference `96, Lecture Notes in Computer Science 1023, pp 106-115, Springer- Verlag, 1996
8 변석우, 분리가능 시스템의 지수 추이성과 변환. 정보과학회논문지 제31권 제5호, pp. 658-666, 2004년 5월
9 N. Dershowitz and J.-P. Jouannaud and J.W. Klop. Open problems in rewriting - no. 1. In 4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 488, pp. 445-456, Springer-Verlag, 1991
10 H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1984
11 J.W. Klop. Term rewriting systems. In Abramsky et al., editors, Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992