Richard Kennaway, Jan Willem Klop, Ronan Sleep, Fer-Jan De Vries  Home/Search
Context Related
| hatoyama.hitachi.co.jp/peopl...curry.ps mcs.le.ac.uk/~ferjan/Dist...curry.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: hatoyama.hitachi.co...proceedings (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we show that strong normalization (SN), weak normalization (WN), the weak Church-Rosser property (WCR), the unique normal form property (UN), completeness, and semi-completeness are preserved by currying. For left-linear term rewrite systems we show that currying also preserves the normal form property (NF) and the UN (Update)
Context of citations to this paper: More
...by Lemma 2.3, the process terminates, giving a normal form of t. 2 Acknowledgements An earlier version of this paper appeared in Kennaway et al. 1993. We would like to acknowledge the help and criticism of Vincent van Oostrom, Aart Middeldorp, Femke van Raamsdonk, Yoshihito...
...least the very useful lemma 5.2 does not hold in this generalised setting. Similar problems exist with the method employed by Kennaway et.al. 1993) to prove the preservation of SN. One may think that HRSs support currying anyway, but this is only true for the simply typed...
Cited by: More
Proving and Disproving Termination of Higher-Order.. - Giesl, Thiemann.. (2005) (Correct)
Type Systems for the Object-Oriented Paradigm - Bono (1999) (Correct)
Confluence of Curried Term-Rewriting Systems - Kahrs (1995) (Correct)
Similar documents (at the sentence level):
66.9%: Comparing Curried and Uncurried Rewriting - Kennaway, Klop, Sleep, De Vries (1998) (Correct)
Active bibliography (related documents): More All
0.2: Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997) (Correct)
0.2: Interpreting Functions as π-Calculus Processes: A Tutorial - Sangiorgi (1999) (Correct)
0.2: Extending a Functional Programming System for Embedded.. - Wallace, Runciman (1995) (Correct)
Similar documents based on text: More All
0.2: Infinitary Lambda Calculus - Kennaway, Klop, Sleep, de Vries (1995) (Correct)
0.2: Perceptual Control Theory - Vol No Control (Correct)
0.2: Syntactic definitions of undefined: on defining the undefined.. - Ariola, al. (1994) (Correct)
Related documents from co-citation: More All
6: Confluence of curried term rewriting systems - Kahrs - 1994
4: Toward formal development of programs from algebraic specifications: Implementat.. - Sannella, Tarlecki - 1988
3: Universitat Bremen (context) - Kahrs, thesis - 1991
BibTeX entry: (Update)
Kennaway, J.R., J.R., Klop, J.W., Sleep, M.R., and de Vries,F.J., Comparing Curried and Uncurried Rewriting, J. Symbolic Computation, 1995 to appear. http://citeseer.ist.psu.edu/article/kennaway95comparing.html More
@article{ kennaway96comparing,
author = "Richard Kennaway and Jan Willem Klop and M. Ronan Sleep and Fer-Jan de Vries",
title = "Comparing Curried and Uncurried Rewriting",
journal = "Journal of Symbolic Computation",
volume = "21",
number = "1",
pages = "15-39",
year = "1996",
url = "citeseer.ist.psu.edu/article/kennaway95comparing.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1989
259 Combinatory Logic (context) - Curry, Feys - 1958
174 Combinatory Reduction Systems (context) - Klop - 1980
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
86 Functional Programming (context) - Field, Harrison - 1988
63 Modular Properties of Term Rewriting Systems (context) - Middeldorp - 1990
48 Completeness of combinations of constructor systems - Middeldorp, Toyama - 1991
22 Modular aspects of properties of term rewriting systems rela.. (context) - Middeldorp - 1989
18 Termination for direct sums of left-linear complete term rew.. (context) - --, Klop et al. - 1994
13 Comparing curried and uncurried rewriting - Kennaway, Klop et al. - 1993
13 Completeness of hierarchical combinations of term rewriting .. (context) - Rao - 1993
7 Confluence of curried term rewriting systems - Kahrs - 1994
4 Expressions as processes (context) - Kennaway, Sleep - 1982
2 the Church-Rosser property for the direct sum of term rewrit.. (context) - Computation, Toyama et al. - 1987
1 Well-quasi-ordering (context) - In, Science et al. - 1960
1 Comparing Curried and Uncurried Rewriting 25 Klop (context) - Amsterdam - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hatoyama.hitachi.co.jp/people/devries/proceedings.html):
Infinitary Lambda Calculus - Richard Kennaway (1997) (Correct)
Syntactic definitions of undefined: on defining the undefined.. - Ariola, al. (1994) (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