Rho-Calculus Papers

One can either browse the list below or follow the guidelines.

[FM07] Germain Faure and Alexandre Miquel. A categorical semantics of the parallel lambda-calculus. volume Submited, 2007. [ bib | .pdf ]
[CF07] Horatiu Cirstea and Germain Faure. Confluence of pattern-based lambda-calculi. In Rewriting Techniques and Applications, volume 4533, pages 78-92, 2007. [ bib | .pdf ]
[CHW06] Horatiu Cirstea, Clement Houtmann, and Benjamin Wack. Distributive rho-calculus. In Sixth International Workshop on Reduction Strategies in Rewriting and Programming, Vienna (Austria), Apr 2006. accepted. [ bib | .pdf ]
[BCK06] Clara Bertolissi, Horatiu Cirstea, and Claude Kirchner. Expressing combinatory reduction systems derivations in the rewriting calculus. Higher-Order and Symbolic Computation, 2006. [ bib | http | .pdf ]
[BBCK06] Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, and Claude Kirchner. A rewriting calculus for cyclic higher-order term graphs. Mathematical Structures in Computer Science, 2006. [ bib | http | .pdf ]
[BK07] Clara Bertolissi and Claude Kirchner. The rewriting calculus as a combinatory reduction system. In Helmut Seidl, editor, Prooceedings the FoSSaCS, LNCS, Braga, Portugal, March 2007. Springer-Verlag. [ bib | .pdf ]
[CFF+06] Horatiu Cirstea, Germain Faure, Maribel Fernandez, Ian Mackie, and Francois-Regis Sinot. From functional programs to interaction nets via the rewriting calculus. In Workshop on Reduction Strategies in Rewriting and Programming (WRS'06), ENTCS, 2006. [ bib | .pdf ]
[FMS05] Maribel Fernandez, Ian Mackie, and Francois-Regis Sinot. Interaction nets vs. the rho-calculus: Introducing bigraphical nets. In Proceedings of EXPRESS'05, satellite workshop of Concur, ENTCS. Elsevier, 2005. [ bib | .pdf ]
[Ber05a] Clara Bertolissi. The graph rewriting calculus: confluence and expressiveness. In G. Michele Pinna Mario Coppo, Elena Lodi, editor, 9th Italian conference on Italian Conference on Theoretical Computer Science - ICTCS 2005, Siena, Italy, volume 3701 of Lecture Notes in Computer Science, pages 113-127. Springer Verlag, Oct 2005. [ bib | .pdf ]
[BCK04] Clara Bertolissi, Horatiu Cirstea, and Claude Kirchner. Expressing combinatory reduction systems derivations in the rewriting calculus. To appear in the journal of Higher-Order and Symbolic Computation, 2004. [ bib ]
[BBCK05] Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, and Claude Kirchner. A rewriting calculus for cyclic higher-order term graphs. To appear in the journal of Mathematical Structures in Computer Science, 2005. [ bib ]
[Ber05b] Clara Bertolissi. The graph rewriting calculus: properties and expressive capabilities. Thèse de doctorat, Institut National Polytechnique Lorrain - INPL, October 2005. [ bib | .pdf ]
[Wac05] Benjamin Wack. Typage et déduction dans le calcul de réécriture. Thèse de doctorat, Université Henri Poincaré - Nancy I, October 2005. [ bib | .pdf ]
[CFK05] Horatiu Cirstea, Germain Faure, and Claude Kirchner. A rho-calculus of explicit constraint application. To appear in the journal of Higher-Order and Symbolic Computation, 2005. [ bib ]
[Wac06] Benjamin Wack. A Curry-Howard-De Bruijn Isomorphism Modulo. Under submission, 2006. [ bib | .pdf ]
[BBCK04] Clara Bertolissi, Paolo Baldan, Horatiu Cirstea, and Claude Kirchner. A rewriting calculus for cyclic higher-order term graphs. Wokshop on term graph rewriting, 2004. [ bib | .pdf ]
[LS04] Luigi Liquori and Bernard Serpette. iRho, an imperative rewriting calculus. PPDP, 2004. [ bib | .pdf ]
[Wac04] Benjamin Wack. The simply-typed pure pattern type system ensures strong normalization. IFIP-WCC TCS, 2004. [ bib | .pdf ]
[LW04] Luigi Liquori and Benjamin Wack. The polymorphic rewriting-calculus [type checking vs. type inference]. In Proceedings of the 5th workshop on rewriting logic and applications. vol. 117 of Electronic Notes in Theoretical Computer Science, 2004. [ bib | .pdf ]
[CFK04] Horatiu Cirstea, Germain Faure, and Claude Kirchner. A rho-calculus of explicit constraint application. In Proceedings of the 5th workshop on rewriting logic and applications. vol. 117 of Electronic Notes in Theoretical Computer Science, 2004. [ bib | .pdf ]
[CLW03] Horatiu Cirstea, Luigi Liquori, and Benjamin Wack. Rewriting calculus with fixpoints: Untyped and first-order systems. volume 3085. Springer, 2003. [ bib | .pdf ]
[BCK03] Clara Bertolissi, Horatiu Cirstea, and Claude Kirchner. Translating Combinatory Reduction Systems into the Rewriting Calculus. In Jean-Louis Giavitto and Pierre-Etienne Moreau, editors, Proceedings of the 4th International Workshop on Rule-Based Programming Valencia, Spain, June 9, 2003, Valencia, Spain, June 2003. Electronic Notes in Theoretical Computer Science. [ bib | .pdf ]
[Wac03] Benjamin Wack. Klop counter example in the rho-calculus. Draft notes, LORIA, Nancy, 2003. [ bib | .pdf ]
[Fau03] Germain Faure. Explicit rewriting calculus. Master thesis, ENS-Cachan,IRISA,LORIA, Sep 2003. [ bib | .pdf ]
[CKLW03] Horatiu Cirstea, Claude Kirchner, Luigi Liquori, and Benjamin Wack. Rewrite strategies in the rewriting calculus. In Bernhard Gramlich and Salvador Lucas, editors, Proceedings of the Third International Workshop on Reduction Strategies in Rewriting and Programming , Valencia, Spain, June 2003. Electronic Notes in Theoretical Computer Science. [ bib | .pdf ]
[BCKL03] Gilles Barthe, Horatiu Cirstea, Claude Kirchner, and Luigi Liquori. Pure patterns type systems. In Principles of Programming Languages - POPL2003, New Orleans, USA. ACM, January 2003. [ bib | .pdf ]
[CKL02] Horatiu Cirstea, Claude Kirchner, and Luigi Liquori. Rewriting calculus with(out) types. In Fabio Gadducci and Ugo Montanari, editors, Proceedings of the fourth workshop on rewriting logic and applications, Pisa (Italy), September 2002. Electronic Notes in Theoretical Computer Science. [ bib | .pdf ]
[Ber02] Clara Bertolissi. dea. Rapport de dea, LORIA, Nancy, July 2002. [ bib | .pdf ]
[CKLW02] Horatiu Cirstea, Claude Kirchner, Luigi Liquori, and Benjamin Wack. The rewriting calculus : some results, some problems. In Delia Kesner, Femke van Raamsdonk, and Tobias Nipkow, editors, The first international workshop on Higher-Order Rewriting, pages 1 - 2, Copenhagen, Denmark, July 2002. FLoC'02. [ bib | .ps ]
[Wac02] Benjamin Wack. Aspects typés du calcul de réécriture. Rapport de dea, LORIA - ENS Lyon, Nancy, July 2002. [ bib | .pdf ]
[Fau01] Germain Faure. Etude des propriétés du calcul de réécriture: du rho au rho-epsilon calcul. Rapport du stage de première année du magistère d'informatique et de modélisation de l'ens lyon, LORIA et ENS Lyon, Nancy, September 2001. [ bib | .pdf ]
[FK02] Germain Faure and Claude Kirchner. Exceptions in the rewriting calculus. In Sophie Tison, editor, Proceedings of the RTA conference, volume 2378 of Lecture Notes in Computer Science, pages 66-82, Copenhagen, July 2002. Springer-Verlag. [ bib | .pdf ]
[CK01a] Horatiu Cirstea and Claude Kirchner. Rewriting and Multisets in Rho-calculus and ELAN. Romanian Journal of Information, Science and Technology, 4(1-2):33-48, 2001. ISSN: 1453-8245. [ bib | .pdf ]
[CK00a] Horatiu Cirstea and Claude Kirchner. Rewriting and multisets in the rewriting calculus and elan. In Workshop on Multiset Processing, Curtea de Arges, Romania, Aug 2000. [ bib | .pdf ]
[BKRK01] Peter Borovansky, Claude Kirchner, Christophe Ringeissen, and Helene Kirchner. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science, 12(1):69-98, February 2001. [ bib | .pdf ]
[CK01c] Horatiu Cirstea and Claude Kirchner. The rewriting calculus - Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):427-498, May 2001. [ bib ]
[CK01d] Horatiu Cirstea and Claude Kirchner. The rewriting calculus - Part II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):465-498, May 2001. [ bib | .pdf ]
[CK01b] Horatiu Cirstea and Claude Kirchner. The rewriting calculus - Part I. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):427-463, May 2001. [ bib | .pdf ]
[CKL01b] Horatiu Cirstea, Claude Kirchner, and Luigi Liquori. The Rho Cube. In Furio Honsell, editor, Foundations of Software Science and Computation Structures, http://www.disi.unige.it/etaps2001ETAPS'2001, http://www.springer.de/comp/lncs/index.htmlLecture Notes in Computer Science, pages 166-180, Genova, Italy, April 2001. Springer-Verlag©. [ bib | .pdf ]
[Cir00] Horatiu Cirstea. Calcul de réécriture : fondements et applications. PhD thesis, Université Henri Poincaré - Nancy I, 2000. October 25. [ bib | .pdf ]
[CKL01a] Horatiu Cirstea, Claude Kirchner, and Luigi Liquori. Matching Power. In Proceedings of RTA'2001, Lecture Notes in Computer Science. Springer-Verlag, May 2001. [ bib | .pdf ]
[CK00b] Horatiu Cirstea and Claude Kirchner. The typed rewriting calculus. In Third International Workshop on Rewriting Logic and Application, Kanazawa (Japan), September 2000. [ bib | .pdf ]
[CK98b] Horatiu Cirstea and Claude Kirchner. The rewriting calculus as a semantics of ELAN. In J. Hsiang and A. Ohori, editors, 4th Asian Computing Science Conference, volume 1538 of Lecture Notes in Computer Science, pages 8-10, Manila, The Philippines, December 1998. Springer-Verlag. [ bib | .pdf ]
[CK98a] Horatiu Cirstea and Claude Kirchner. Combining higher-order and first-order computation using ρ-calculus: Towards a semantics of ELAN. In Dov Gabbay and Maarten de Rijke, editors, Frontiers of Combining Systems 2, Research Studies, ISBN 0863802524, appeared in 1999, pages 95-120. Wiley, October 1998. [ bib ]
[CK99] Horatiu Cirstea and Claude Kirchner. An introduction to the rewriting calculus. Research Report RR-3818, INRIA, December 1999. [ bib | .html ]
[CK98c] Horatiu Cirstea and Claude Kirchner. ρ-calculus. Its Syntax and Basic Properties. In Workshop CCL'98, Jerusalem, Israel, September 1998. [ bib | .pdf ]


This file has been generated by bibtex2html 1.86.