Jan Willem Klop, Vincent van Oostrom, et al.  Home/Search
Context Related
| cs.vu.nl/pub/oostrom/IR327.ps.Z cs.vu.nl/pub/papers/theor...IR327.ps.Z dmi.ubi.pt/~desousa/logica/kor.ps 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: fermivista.math.ju...ftp.cs.vu.nl (more) From: sics.se/~ara/intros (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Combinatory Reduction Systems, or CRSs for short, were designed to combine the usual first-order format of term rewriting with the presence of bound variables as in pure -calculus and various typed -calculi. Bound variables are also present in many other rewrite systems, such as systems with simplification rules for proof normalization. The original idea of CRSs is due to Aczel, who introduced a restricted class of CRSs and, under the assumption of orthogonality, proved confluence.... (Update)
Cited by: More
Definitions by Rewriting in the Calculus of Constructions - Blanqui (2001) (Correct)
A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004) (Correct)
Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2003) (Correct)
Active bibliography (related documents): More All
0.5: Relational Treatment of Term Graphs With Bound Variables - Kahl (1998) (Correct)
0.5: Multi Agent Implementation Techniques With Objects And Software.. - Nourani (1996) (Correct)
0.4: Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997) (Correct)
Similar documents based on text: More All
0.8: Compilation of Combinatory Reduction Systems - Kahrs (1993) (Correct)
0.7: Comparing Combinatory Reduction Systems and.. - van Oostrom, van.. (1993) (Correct)
0.6: Descendants and Head Normalization of Higher-Order Rewrite.. - Kasuya, Sakai, Agusa (Correct)
Related documents from co-citation: More All
23: Combinatory Reduction System (context) - Klop - 1980
22: Lambda Calculi with Types - Barendregt - 1992
21: Rewrite systems - Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
Klop, J. W., van Oostrom, V. and van Raamsdonk, F. (1993). Combinatory reduction systems: Introduction and survey. Theoretical Computer Science 121: 279--308. http://citeseer.ist.psu.edu/klop93combinatory.html More
@article{ klop93combinatory,
author = "Jan Willem Klop and Vincent van Oostrom and Femke van Raamsdonk",
title = "Combinatory reduction systems: introduction and survey",
journal = "Theoretical Computer Science",
volume = "121",
number = "1--2",
pages = "279--308",
year = "1993",
url = "citeseer.ist.psu.edu/klop93combinatory.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1989 ACM DBLP
474 Term rewriting systems - Klop - 1992
283 Theoretical Computer Science (context) - Plotkin, language - 1977 ACM
210 its Syntax and Semantics (context) - Barendregt, Calculus - 1984
174 Combinatory Reduction Systems (context) - Klop - 1980 ACM
151 An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986 ACM
126 Higher-order critical pairs (context) - Nipkow - 1991 DBLP
116 Ideas and results in proof theory (context) - Prawitz - 1971
93 A complete inference system for a class of regular behaviour.. (context) - Milner - 1984
92 Explicit substitutions - Abadi, Cardelli et al. - 1990 ACM DBLP
63 Modular Properties of Term Rewriting Systems (context) - Middeldorp - 1990
55 Combining algebra and higher-order types (context) - Breazu-Tannen - 1988 DBLP
54 Polymorphic rewriting conserves algebraic strong normalizati.. (context) - Breazu-Tannen, Gallier - 1989 ACM DBLP
50 Introduction to Mathematical Logic (context) - Church - 1956
46 Orthogonal Higher-Order Rewrite Systems are Confluent (context) - Nipkow - 1993 ACM DBLP
46 Proof Theory and Logical Complexity (context) - Girard - 1987
45 Strong Normalization for a Typed Lambda-calculus with Lambda.. (context) - Nederpelt - 1973
39 Transactions of the American Mathematical Society (context) - Hindley, normal - 1978
39 Transactions of the American Mathematical Society (context) - Hindley, of - 1977
37 A general Church-Rosser theorem (context) - Aczel - 1978
32 Logical Foundations of Functional Programming (context) - Huet - 1990 ACM
30 Research Notes in Theoretical Computer Science (context) - Curien, Sequential et al. - 1986
28 Proofs of strong normalization (context) - Gandy - 1980
27 Church-Rosser Theorem in Orthogonal Combinatory Reduction Sy.. (context) - Khasidashvili - 1992
25 volume 1 of London Mathematical Society Student Texts (context) - Hindley, Seldin et al. - 1986
22 Sequential evaluation strategies for parallel-or and related.. (context) - Kennaway - 1989
22 Functional programming and lambda-calculus (context) - Barendregt - 1989
21 A theory of binding structures and applications to rewriting - Talcott - 1991 ACM DBLP
19 calculi with conditional rules (context) - Takahashi - 1993
19 Confluence and superdevelopments (context) - van Raamsdonk - 1993 ACM DBLP
15 The Clausal Theory of Types (context) - Wolfram - 1993 ACM
14 Typed lambda-calculi (context) - Barendregt - 1992
13 Confluence of the lambda-calculus with left-linear algebraic.. (context) - Muller - 1992
13 Unique normal forms for lambda calculus with surjective pair.. (context) - Klop, de Vrijer - 1989 ACM DBLP
10 terms and Proof Theory (context) - Stenlund - 1972
8 volume 6 of Annals of Mathematics Studies (context) - Church, of - 1941
7 An algebraic interpretation of the fiK-calculus and a labell.. (context) - L'evy - 1975
6 Universitat Bremen (context) - Kahrs, thesis - 1991
5 Candidats de reductibilit (context) - Gallier - 1990
5 Pairing without conventional restraints (context) - Barendregt - 1974
4 evaluation formelle des -expressions (context) - Berry - 1978
4 and equational unification: the higher-order cases (context) - Wolfram - 1991
4 A guide to polymorphic types (context) - Scedrov - 1990
4 Compilation of combinatory reduction systems - Kahrs - 1992 ACM DBLP
2 Prentice-Hall International Series in Computer Science (context) - de Bakker, of - 1980
1 A self-interpreter of -calculus having a normal form (context) - Berarducci, Bohm - 1992
1 Vekua Institute of Applied Mathematics (context) - Khasidashvili, systems - 1990
1 Comparing CRSs and HRSs (context) - van Oostrom, van Raamsdonk - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.vu.nl.html): More
Models for Asynchronous Message Handling - Langendoen, Bhoedjang, Bal (1997) (Correct)
Orca: a Portable User-Level Shared Object System - Bal, BHOEDJANG, HOFMAN.. (1996) (Correct)
Object Distribution in Orca using Compile-Time and Run-Time.. - Bal, Kaashoek (1993) (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