Claude Kirchner

According to our database1, Claude Kirchner authored at least 111 papers between 1981 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Engineering Academic Software (Dagstuhl Perspectives Workshop 16252).
Dagstuhl Manifestos, 2017

2016
Engineering Academic Software (Dagstuhl Perspectives Workshop 16252).
Dagstuhl Reports, 2016

2014
Equational Logic and Rewriting.
Proceedings of the Computational Logic, 2014

EPISCIENCES - An overlay publication platform.
Inf. Services and Use, 2014

Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112).
Dagstuhl Reports, 2014

Massive Open Online Courses: Current State and Perspectives (Dagstuhl Perspectives Workshop 14112).
Dagstuhl Manifestos, 2014

EPISCIENCES - an overlay publication platform.
Proceedings of the Let's Put Data to Use: Digital Scholarship for the Next Generation, 2014

2013
Narrowing Based Inductive Proof Search.
Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2012
Rho-Calculi for Computation and Logic (Invited Talk).
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2010
On the confluence of lambda-calculus with conditional rewriting.
Theor. Comput. Sci., 2010

Anti-patterns for rule-based languages.
J. Symb. Comput., 2010

Regaining cut admissibility in deduction modulo using abstract completion.
Inf. Comput., 2010

2009
Analysis of Rewrite-Based Access Control Policies.
Electr. Notes Theor. Comput. Sci., 2009

A Type System for Tom
Proceedings of the Proceedings Tenth International Workshop on Rule-Based Programming, 2009

Verification of Timed Automata Using Rewrite Rules and Strategies
CoRR, 2009

Inductive proof search modulo.
Ann. Math. Artif. Intell., 2009

Constraint Based Strategies.
Proceedings of the Functional and Constraint Logic Programming, 2009

2008
Towards a Sharing Strategy for the Graph Rewriting Calculus.
Electr. Notes Theor. Comput. Sci., 2008

Anti-pattern Matching Modulo.
Proceedings of the Language and Automata Theory and Applications, 2008

SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets.
Proceedings of the Concurrency, 2008

2007
A rewriting calculus for cyclic higher-order term graphs.
Mathematical Structures in Computer Science, 2007

A rho-calculus of explicit constraint application.
Higher-Order and Symbolic Computation, 2007

Preface.
Electr. Notes Theor. Comput. Sci., 2007

Principles of Superdeduction.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Cut Elimination in Deduction Modulo by Abstract Completion.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

The Rewriting Calculus as a Combinatory Reduction System.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Modular Access Control Via Strategic Rewriting.
Proceedings of the Computer Security, 2007

Anti-pattern Matching.
Proceedings of the Programming Languages and Systems, 2007

Weaving rewrite-based access control policies.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

Superdeduction at Work.
Proceedings of the Rewriting, 2007

2006
Abstract canonical presentations.
Theor. Comput. Sci., 2006

Expressing combinatory reduction systems derivations in the rewriting calculus.
Higher-Order and Symbolic Computation, 2006

Anchoring Modularity in HTML.
Electr. Notes Theor. Comput. Sci., 2006

On the confluence of lambda-calculus with conditional rewriting
CoRR, 2006

On the Confluence of lambda-Calculus with Conditional Rewriting.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Completion Is an Instance of Abstract Canonical System Inference.
Proceedings of the Algebra, Meaning, and Computation, 2006

Formal Islands.
Proceedings of the Algebraic Methodology and Software Technology, 2006

2005
Strategic Rewriting.
Electr. Notes Theor. Comput. Sci., 2005

A rho-Calculus of Explicit Constraint Application.
Electr. Notes Theor. Comput. Sci., 2005

A Rewriting Calculus for Cyclic Higher-order Term Graphs.
Electr. Notes Theor. Comput. Sci., 2005

Anchoring modularity in HTML.
Proceedings of the First International Workshop on Automated Specification and Verification of Web Sites (WWV 2005), 2005

Formal validation of pattern matching code.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

2004
Rule-Based Programming and Proving: The ELAN Experience Outcomes.
Proceedings of the Advances in Computer Science, 2004

2003
Theorem Proving Modulo.
J. Autom. Reasoning, 2003

Rewrite strategies in the rewriting calculus.
Electr. Notes Theor. Comput. Sci., 2003

Translating Combinatory Reduction Systems into the Rewriting Calculus.
Electr. Notes Theor. Comput. Sci., 2003

Pure patterns type systems.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

Abstract Saturation-Based Inference.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Proof Search and Proof Check for Equational and Inductive Theorems.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
ELAN from a rewriting logic point of view.
Theor. Comput. Sci., 2002

External Rewriting for Skeptical Proof Assistants.
J. Autom. Reasoning, 2002

Rewriting Calculus with(out) Types.
Electr. Notes Theor. Comput. Sci., 2002

Exceptions in the Rewriting Calculus.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Probabilistic Rewrite Strategies. Applications to ELAN.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Binding Logic: Proofs and Models.
Proceedings of the Logic for Programming, 2002

Deduction versus Computation: The Case of Induction.
Proceedings of the Artificial Intelligence, 2002

2001
HOL-λσ: an intentional first-order expression of higher-order logic.
Mathematical Structures in Computer Science, 2001

Rewriting with Strategies in ELAN: A Functional Semantics.
Int. J. Found. Comput. Sci., 2001

The rewriting calculus - Part II.
Logic Journal of the IGPL, 2001

The rewriting calculus - Part I.
Logic Journal of the IGPL, 2001

Matching Power.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

The Rho Cube.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

2000
Higher Order Unification via Explicit Substitutions.
Inf. Comput., 2000

The simply typed rewriting calculus.
Electr. Notes Theor. Comput. Sci., 2000

1999
Generating Feasible Schedules for a Pick-up and Delivery Problem.
Electronic Notes in Discrete Mathematics, 1999

A Methodological View of Constraint Solving.
Constraints, 1999

HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Constraint Solving on Terms.
Proceedings of the Constraints in Computational Logics: Theory and Applications, 1999

1998
Dynamically Typed Computations for Order-Sorted Equational Presentations.
J. Symb. Comput., 1998

Rule-Based Constraint Programming.
Fundam. Inform., 1998

Preface.
Electr. Notes Theor. Comput. Sci., 1998

An overview of ELAN.
Electr. Notes Theor. Comput. Sci., 1998

A Functional View of Rewriting and Strategies for a Semantics of ELAN.
Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, 1998

Generating Feasible Schedules for a Pick-Up and Delivery Problem.
Proceedings of the Principles and Practice of Constraint Programming, 1998

The Rewriting Calculus as a Semantics of ELAN.
Proceedings of the Advances in Computing Science, 1998

1997
A Modular Framework for the Combination of Unification and Built-In Constraints.
Proceedings of the Logic Programming, 1997

Higher-Order Equational Unification via Explicit Substitutions.
Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1996
ELAN: A logical framework based on computational systems.
Electr. Notes Theor. Comput. Sci., 1996

Controlling rewriting by rewriting.
Electr. Notes Theor. Comput. Sci., 1996

Fine-Grained Concurrent Completion.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Unification via Explicit Substitutions: The Case of Higher-Order Patterns.
Proceedings of the Logic Programming, 1996

Toward the Concurrent Implementation of Computational Systems.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

1995
Editorial.
Theor. Comput. Sci., 1995

Higher-Order Unification via Explicit Substitutions (Extended Abstract)
Proceedings of the Proceedings, 1995

1994
Dynamically-Typed Computations for Order-Sorted Equational Presentations.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Sort Inheritance for Order-Sorted Equational Presentations.
Proceedings of the Recent Trends in Data Type Specification, 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30, 1994

1993
Implementing Computational Systems with Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1993

1992
AC-Unification Race: The System Solving Approach, Implementation and Benchmarks.
J. Symb. Comput., 1992

Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ.
J. Log. Program., 1992

1991
Completion for Unification.
Theor. Comput. Sci., 1991

Implementations of Term Rewriting Systems.
Comput. J., 1991

Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
Equational Completion in Order-Sorted Algebras.
Theor. Comput. Sci., 1990

Implementing Parallel Rewriting.
Proceedings of the Programming Language Implementation and Logic Programming, 1990

Syntactic Theories and Unification
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

AC-Unification Race: The System Solving Approach And Its Implementation.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

Tutorial on Equational Unification.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1989
Constrained Equational Reasoning.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
Operational Semantics of OBJ-3 (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Equational Completion in Order-Sorted Algebras (Extended Abstract).
Proceedings of the CAAP '88, 1988

OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization.
Proceedings of the Algebraic and Logic Programming, 1988

1987
REVEUR-3: The Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies.
Sci. Comput. Program., 1987

Solving Disequations
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

An Introduction to OBJ 3.
Proceedings of the Conditional Term Rewriting Systems, 1987

1986
Computing Unification Algorithms
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Concurrent term rewriting as a model of computation.
Proceedings of the Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29, 1986

1985
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies.
Proceedings of the EUROCAL '85, 1985

1984
A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm.
Proceedings of the 7th International Conference on Automated Deduction, 1984

1983
Incremental Construction of Unification Algorithms in Equational Theories.
Proceedings of the Automata, 1983

1981
Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981


  Loading...