Bibliography

Major publications by the team in recent years

• 1E. Balland, C. Kirchner, P.-E. Moreau.
  
  Formal Islands, in: 11th International Conference on Algebraic Methodology and Software Technology, Kuressaare, Estonia, M. Johnson, V. Vene (editors), LNCS, Springer-Verlag, jul 2006, vol. 4019, pp. 51–65.
  
  http://www.loria.fr/~moreau/Papers/BallandKM-AMAST2006.pdf
• 2P. Brauner, C. Houtmann, C. Kirchner.
  
  Principles of Superdeduction, in: Twenty-Second Annual IEEE Symposium on Logic in Computer Science - LiCS 2007, Wroclaw Pologne, IEEE Computer Society, 2007.
  
  http://dx.doi.org/10.1109/LICS.2007.37
• 3H. Cirstea, C. Kirchner, R. Kopetz, P.-E. Moreau.
  
  Anti-patterns for Rule-based Languages, in: Journal of Symbolic Computation, February 2010, vol. 54, n^o 5, pp. 523-550.
• 4C. Kirchner, R. Kopetz, P.-E. Moreau.
  
  Anti-Pattern Matching, in: 16th European Symposium on Programming, Braga, Portugal, Lecture Notes in Computer Science, Springer, 2007, vol. 4421, pp. 110–124.
  
  http://www.loria.fr/~moreau/Papers/KirchnerKM-2007.pdf

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 5J.-C. Bach.
  
  A formal Island for qualifiable model transformations, Université de Lorraine, September 2014.
  
  https://tel.archives-ouvertes.fr/tel-01081055

International Conferences with Proceedings

• 6D. Biernacki, S. Lenglet.
  
  Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus, in: Mathematical Foundations of Programming Semantics Thirtieth Conference, Ithaca, United States, Elsevier, June 2014, vol. 308, pp. 49 - 64. [ DOI : 10.1016/j.entcs.2014.10.004 ]
  
  https://hal.inria.fr/hal-01080960
• 7G. Castagna, K. Nguyen, Z. Xu, H. Im, S. Lenglet, L. Padovani.
  
  Polymorphic Functions with Set-Theoretic Types. Part 1: Syntax, Semantics, and Evaluation, in: POPL'14, 41th ACM Symposium on Principles of Programming Languages, San Diego, United States, January 2014, pp. 5-17. [ DOI : 10.1145/2535838.2535840 ]
  
  https://hal.archives-ouvertes.fr/hal-00907166

Internal Reports

• 8D. Biernacki, S. Lenglet.
  
  Sound and Complete Bisimilarities for Call-by-Name and Call-by-Value Lambda-mu Calculus, January 2014, n^o RR-8447.
  
  https://hal.inria.fr/hal-00926100

References in notes

• 9T. Aoto, S. Stratulat.
  
  Decision Procedures for Proving Inductive Theorems without Induction, in: 16th International Symposium on Principles and Practice of Declarative Programming (PPDP) 2014, Canterbury, United Kingdom, September 2014. [ DOI : 10.1145/2643135.2643156 ]
  
  https://hal.archives-ouvertes.fr/hal-01098929
• 10F. Baader, T. Nipkow.
  
  Term Rewriting and All That, Cambridge University Press, 1998.
• 11J.-C. Bach, E. Balland, P. Brauner, R. Kopetz, P.-E. Moreau, A. Reilles.
  
  Tom Manual, LORIA, 2009, 155 p.
  
  http://hal.inria.fr/inria-00121885/en/
• 12E. Balland, P. Brauner, R. Kopetz, P.-E. Moreau, A. Reilles.
  
  Tom: Piggybacking rewriting on java, in: 18th International Conference on Rewriting Techniques and Applications - (RTA), Paris, France, Lecture Notes in Computer Science, Jun 2007, vol. 4533, pp. 36–47.
• 13P. Borovanský, C. Kirchner, H. Kirchner.
  
  Controlling Rewriting by Rewriting, in: Proceedings of the first international workshop on rewriting logic - (WRLA), Asilomar (California), J. Meseguer (editor), Electronic Notes in Theoretical Computer Science, Sep 1996, vol. 4.
• 14P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau.
  
  ELAN from a rewriting logic point of view, in: Theoretical Computer Science, Jul 2002, vol. 2, n^o 285, pp. 155–185.
• 15T. Bourdier, H. Cirstea, D. Dougherty, H. Kirchner.
  
  Extensional and Intensional Strategies, in: Electronic Proceedings in Theoretical Computer Science, 2010, vol. 15, pp. 1–19.
• 16H. Cirstea.
  
  Le calcul de réécriture, Université Nancy II, October 2010, Habilitation à Diriger des Recherches.
• 17C. Fuhs, J. Giesl, M. Parting, P. Schneider-Kamp, S. Swiderski.
  
  Proving Termination by Dependency Pairs and Inductive Theorem Proving, in: J. Autom. Reasoning, 2011, vol. 47, n^o 2, pp. 133–160.
• 18J.-Y. Girard, Y. Lafont, P. Taylor.
  
  Proofs and Types, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1989, vol. 7.
• 19C. B. Jay, D. Kesner.
  
  First-class patterns, in: Journal of Functional Programming, 2009, vol. 19, n^o 2, pp. 191–225.
• 20J.-P. Jouannaud, H. Kirchner.
  
  Completion of a set of rules modulo a set of Equations, in: SIAM J. of Computing, 1986, vol. 15, n^o 4, pp. 1155–1194.
• 21J.-P. Jouannaud, C. Kirchner.
  
  Solving equations in abstract algebras: a rule-based survey of unification, in: Computational Logic. Essays in honor of Alan Robinson, Cambridge (MA, USA), J.-L. Lassez, G. Plotkin (editors), The MIT press, 1991, chap. 8, pp. 257–321.
• 22G. Kahn.
  
  Natural Semantics, Inria Sophia-Antipolis, feb 1987, n^o 601.
• 23C. Kirchner, H. Kirchner, M. Vittek.
  
  Designing Constraint Logic Programming Languages using Computational Systems, in: Proc. 2nd CCL Workshop, La Escala (Spain), F. Orejas (editor), Sep 1993.
• 24H. Kirchner, P.-E. Moreau.
  
  Promoting Rewriting to a Programming Language: A Compiler for Non-Deterministic Rewrite Programs in Associative-Commutative Theories, in: Journal of Functional Programming, 2001, vol. 11, n^o 2, pp. 207–251.
  
  http://www.loria.fr/~moreau/Papers/jfp.ps.gz
• 25J. W. Klop, V. van Oostrom, R. de Vrijer.
  
  Lambda calculus with patterns, in: Theor. Comput. Sci., 2008, vol. 398, n^o 1-3, pp. 16–31.
• 26M. Korp, C. Sternagel, H. Zankl, A. Middeldorp.
  
  Tyrolean Termination Tool 2, in: RTA, 2009, pp. 295–304.
• 27P.-E. Moreau, C. Ringeissen, M. Vittek.
  
  A Pattern Matching Compiler for Multiple Target Languages, in: 12th Conference on Compiler Construction - (CC), G. Hedin (editor), Lecture Notes in Computer Science, Springer-Verlag, May 2003, vol. 2622, pp. 61–76.
• 28S. Peyton-Jones.
  
  The implementation of functional programming languages, Prentice-Hall, 1987.
• 29S. Stratulat.
  
  Building explicit induction schemas for cyclic induction reasoning, January 2014.
  
  https://hal.archives-ouvertes.fr/hal-00956769
• 30S. Stratulat.
  
  Implementing Reasoning Modules in Implicit Induction Theorem Provers, in: International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2014), Timisoara, Romania, September 2014.
  
  https://hal.archives-ouvertes.fr/hal-01098933
• 31M. van den Brand, A. van Deursen, P. Klint, S. Klusener, E. A. van der Meulen.
  
  Industrial Applications of ASF+SDF, in: AMAST '96, M. Wirsing, M. Nivat (editors), Lecture Notes in Computer Science, Springer-Verlag, 1996, vol. 1101, pp. 9–18.