(Enter summary)
Abstract: this paper, the notion of Expression Reduction System (ERS) is introduced,
and the strict form of Church-Rosser property and minimal and maximal
strategies for S; E ; !; ff; fi (Update)
Context of citations to this paper: More
.... in [15] the Combinatory Reduction Systems (CRS) an early reference for Khasidashvili s Expression Reduction Systems (ERS ) is [14], Nipkow introduces Higher Order Rewrite Systems (HRS) in [16] Wolfram defines Higher Order Term Rewrite Systems (see [23] van Oostrom and...
...reduced to first order rewriting modulo an equational theory E . To do this, we choose to work with Expression Reduction Systems [18], and in particular, with de Bruijn based SERSDB as defined in [5] which facilitates the translation of higher order systems to first...
Cited by: More
Four Equivalent Equivalences of Reductions - van Oostrom, de Vrijer (2002)
(Correct)
Relative Normalization in Orthogonal Expression Reduction.. - Glauert, Khasidashvili (1994)
(Correct)
Termination and Confluence of Higher-Order Rewrite Systems - Blanqui
(Correct)
Active bibliography (related documents): More All
0.0: On the Longest Perpetual Reductions in Orthogonal Expression.. - Khasidashvili (2000)
(Correct)
0.0: On Higher Order Recursive Program Schemes - Zurab Khasidashvili
(Correct)
0.0: Perpetuality and Uniform Normalization in Orthogonal.. - Khasidashvili, Ogawa, al.
(Correct)
Similar documents based on text: More All
0.2: The Tbilisi Symposium on Logic, Language and.. - Ginzburg..
(Correct)
0.1: Normalization in λ-Calculus and Type Theory - Sørensen (1997)
(Correct)
0.1: β-Reductions and β-Developments of λ-Terms.. - Khasidashvili
(Correct)
Related documents from co-citation: More All
16: Combinatory Reduction System (context) - Klop - 1980
13: Higher-order critical pairs (context) - Nipkow - 1991
12: A general Church-Rosser theorem (context) - Aczel - 1978
BibTeX entry: (Update)
Khasidashvili Z. Expression Reduction Systems. Proceedings of I. Vekua Institute of Applied Mathematics of Tbilisi State University, vol. 36, 1990, p. 200-220. http://citeseer.ist.psu.edu/khasidashvili90expression.html More
@inproceedings{ khasidashvili90expression,
author = "Z. O. Khasidashvili",
title = "Expression reduction systems",
booktitle = "Proceedings of I. Vekua Institute of Applied Mathematics",
year = "1990",
url = "citeseer.ist.psu.edu/khasidashvili90expression.html" }
Citations (may not include all citations):
210
its Syntax and Semantics (context) - Lambda - 1984
174
Combinatory Reduction Systems (context) - Klop - 1980 ACM
33
Centre for Mathematics and Computer Science (context) - Rewriting, tutorial - 1987
13
Some problems of the Notation Theory (context) - Sh - 1977
1
Normalization of the -terms in the least number of steps (context) - Khasidashvili - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.sys.uea.ac.uk/~zurab/reports/reports.html): More
Higher Order Recursive Program Schemes are Turing Incomplete - Khasidashvili (1993)
(Correct)
Perpetuality and Uniform Normalization (Extended Abstract) - Khasidashvili, Ogawa
(Correct)
The Geometry of Conflict-free Reduction Spaces - Khasidashvili, Glauert (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC