Pierre Lescanne

J. Funct. Program., 2015

Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

The risk of divergence.

[BibT_eX]

[DOI]

CoRR, 2015

Intelligent escalation and the principle of relativity.

[BibT_eX]

[DOI]

CoRR, 2015

Counting and Generating Terms in the Binary Lambda Calculus (Extended version).

[BibT_eX]

[DOI]

CoRR, 2015

2014

Boltzmann samplers for random generation of lambda terms.

[BibT_eX]

[DOI]

CoRR, 2014

Counting Terms in the Binary Lambda Calculus.

[BibT_eX]

[DOI]

CoRR, 2014

Resource control and intersection types: an intrinsic connection.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Les krachs sont rationnels.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2013

On counting untyped lambda terms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Counting and generating lambda terms.

[BibT_eX]

[DOI]

J. Funct. Program., 2013

Bubbles are rational

[BibT_eX]

[DOI]

CoRR, 2013

An exercise on streams: convergence acceleration.

[BibT_eX]

[DOI]

CoRR, 2013

A journey through resource control lambda calculi and explicit substitution using intersection types (an account).

[BibT_eX]

[DOI]

CoRR, 2013

A Simple Case of Rationality of Escalation.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Common Knowledge Logic in a Higher Order Proof Assistant.

[BibT_eX]

[DOI]

Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2012

Computational interpretation of classical logic with explicit structural rules

[BibT_eX]

[DOI]

Dragisa Zunic

CoRR, 2012

"Backward" coinduction, Nash equilibrium and the rationality of escalation.

[BibT_eX]

[DOI]

Matthieu Perrinel

Acta Informatica, 2012

2011

Resource control and strong normalisation

[BibT_eX]

[DOI]

CoRR, 2011

Rationality and Escalation in Infinite Extensive Games

[BibT_eX]

[DOI]

CoRR, 2011

Les crashs sont rationnels

[BibT_eX]

[DOI]

CoRR, 2011

Intersection Types for the Resource Control Lambda Calculi.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010

On the Rationality of Escalation

[BibT_eX]

[DOI]

Matthieu Perrinel

CoRR, 2010

2009

Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games

[BibT_eX]

[DOI]

CoRR, 2009

Deconstruction of Infinite Extensive Games using coinduction

[BibT_eX]

[DOI]

CoRR, 2009

Intuitionistic Sequent-Style Calculus with Explicit Structural Rules.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, and Computation, 2009

2008

Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Computation with classical sequents.

[BibT_eX]

[DOI]

Steffen van Bakel

Math. Struct. Comput. Sci., 2008

Conversion/Preference Games

[BibT_eX]

[DOI]

Stéphane Le Roux

René Vestergaard

CoRR, 2008

(Mechanical) Reasoning on Infinite Extensive Games

[BibT_eX]

[DOI]

CoRR, 2008

2007

Dynamic Logic of Common Knowledge in a Proof Assistant

[BibT_eX]

[DOI]

Jérôme Puisségur

CoRR, 2007

2006

Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004.

[BibT_eX]

[DOI]

SIGACT News, 2006

Addressed term rewriting systems: application to a typed object calculus.

[BibT_eX]

[DOI]

Luigi Liquori

Math. Struct. Comput. Sci., 2006

Mechanizing common knowledge logic using COQ.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2006

Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation.

[BibT_eX]

[DOI]

Chafika Chettaoui

Franck Delaplace

Mun'delanji Vestergaard

René Vestergaard

Proceedings of the Computational Methods in Systems Biology, International Conference, 2006

2005

Strong Normalization of the Dual Classical Sequent Calculus.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2005

The Language chi: Circuits, Computations and Classical Logic.

[BibT_eX]

[DOI]

Steffen van Bakel

Stéphane Lengrand

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Intersection types for explicit substitutions.

[BibT_eX]

[DOI]

Stéphane Lengrand

Mariangiola Dezani-Ciancaglini

Steffen van Bakel

Inf. Comput., 2004

Preface.

[BibT_eX]

[DOI]

René David

Marek Zaionc

Proceedings of the Second Workshop on Computational Logic and Applications, 2004

Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Term Graph Rewriting, 2004

Intersection and Union Types in the lambda-my-my/tilde-calculus.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

Characterizing strong normalization in a language with control operators.

[BibT_eX]

[DOI]

Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

2003

Reductions, Intersection Types, and Explicit Substitutions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2003

Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2002

An Improved System of Intersection Types for Explicit Substitutions.

[BibT_eX]

[DOI]

Stéphane Lengrand

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

Special Issue "Termination".

[BibT_eX]

[DOI]

Jürgen Giesl

Appl. Algebra Eng. Commun. Comput., 2001

2000

On Strong Normalization of Explicit Substitution Calculi (Short Note).

[BibT_eX]

[DOI]

Frédéric Lang

J. Funct. Log. Program., 2000

1999

A Framework for Defining Object-Calculi.

[BibT_eX]

[DOI]

Frédéric Lang

Luigi Liquori

Proceedings of the FM'99 - Formal Methods, 1999

1996

Valentin M. Antimirov (1961-1995).

[BibT_eX]

Gregory Kucherov

Peter D. Mosses

Theor. Comput. Sci., 1996

lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation.

[BibT_eX]

[DOI]

Zine-El-Abidine Benaissa

Daniel Briaud

Jocelyne Rouyer-Degli

J. Funct. Program., 1996

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution.

[BibT_eX]

[DOI]

Zine-El-Abidine Benaissa

Kristoffer Høgsbro Rose

Proceedings of the Programming Languages: Implementations, 1996

Calculi of Explicit Substitutions: New Results.

[BibT_eX]

Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995

Termination of Rewrite Systems by Elementary Interpretations.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1995

Explicit Substitutions with de Bruijn's Levels.

[BibT_eX]

[DOI]

Jocelyne Rouyer-Degli

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Formal Verfication of a Protocol for Communications over Faulty Channels.

[BibT_eX]

Boutheina Chetali

Proceedings of the Formal Description Techniques VIII, 1995

The Lambda Calculus as an Abstract Data Type.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Data Type Specification, 1995

1994

On Termination of One Rule Rewrite Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994

1992

Well Rewrite Orderings and Well Quasi-Orderings.

[BibT_eX]

[DOI]

J. Symb. Comput., 1992

Introduction - ALP 1988.

[BibT_eX]

[DOI]

Wolfgang Wechler

J. Log. Program., 1992

The Term Rewriting Approach to Automated Theorem Proving.

[BibT_eX]

[DOI]

J. Log. Program., 1992

An Exercise in LP: The Proof of a Non Restoring Division Circuit.

[BibT_eX]

Boutheina Chetali

Proceedings of the First International Workshop on Larch, 1992

Polynomial Interpretations and the Complexity of Algorithms.

[BibT_eX]

[DOI]

Adam Cichon

Proceedings of the Automated Deduction, 1992

1991

Rewriting techniques and applications, RTA'91.

[BibT_eX]

[DOI]

Hélène Kirchner

SIGACT News, 1991

Rewrite Orderings and Termination of Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems

[BibT_eX]

[DOI]

Inf. Comput., October, 1990

Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness

[BibT_eX]

[DOI]

Azeddine Lazrek

Jean-Jacques Thiel

Inf. Comput., January, 1990

On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings.

[BibT_eX]

[DOI]

J. Autom. Reason., 1990

Termination by Completion.

[BibT_eX]

[DOI]

Françoise Bellegarde

Appl. Algebra Eng. Commun. Comput., 1990

Well Rewrite Orderings

[BibT_eX]

[DOI]

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

ORME: An Implementation of Completion Procedures as Sets of Transition Rules.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Automated Deduction, 1990

Implementations of Completion by Transition Rules + Control: ORME.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 1990

1989

Equational Problems and Disunification.

[BibT_eX]

[DOI]

Hubert Comon

J. Symb. Comput., 1989

Well quasi-ordering in a paper by Maurice Janet.

[BibT_eX]

Bull. EATCS, 1989

Completion Procedures as Transition Rules + Control.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

1987

Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation.

[BibT_eX]

[DOI]

Ahlem Ben Cherifa

Sci. Comput. Program., 1987

Transformation Ordering.

[BibT_eX]

[DOI]

Françoise Bellegarde

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

REVE: A Rewrite Rule Laboratory.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 1987

Solving Disequations

[BibT_eX]

Claude Kirchner

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

Decidability of the Confluence of Ground Term Rewriting Systems

[BibT_eX]

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

Current Trends in Rewriting Techniques and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Trends in Computer Algebra, 1987

1986

Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings.

[BibT_eX]

Bull. EATCS, 1986

Proving Termination of Associative Commutative Rewriting Systems by Rewriting.

[BibT_eX]

[DOI]

Isabelle Gnaedig

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations.

[BibT_eX]

[DOI]

Ahlem Ben Cherifa

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985

NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

1984

Term Rewriting Systems and Algebra.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Automated Deduction, 1984

Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status.

[BibT_eX]

Proceedings of the CAAP'84, 1984

1983

Behavioural Categoricity of Abstract Data Type Specifications.

[BibT_eX]

[DOI]

Comput. J., 1983

Computer Experiments with the Reve Term Rewriting System Generator.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

On the Study Data Structures: Binary Tournaments with Repeated Keys.

[BibT_eX]

[DOI]

Jean-Marc Steyaert

Proceedings of the Automata, 1983

1982

Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1982

Modèles non Déterministes de Types Abstraits.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1982

On Multiset Orderings.

[BibT_eX]

[DOI]

Jean-Pierre Jouannaud

Inf. Process. Lett., 1982

Recursive Decomposition Ordering.

[BibT_eX]

Jean-Pierre Jouannaud

F. Reinig

Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

1981

Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980

Manipulation d'arbres syntaxiques et contruction de programmes.

[BibT_eX]

Jacques Guyard