8 citations · 13 across the 5 of their papers we have counts for
6 papers
Binding Logic: proofs and models
Gilles Dowek, Thérèse Hardin, Claude Kirchner
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove…
On the confluence of lambda-calculus with conditional rewriting
Frédéric Blanqui, Claude Kirchner, Colin Riba
The confluence of untyped λ-calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting an…
A Type System for Tom
Claude Kirchner, Pierre-Etienne Moreau, Cláudia Tavares
Extending a given language with new dedicated features is a general and quite used approach to make the programming language more adapted to problems. Being closer to the applicati…
Verification of Timed Automata Using Rewrite Rules and Strategies
Emmanuel Beffara, Olivier Bournez, Hassen Kacem +1
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a clas…
On the confluence of lambda-calculus with conditional rewriting
Frédéric Blanqui, Claude Kirchner, Colin Riba
The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. In this paper, we investigate the confluence of lambda-calcul…
Verification of Timed Automata Using Rewrite Rules and Strategies
Emmanuel Beffara, Olivier Bournez, Hassen Kacem +1
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a clas…