| 2012 | ||
|---|---|---|
| c61 | ||
| 2011 | ||
| i4 | Frédéric Blanqui, Claude Kirchner, Colin Riba: On the confluence of lambda-calculus with conditional rewriting. CoRR abs/1109.4353 (2011) | |
| 2010 | ||
| j42 | Guillaume Burel, Claude Kirchner: Regaining cut admissibility in deduction modulo using abstract completion. Inf. Comput. 208(2): 140-164 (2010) | |
| j41 | Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau: Anti-patterns for rule-based languages. J. Symb. Comput. 45(5): 523-550 (2010) | |
| j40 | Frédéric Blanqui, Claude Kirchner, Colin Riba: On the confluence of lambda-calculus with conditional rewriting. Theor. Comput. Sci. 411(37): 3301-3327 (2010) | |
| e6 | Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis (Eds.): Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6198, Springer 2010, isbn 978-3-642-14164-5 | |
| e5 | Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis (Eds.): Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6199, Springer 2010, isbn 978-3-642-14161-4 | |
| 2009 | ||
| j39 | Fabrice Nahon, Claude Kirchner, Hélène Kirchner, Paul Brauner: Inductive proof search modulo. Ann. Math. Artif. Intell. 55(1-2): 123-154 (2009) | |
| j38 | Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira: Analysis of Rewrite-Based Access Control Policies. Electr. Notes Theor. Comput. Sci. 234: 55-75 (2009) | |
| c60 | ||
| c59 | ||
| e4 | Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada (Eds.): Formal to Practical Security - Papers Issued from the 2005-2008 French-Japanese Collaboration. Lecture Notes in Computer Science 5458, Springer 2009, isbn 978-3-642-02001-8 | |
| i3 | Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner: Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR abs/0907.3123 (2009) | |
| 2008 | ||
| j37 | Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner: Towards a Sharing Strategy for the Graph Rewriting Calculus. Electr. Notes Theor. Comput. Sci. 204: 111-127 (2008) | |
| c58 | Nachum Dershowitz, Claude Kirchner: SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets. Concurrency, Graphs and Models 2008: 194-208 | |
| c57 | Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau: Anti-pattern Matching Modulo. LATA 2008: 275-286 | |
| 2007 | ||
| j36 | ||
| j35 | Horatiu Cirstea, Germain Faure, Claude Kirchner: A rho-calculus of explicit constraint application. Higher-Order and Symbolic Computation 20(1-2): 37-72 (2007) | |
| j34 | Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner: A rewriting calculus for cyclic higher-order term graphs. Mathematical Structures in Computer Science 17(3): 363-406 (2007) | |
| c56 | Paul Brauner, Clément Houtmann, Claude Kirchner: Superdeduction at Work. Rewriting, Computation and Proof 2007: 132-166 | |
| c55 | Anderson Santana de Oliveira, Eric Ke Wang, Claude Kirchner, Hélène Kirchner: Weaving rewrite-based access control policies. FMSE 2007: 71-80 | |
| c54 | ||
| c53 | Daniel J. Dougherty, Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira: Modular Access Control Via Strategic Rewriting. ESORICS 2007: 578-593 | |
| c52 | Clara Bertolissi, Claude Kirchner: The Rewriting Calculus as a Combinatory Reduction System. FoSSaCS 2007: 78-92 | |
| c51 | Guillaume Burel, Claude Kirchner: Cut Elimination in Deduction Modulo by Abstract Completion. LFCS 2007: 115-131 | |
| c50 | ||
| e3 | Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner (Eds.): Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 4600, Springer 2007, isbn 978-3-540-73146-7 | |
| 2006 | ||
| j33 | Claude Kirchner, Hélène Kirchner, Anderson Santana: Anchoring Modularity in HTML. Electr. Notes Theor. Comput. Sci. 157(2): 133-146 (2006) | |
| j32 | Clara Bertolissi, Horatiu Cirstea, Claude Kirchner: Expressing combinatory reduction systems derivations in the rewriting calculus. Higher-Order and Symbolic Computation 19(4): 345-376 (2006) | |
| j31 | Nachum Dershowitz, Claude Kirchner: Abstract canonical presentations. Theor. Comput. Sci. 357(1-3): 53-69 (2006) | |
| c49 | ||
| c48 | Guillaume Burel, Claude Kirchner: Completion Is an Instance of Abstract Canonical System Inference. Essays Dedicated to Joseph A. Goguen 2006: 497-520 | |
| c47 | Claude Kirchner, Pierre-Etienne Moreau, Antoine Reilles: Formal Validation of Pattern Matching code. Trustworthy Software 2006 | |
| c46 | Frédéric Blanqui, Claude Kirchner, Colin Riba: On the Confluence of lambda-Calculus with Conditional Rewriting. FoSSaCS 2006: 382-397 | |
| i2 | Frédéric Blanqui, Claude Kirchner, Colin Riba: On the confluence of lambda-calculus with conditional rewriting. CoRR abs/cs/0609002 (2006) | |
| 2005 | ||
| j30 | Horatiu Cirstea, Germain Faure, Claude Kirchner: A rho-Calculus of Explicit Constraint Application. Electr. Notes Theor. Comput. Sci. 117: 51-67 (2005) | |
| j29 | ||
| j28 | Clara Bertolissi, Paolo Baldan, Horatiu Cirstea, Claude Kirchner: A Rewriting Calculus for Cyclic Higher-order Term Graphs. Electr. Notes Theor. Comput. Sci. 127(5): 21-41 (2005) | |
| c45 | Claude Kirchner, Pierre-Etienne Moreau, Antoine Reilles: Formal validation of pattern matching code. PPDP 2005: 187-197 | |
| c44 | ||
| 2004 | ||
| c43 | Claude Kirchner, Hélène Kirchner: Rule-Based Programming and Proving: The ELAN Experience Outcomes. ASIAN 2004: 363-379 | |
| 2003 | ||
| j27 | Clara Bertolissi, Horatiu Cirstea, Claude Kirchner: Translating Combinatory Reduction Systems into the Rewriting Calculus. Electr. Notes Theor. Comput. Sci. 86(2): 28-44 (2003) | |
| j26 | Horatiu Cirstea, Claude Kirchner, Luigi Liquori, Benjamin Wack: Rewrite strategies in the rewriting calculus. Electr. Notes Theor. Comput. Sci. 86(4): 593-624 (2003) | |
| j25 | Gilles Dowek, Thérèse Hardin, Claude Kirchner: Theorem Proving Modulo. J. Autom. Reasoning 31(1): 33-72 (2003) | |
| c42 | Eric Deplagne, Claude Kirchner, Hélène Kirchner, Quang Huy Nguyen: Proof Search and Proof Check for Equational and Inductive Theorems. CADE 2003: 297-316 | |
| c41 | ||
| c40 | Gilles Barthe, Horatiu Cirstea, Claude Kirchner, Luigi Liquori: Pure patterns type systems. POPL 2003: 250-261 | |
| 2002 | ||
| j24 | Horatiu Cirstea, Claude Kirchner, Luigi Liquori: Rewriting Calculus with(out) Types. Electr. Notes Theor. Comput. Sci. 71: 3-19 (2002) | |
| j23 | Quang Huy Nguyen, Claude Kirchner, Hélène Kirchner: External Rewriting for Skeptical Proof Assistants. J. Autom. Reasoning 29(3-4): 309-336 (2002) | |
| j22 | Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau: ELAN from a rewriting logic point of view. Theor. Comput. Sci. 285(2): 155-185 (2002) | |
| c39 | ||
| c38 | ||
| c37 | ||
| c36 | Olivier Bournez, Claude Kirchner: Probabilistic Rewrite Strategies. Applications to ELAN. RTA 2002: 252-266 | |
| 2001 | ||
| j21 | Horatiu Cirstea, Claude Kirchner: The rewriting calculus - Part I. Logic Journal of the IGPL 9(3): 339-375 (2001) | |
| j20 | Horatiu Cirstea, Claude Kirchner: The rewriting calculus - Part II. Logic Journal of the IGPL 9(3): 377-410 (2001) | |
| j19 | Peter Borovanský, Claude Kirchner, Hélène Kirchner, Christophe Ringeissen: Rewriting with Strategies in ELAN: A Functional Semantics. Int. J. Found. Comput. Sci. 12(1): 69-95 (2001) | |
| j18 | Gilles Dowek, Thérèse Hardin, Claude Kirchner: HOL-λσ: an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science 11(1): 21-45 (2001) | |
| c35 | ||
| c34 | ||
| i1 | Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner: Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR cs.PL/0109024 (2001) | |
| 2000 | ||
| j17 | Horatiu Cirstea, Claude Kirchner: The simply typed rewriting calculus. Electr. Notes Theor. Comput. Sci. 36: 24-42 (2000) | |
| j16 | Gilles Dowek, Thérèse Hardin, Claude Kirchner: Higher Order Unification via Explicit Substitutions. Inf. Comput. 157(1-2): 183-235 (2000) | |
| 1999 | ||
| j15 | Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner: A Methodological View of Constraint Solving. Constraints 4(4): 337-361 (1999) | |
| j14 | Eric Domenjoud, Claude Kirchner, Jianyang Zhou: Generating Feasible Schedules for a Pick-up and Delivery Problem. Electronic Notes in Discrete Mathematics 1: 36-47 (1999) | |
| c33 | ||
| c32 | Gilles Dowek, Thérèse Hardin, Claude Kirchner: HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic. RTA 1999: 317-331 | |
| 1998 | ||
| j13 | Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Christophe Ringeissen: An overview of ELAN. Electr. Notes Theor. Comput. Sci. 15: 55-70 (1998) | |
| j12 | ||
| j11 | Claude Kirchner, Christophe Ringeissen: Rule-Based Constraint Programming. Fundam. Inform. 34(3): 225-262 (1998) | |
| j10 | Claus Hintermeier, Claude Kirchner, Hélène Kirchner: Dynamically Typed Computations for Order-Sorted Equational Presentations. J. Symb. Comput. 25(4): 455-526 (1998) | |
| c31 | ||
| c30 | Eric Domenjoud, Claude Kirchner, Jianyang Zhou: Generating Feasible Schedules for a Pick-Up and Delivery Problem. CP 1998: 467 | |
| c29 | Peter Borovanský, Claude Kirchner, Hélène Kirchner: A Functional View of Rewriting and Strategies for a Semantics of ELAN. Fuji International Symposium on Functional and Logic Programming 1998: 143-166 | |
| e2 | Claude Kirchner, Hélène Kirchner (Eds.): Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings. Lecture Notes in Computer Science 1421, Springer 1998, isbn 3-540-64675-2 | |
| 1997 | ||
| c28 | Claude Kirchner, Christophe Ringeissen: Higher-Order Equational Unification via Explicit Substitutions. ALP/HOA 1997: 61-75 | |
| c27 | Farid Ajili, Claude Kirchner: A Modular Framework for the Combination of Unification and Built-In Constraints. ICLP 1997: 331-345 | |
| 1996 | ||
| j9 | Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Marian Vittek: ELAN: A logical framework based on computational systems. Electr. Notes Theor. Comput. Sci. 4: 35-50 (1996) | |
| j8 | Peter Borovanský, Claude Kirchner, Hélène Kirchner: Controlling rewriting by rewriting. Electr. Notes Theor. Comput. Sci. 4: 169-189 (1996) | |
| c26 | Ilies Alouini, Claude Kirchner: Toward the Concurrent Implementation of Computational Systems. ALP 1996: 1-31 | |
| c25 | Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning: Unification via Explicit Substitutions: The Case of Higher-Order Patterns. JICSLP 1996: 259-273 | |
| c24 | Claude Kirchner, Christopher Lynch, Christelle Scharff: Fine-Grained Concurrent Completion. RTA 1996: 3-17 | |
| 1995 | ||
| j7 | ||
| c23 | Gilles Dowek, Thérèse Hardin, Claude Kirchner: Higher-Order Unification via Explicit Substitutions (Extended Abstract). LICS 1995: 366-374 | |
| 1994 | ||
| c22 | Claus Hintermeier, Claude Kirchner, Hélène Kirchner: Sort Inheritance for Order-Sorted Equational Presentations. COMPASS/ADT 1994: 319-335 | |
| c21 | Claus Hintermeier, Claude Kirchner, Hélène Kirchner: Dynamically-Typed Computations for Order-Sorted Equational Presentations. ICALP 1994: 450-461 | |
| 1993 | ||
| c20 | Claude Kirchner, Hélène Kirchner, Marian Vittek: Implementing Computational Systems with Constraints. PPCP 1993: 156-165 | |
| e1 | Claude Kirchner (Ed.): Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings. Lecture Notes in Computer Science 690, Springer 1993, isbn 3-540-56868-9 | |
| 1992 | ||
| j6 | Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis: Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ. J. Log. Program. 12(3&4): 257-279 (1992) | |
| j5 | Mohamed Adi, Claude Kirchner: AC-Unification Race: The System Solving Approach, Implementation and Benchmarks. J. Symb. Comput. 14(1): 51-70 (1992) | |
| 1991 | ||
| j4 | Miki Hermann, Claude Kirchner, Hélène Kirchner: Implementations of Term Rewriting Systems. Comput. J. 34(1): 20-33 (1991) | |
| j3 | Narjes Doggaz, Claude Kirchner: Completion for Unification. Theor. Comput. Sci. 85(2): 231-251 (1991) | |
| c19 | Jean-Pierre Jouannaud, Claude Kirchner: Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. Computational Logic - Essays in Honor of Alan Robinson 1991: 257-321 | |
| 1990 | ||
| j2 | Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner: Equational Completion in Order-Sorted Algebras. Theor. Comput. Sci. 72(2&3): 169-202 (1990) | |
| c18 | ||
| c17 | Claude Kirchner, Patrick Viry: Implementing Parallel Rewriting. Dagstuhl Seminar on Parallelization in Inference Systems 1990: 123-138 | |
| c16 | Mohamed Adi, Claude Kirchner: AC-Unification Race: The System Solving Approach And Its Implementation. DISCO 1990: 174-183 | |
| c15 | ||
| c14 | ||
| 1989 | ||
| c13 | ||
| 1988 | ||
| c12 | Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis: OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization. ALP 1988: 41-52 | |
| c11 | Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner: Equational Completion in Order-Sorted Algebras (Extended Abstract). CAAP 1988: 165-184 | |
| c10 | Claude Kirchner, Hélène Kirchner, José Meseguer: Operational Semantics of OBJ-3 (Extended Abstract). ICALP 1988: 287-301 | |
| 1987 | ||
| j1 | Claude Kirchner, Hélène Kirchner: REVEUR-3: The Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies. Sci. Comput. Program. 8(1): 69-86 (1987) | |
| c9 | Joseph A. Goguen, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis, José Meseguer, Timothy C. Winkler: An Introduction to OBJ 3. CTRS 1987: 258-263 | |
| c8 | ||
| 1986 | ||
| c7 | Joseph A. Goguen, Claude Kirchner, José Meseguer: Concurrent term rewriting as a model of computation. Graph Reduction 1986: 53-93 | |
| c6 | ||
| 1985 | ||
| c5 | Claude Kirchner, Hélène Kirchner: Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies. European Conference on Computer Algebra (2) 1985: 402-404 | |
| c4 | Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne: NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. RTA 1985: 141-157 | |
| 1984 | ||
| c3 | Claude Kirchner: A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm. CADE 1984: 224-247 | |
| 1983 | ||
| c2 | Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner: Incremental Construction of Unification Algorithms in Equational Theories. ICALP 1983: 361-373 | |
| 1981 | ||
| c1 | Claude Kirchner, Hélène Kirchner, Jean-Pierre Jouannaud: Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees. IJCAI 1981: 1016-1023 | |
Data released under the ODC-BY 1.0 license — See also our legal information page