Rewriting Calculus with(out) Types

[1]  Claude Kirchner,et al.  Pure patterns type systems , 2003, POPL '03.

[2]  Claude Kirchner,et al.  Exceptions in the Rewriting Calculus , 2002, RTA.

[3]  Claude Kirchner,et al.  Matching Power , 2001, RTA.

[4]  Claude Kirchner,et al.  The Rho Cube , 2001, FoSSaCS.

[5]  Francisco Durán,et al.  Principles of Mobile Maude , 2000, ASA/MA.

[6]  François Pessaux,et al.  Type-based analysis of uncaught exceptions , 2000, TOPL.

[7]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[8]  J. Jouannaud,et al.  Abstract Data Type Systems , 1997, Theor. Comput. Sci..

[9]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[10]  Didier Rémy,et al.  A generalization of exceptions and control in ML-like languages , 1995, FPCA '95.

[11]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[12]  Val Tannen,et al.  A typed pattern calculus , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[13]  David A. Wolfram,et al.  The Clausal Theory of Types , 1993 .

[14]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

[15]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[16]  Matthias Felleisen,et al.  A Syntactic Theory of Sequential State , 1989, Theor. Comput. Sci..

[17]  Mitsuhiro Okada,et al.  Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system , 1989, ISSAC '89.

[18]  Val Tannen,et al.  Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence Val Tannen , 2011 .

[19]  V. Breazu-Tannen,et al.  Combining algebra and higher-order types , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[20]  Samuel N. Kamin.  Inheritance in smalltalk-80: a denotational definition , 1988, POPL '88.

[21]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[22]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[23]  Daniel Leivant,et al.  Polymorphic type inference , 1983, POPL '83.

[24]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[25]  J. M. Hvllot.  Associative commutative pattern matching , 1979, IJCAI 1979.

[26]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[27]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[28]  Horatiu Cirstea,et al.  Calcul de réécriture : fondements et applications , 2000 .

[29]  C. Kirchner,et al.  Introduction to the Rewriting Calculus , 1999 .

[30]  C. Kirchner,et al.  ρ-Calculus. Its Syntax and Basic Properties , 1998 .

[31]  C. Kirchner,et al.  $\rho$-Calculus. Its Syntax and Basic Properties , 1998 .

[32]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[33]  S. M. Eker,et al.  Associative-Commutative Matching Via Bipartite Graph Matching , 1995, Comput. J..

[34]  Simon L. Peyton Jones,et al.  The Implementation of Functional Programming Languages , 1987 .

[35]  Jean-Marie Hullot,et al.  Associative Commutative Pattern Matching , 1979, IJCAI.