Pierre Lescanne

According to our database1, Pierre Lescanne
  • authored at least 109 papers between 1976 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Quantitative aspects of linear and affine closed lambda terms.
CoRR, 2017

A Congruence Relation for Restructuring Classical Terms.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016
Dependent Types for Extensive Games.
CoRR, 2016

Combinatorics of λ-terms: a natural approach.
CoRR, 2016

A Natural Counting of Lambda Terms.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
Counting and generating terms in the binary lambda calculus.
J. Funct. Program., 2015

Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042).
Dagstuhl Reports, 2015

The risk of divergence.
CoRR, 2015

Intelligent escalation and the principle of relativity.
CoRR, 2015

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

A natural counting of Lambda terms.
CoRR, 2015

2014
Boltzmann samplers for random generation of lambda terms.
CoRR, 2014

Counting Terms in the Binary Lambda Calculus.
CoRR, 2014

Resource control and intersection types: an intrinsic connection.
CoRR, 2014

2013
Les krachs sont rationnels.
Technique et Science Informatiques, 2013

On counting untyped lambda terms.
Theor. Comput. Sci., 2013

Counting and generating lambda terms.
J. Funct. Program., 2013

Bubbles are rational
CoRR, 2013

An exercise on streams: convergence acceleration.
CoRR, 2013

A simple case of rationality of escalation.
CoRR, 2013

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

A Simple Case of Rationality of Escalation.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Common Knowledge Logic in a Higher Order Proof Assistant.
Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2012
Counting and generating lambda terms
CoRR, 2012

Computational interpretation of classical logic with explicit structural rules
CoRR, 2012

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

2011
Resource control and strong normalisation
CoRR, 2011

Rationality and Escalation in Infinite Extensive Games
CoRR, 2011

Les crashs sont rationnels
CoRR, 2011

On counting untyped lambda terms
CoRR, 2011

Intersection Types for the Resource Control Lambda Calculi.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010
On the Rationality of Escalation
CoRR, 2010

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

Deconstruction of Infinite Extensive Games using coinduction
CoRR, 2009

Intuitionistic Sequent-Style Calculus with Explicit Structural Rules.
Proceedings of the Logic, Language, and Computation, 2009

2008
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage.
Theor. Comput. Sci., 2008

Computation with classical sequents.
Mathematical Structures in Computer Science, 2008

Conversion/Preference Games
CoRR, 2008

(Mechanical) Reasoning on Infinite Extensive Games
CoRR, 2008

2007
Common knowledge logic in a higher order proof assistant?
CoRR, 2007

Dynamic Logic of Common Knowledge in a Proof Assistant
CoRR, 2007

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

Addressed term rewriting systems: application to a typed object calculus.
Mathematical Structures in Computer Science, 2006

Mechanizing common knowledge logic using COQ.
Ann. Math. Artif. Intell., 2006

Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2006

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

Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2005

Intersection and Union Types in the lambda-my-my/tilde-calculus.
Electr. Notes Theor. Comput. Sci., 2005

Strong Normalization of the Dual Classical Sequent Calculus.
Proceedings of the Logic for Programming, 2005

The Language chi: Circuits, Computations and Classical Logic.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Intersection types for explicit substitutions.
Inf. Comput., 2004

Characterizing strong normalization in a language with control operators.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

2003
Reductions, Intersection Types, and Explicit Substitutions.
Mathematical Structures in Computer Science, 2003

Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2002
An Improved System of Intersection Types for Explicit Substitutions.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Special Issue "Termination".
Appl. Algebra Eng. Commun. Comput., 2001

Reductions, Intersection Types, and Explicit Substitutions.
TLCA, 2001

2000
On Strong Normalization of Explicit Substitution Calculi (Short Note).
Journal of Functional and Logic Programming, 2000

1999
A Framework for Defining Object-Calculi.
Proceedings of the FM'99 - Formal Methods, 1999

1996
Valentin M. Antimirov (1961-1995).
Theor. Comput. Sci., 1996

lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation.
J. Funct. Program., 1996

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution.
Proceedings of the Programming Languages: Implementations, 1996

Calculi of Explicit Substitutions: New Results.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Termination of Rewrite Systems by Elementary Interpretations.
Formal Asp. Comput., 1995

Explicit Substitutions with de Bruijn's Levels.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Formal Verfication of a Protocol for Communications over Faulty Channels.
Proceedings of the Formal Description Techniques VIII, 1995

The Lambda Calculus as an Abstract Data Type.
Proceedings of the Recent Trends in Data Type Specification, 1995

1994
On Termination of One Rule Rewrite Systems.
Theor. Comput. Sci., 1994

From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions.
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.
J. Symb. Comput., 1992

Introduction - ALP 1988.
J. Log. Program., 1992

The Term Rewriting Approach to Automated Theorem Proving.
J. Log. Program., 1992

An Exercise in LP: The Proof of a Non Restoring Division Circuit.
Proceedings of the First International Workshop on Larch, 1992

Polynomial Interpretations and the Complexity of Algorithms.
Proceedings of the Automated Deduction, 1992

Termination of Rewrite Systems by Elementary Interpretations.
Proceedings of the Algebraic and Logic Programming, 1992

1991
Rewrite Orderings and Termination of Rewrite Systems.
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
Inf. Comput., October, 1990

Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness
Inf. Comput., January, 1990

On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings.
J. Autom. Reasoning, 1990

Termination by Completion.
Appl. Algebra Eng. Commun. Comput., 1990

Well Rewrite Orderings
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.
Proceedings of the 10th International Conference on Automated Deduction, 1990

Implementations of Completion by Transition Rules + Control: ORME.
Proceedings of the Algebraic and Logic Programming, 1990

1989
Equational Problems and Disunification.
J. Symb. Comput., 1989

Well quasi-ordering in a paper by Maurice Janet.
Bulletin of the EATCS, 1989

Completion Procedures as Transition Rules + Control.
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.
Sci. Comput. Program., 1987

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

REVE: A Rewrite Rule Laboratory.
Proceedings of the STACS 87, 1987

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

Decidability of the Confluence of Ground Term Rewriting Systems
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Current Trends in Rewriting Techniques and Related Problems.
Proceedings of the Trends in Computer Algebra, 1987

1986
Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings.
Bulletin of the EATCS, 1986

REVE a Rewrite Rule Laboratory.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

Proving Termination of Associative Commutative Rewriting Systems by Rewriting.
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.
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.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

1984
Term Rewriting Systems and Algebra.
Proceedings of the 7th International Conference on Automated Deduction, 1984

Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status.
Proceedings of the CAAP'84, 1984

1983
Behavioural Categoricity of Abstract Data Type Specifications.
Comput. J., 1983

Computer Experiments with the Reve Term Rewriting System Generator.
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.
Proceedings of the Automata, 1983

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

Modèles non Déterministes de Types Abstraits.
ITA, 1982

On Multiset Orderings.
Inf. Process. Lett., 1982

1981
Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980
Manipulation d'arbres syntaxiques et contruction de programmes.
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

Manipulation d'arbres syntaxiques et contruction de programmes (Résumé).
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1976
Équivalence Entre la Famille des Ensembles Réguliers et la Famille des Ensembles Algébriques.
ITA, 1976


  Loading...