Pierre Lescanne

129 papers A* 7A 7B 5C 4Journal 75Unranked 27

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Holonomic equations and efficient random generation of binary trees. Discret. Math. Theor. Comput. Sci. Pierre Lescanne
2022	J	`jnl`	Almost all Classical Theorems are Intuitionistic. RAIRO Theor. Informatics Appl. Pierre Lescanne
2022	J	`jnl`	Linear random generation of Motzkin trees. CoRR Pierre Lescanne
2021	J	`jnl`	L-types for resource awareness: an implicit name approach. CoRR Silvia Ghilezan, Jelena Ivetic, Simona Kasterovic, Pierre Lescanne
2021	J	`jnl`	Zaionc paradox revisited. CoRR Pierre Lescanne
2020	J	`jnl`	Extensive Infinite Games and Escalation, an exercise in Agda. CoRR Pierre Lescanne
2019	J	`jnl`	On the enumeration of closures and environments with an application to random generation. Log. Methods Comput. Sci. Maciej Bendkowski, Pierre Lescanne
2018	C	`conf`	Combinatorics of Explicit Substitutions. PPDP Maciej Bendkowski, Pierre Lescanne
2018	J	`jnl`	Combinatorics of explicit substitutions. CoRR Maciej Bendkowski, Pierre Lescanne
2018	B	`conf`	Counting Environments and Closures. FSCD Maciej Bendkowski, Pierre Lescanne
2018	J	`jnl`	Counting Environments and Closures. CoRR Maciej Bendkowski, Pierre Lescanne
2018	J	`jnl`	Dependent Types for Extensive Games. J. Formaliz. Reason. Pierre Lescanne
2018	J	`jnl`	Quantitative Aspects of Linear and Affine Closed Lambda Terms. ACM Trans. Comput. Log. Pierre Lescanne
2017	—	`conf`	A Congruence Relation for Restructuring Classical Terms. ICTCS/CILC Dragisa Zunic, Pierre Lescanne
2017	J	`jnl`	Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
2017	J	`jnl`	Quantitative aspects of linear and affine closed lambda terms. CoRR Pierre Lescanne
2016	B	`conf`	A Natural Counting of Lambda Terms. SOFSEM Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
2016	J	`jnl`	Combinatorics of λ-terms: a natural approach. CoRR Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
2016	J	`jnl`	Dependent Types for Extensive Games. CoRR Pierre Lescanne
2015	J	`jnl`	A natural counting of Lambda terms. CoRR Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
2015	J	`jnl`	Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). Dagstuhl Reports Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel
2015	J	`jnl`	Counting and Generating Terms in the Binary Lambda Calculus (Extended version). CoRR Katarzyna Grygiel, Pierre Lescanne
2015	J	`jnl`	Counting and generating terms in the binary lambda calculus. J. Funct. Program. Katarzyna Grygiel, Pierre Lescanne
2015	J	`jnl`	Intelligent escalation and the principle of relativity. CoRR Pierre Lescanne
2015	J	`jnl`	The risk of divergence. CoRR Pierre Lescanne
2014	J	`jnl`	Boltzmann samplers for random generation of lambda terms. CoRR Pierre Lescanne
2014	J	`jnl`	Counting Terms in the Binary Lambda Calculus. CoRR Katarzyna Grygiel, Pierre Lescanne
2014	J	`jnl`	Resource control and intersection types: an intrinsic connection. CoRR Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
2013	B	`conf`	A Simple Case of Rationality of Escalation. CALCO Pierre Lescanne
2013	J	`jnl`	A journey through resource control lambda calculi and explicit substitution using intersection types (an account). CoRR Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
2013	J	`jnl`	A simple case of rationality of escalation. CoRR Pierre Lescanne
2013	J	`jnl`	An exercise on streams: convergence acceleration. CoRR Pierre Lescanne
2013	J	`jnl`	Bubbles are rational CoRR Pierre Lescanne
2013	—	`conf`	Common Knowledge Logic in a Higher Order Proof Assistant. Programming Logics Pierre Lescanne
2013	J	`jnl`	Counting and generating lambda terms. J. Funct. Program. Katarzyna Grygiel, Pierre Lescanne
2013	J	`jnl`	Les krachs sont rationnels. Tech. Sci. Informatiques Pierre Lescanne
2013	J	`jnl`	On counting untyped lambda terms. Theor. Comput. Sci. Pierre Lescanne
2012	J	`jnl`	"Backward" coinduction, Nash equilibrium and the rationality of escalation. Acta Informatica Pierre Lescanne, Matthieu Perrinel
2012	J	`jnl`	Computational interpretation of classical logic with explicit structural rules CoRR Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic
2012	J	`jnl`	Counting and generating lambda terms CoRR Katarzyna Grygiel, Pierre Lescanne
2011	C	`conf`	Intersection Types for the Resource Control Lambda Calculi. ICTAC Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
2011	J	`jnl`	Les crashs sont rationnels CoRR Pierre Lescanne
2011	J	`jnl`	On counting untyped lambda terms CoRR Pierre Lescanne
2011	J	`jnl`	Rationality and Escalation in Infinite Extensive Games CoRR Pierre Lescanne
2011	J	`jnl`	Resource control and strong normalisation CoRR Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
2010	J	`jnl`	On the Rationality of Escalation CoRR Pierre Lescanne, Matthieu Perrinel
2009	J	`jnl`	Deconstruction of Infinite Extensive Games using coinduction CoRR Pierre Lescanne
2009	J	`jnl`	Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games CoRR Pierre Lescanne
2009	—	`conf`	Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. TbiLLC Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Dragisa Zunic
2008	J	`jnl`	(Mechanical) Reasoning on Infinite Extensive Games CoRR Pierre Lescanne
2008	J	`jnl`	Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage. Theor. Comput. Sci. Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
2008	J	`jnl`	Computation with classical sequents. Math. Struct. Comput. Sci. Steffen van Bakel, Pierre Lescanne
2008	J	`jnl`	Conversion/Preference Games CoRR Stéphane Le Roux, Pierre Lescanne, René Vestergaard
2007	J	`jnl`	Common knowledge logic in a higher order proof assistant? CoRR Pierre Lescanne
2007	J	`jnl`	Dynamic Logic of Common Knowledge in a Proof Assistant CoRR Pierre Lescanne, Jérôme Puisségur
2006	J	`jnl`	Addressed term rewriting systems: application to a typed object calculus. Math. Struct. Comput. Sci. Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori
2006	J	`jnl`	Mechanizing common knowledge logic using COQ. Ann. Math. Artif. Intell. Pierre Lescanne
2006	J	`jnl`	Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004. SIGACT News Pierre Lescanne
2006	—	`conf`	Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation. CMSB Chafika Chettaoui, Franck Delaplace, Pierre Lescanne, Mun'delanji Vestergaard, René Vestergaard
2005	—	`ed.`	Proceedings of the Second Workshop on Computational Logic and Applications, CLA 2004, Lyon, France, June 17-18, 2004 CLA Pierre Lescanne, René David, Marek Zaionc
2005	B	`conf`	Strong Normalization of the Dual Classical Sequent Calculus. LPAR Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
2005	—	`conf`	The Language chi: Circuits, Computations and Classical Logic. ICTCS Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne
2004	—	`conf`	Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. TERMGRAPH Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang
2004	C	`conf`	Characterizing strong normalization in a language with control operators. PPDP Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
2004	—	`conf`	Intersection and Union Types in the lambda-my-my/tilde-calculus. ITRS Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
2004	J	`jnl`	Intersection types for explicit substitutions. Inf. Comput. Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel
2004	—	`conf`	Preface. CLA Pierre Lescanne, René David, Marek Zaionc
2003	—	`conf`	Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract. TYPES Silvia Ghilezan, Pierre Lescanne
2003	J	`jnl`	Reductions, Intersection Types, and Explicit Substitutions. Math. Struct. Comput. Sci. Daniel J. Dougherty, Pierre Lescanne
2002	—	`conf`	An Improved System of Intersection Types for Explicit Substitutions. IFIP TCS Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne
2001	—	`conf`	Reductions, Intersection Types, and Explicit Substitutions. TLCA Daniel J. Dougherty, Pierre Lescanne
2001	J	`jnl`	Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. Jürgen Giesl, Pierre Lescanne
2000	J	`jnl`	On Strong Normalization of Explicit Substitution Calculi (Short Note). J. Funct. Log. Program. Frédéric Lang, Pierre Lescanne
1999	—	`conf`	A Framework for Defining Object-Calculi. World Congress on Formal Methods Frédéric Lang, Pierre Lescanne, Luigi Liquori
1996	—	`conf`	Calculi of Explicit Substitutions: New Results. APPIA-GULP-PRODE Pierre Lescanne
1996	—	`conf`	Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. PLILP Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose
1996	J	`jnl`	Valentin M. Antimirov (1961-1995). Theor. Comput. Sci. Gregory Kucherov, Pierre Lescanne, Peter D. Mosses
1996	J	`jnl`	lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation. J. Funct. Program. Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, Jocelyne Rouyer-Degli
1995	—	`conf`	Explicit Substitutions with de Bruijn's Levels. RTA Pierre Lescanne, Jocelyne Rouyer-Degli
1995	C	`conf`	Formal Verfication of a Protocol for Communications over Faulty Channels. FORTE Boutheina Chetali, Pierre Lescanne
1995	J	`jnl`	Termination of Rewrite Systems by Elementary Interpretations. Formal Aspects Comput. Pierre Lescanne
1995	—	`conf`	The Lambda Calculus as an Abstract Data Type. COMPASS/ADT Pierre Lescanne
1994	A*	`conf`	From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. POPL Pierre Lescanne
1994	J	`jnl`	On Termination of One Rule Rewrite Systems. Theor. Comput. Sci. Pierre Lescanne
1992	—	`conf`	An Exercise in LP: The Proof of a Non Restoring Division Circuit. Larch Boutheina Chetali, Pierre Lescanne
1992	J	`jnl`	Introduction - ALP 1988. J. Log. Program. Pierre Lescanne, Wolfgang Wechler
1992	A	`conf`	Polynomial Interpretations and the Complexity of Algorithms. CADE Adam Cichon, Pierre Lescanne
1992	—	`conf`	Termination of Rewrite Systems by Elementary Interpretations. ALP Pierre Lescanne
1992	J	`jnl`	The Term Rewriting Approach to Automated Theorem Proving. J. Log. Program. Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch
1992	J	`jnl`	Well Rewrite Orderings and Well Quasi-Orderings. J. Symb. Comput. Pierre Lescanne
1991	—	`book`	Algebraic System Specification and Development - A Survey and Annotated Bibliography Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella
1991	B	`conf`	Rewrite Orderings and Termination of Rewrite Systems. MFCS Pierre Lescanne
1991	J	`jnl`	Rewriting techniques and applications, RTA'91. SIGACT News Hélène Kirchner, Pierre Lescanne
1990	J	`jnl`	Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems Inf. Comput. Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison
1990	—	`conf`	Implementations of Completion by Transition Rules + Control: ORME. ALP Pierre Lescanne
1990	A	`conf`	ORME: An Implementation of Completion Procedures as Sets of Transition Rules. CADE Pierre Lescanne
1990	J	`jnl`	On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. J. Autom. Reason. Pierre Lescanne
1990	J	`jnl`	Termination by Completion. Appl. Algebra Eng. Commun. Comput. Françoise Bellegarde, Pierre Lescanne
1990	J	`jnl`	Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness Inf. Comput. Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel
1990	A*	`conf`	Well Rewrite Orderings LICS Pierre Lescanne
1989	—	`conf`	Completion Procedures as Transition Rules + Control. TAPSOFT, Vol.1 Pierre Lescanne
1989	J	`jnl`	Equational Problems and Disunification. J. Symb. Comput. Hubert Comon, Pierre Lescanne
1989	J	`jnl`	Well quasi-ordering in a paper by Maurice Janet. Bull. EATCS Pierre Lescanne
1988	—	`ed.`	Algebraic and Logic Programming, International Workshop, Gaussig, GDR, November 14-18, 1988, Proceedings ALP Jan Grabowski, Pierre Lescanne, Wolfgang Wechler
1987	—	`conf`	Current Trends in Rewriting Techniques and Related Problems. Trends in Computer Algebra Pierre Lescanne
1987	A*	`conf`	Decidability of the Confluence of Ground Term Rewriting Systems LICS Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
1987	A	`conf`	REVE: A Rewrite Rule Laboratory. STACS Pierre Lescanne
1987	—	`ed.`	Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings RTA Pierre Lescanne
1987	A*	`conf`	Solving Disequations LICS Claude Kirchner, Pierre Lescanne
1987	J	`jnl`	Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. Sci. Comput. Program. Ahlem Ben Cherifa, Pierre Lescanne
1987	—	`conf`	Transformation Ordering. TAPSOFT, Vol.1 Françoise Bellegarde, Pierre Lescanne
1986	A	`conf`	An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. CADE Ahlem Ben Cherifa, Pierre Lescanne
1986	J	`jnl`	Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings. Bull. EATCS Pierre Lescanne
1986	A	`conf`	Proving Termination of Associative Commutative Rewriting Systems by Rewriting. CADE Isabelle Gnaedig, Pierre Lescanne
1986	A	`conf`	REVE a Rewrite Rule Laboratory. CADE Pierre Lescanne
1985	—	`conf`	NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. RTA Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne
1984	A	`conf`	Term Rewriting Systems and Algebra. CADE Pierre Lescanne
1984	—	`conf`	Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. CAAP Pierre Lescanne
1983	J	`jnl`	Behavioural Categoricity of Abstract Data Type Specifications. Comput. J. Pierre Lescanne
1983	A*	`conf`	Computer Experiments with the Reve Term Rewriting System Generator. POPL Pierre Lescanne
1983	A*	`conf`	On the Study Data Structures: Binary Tournaments with Repeated Keys. ICALP Pierre Lescanne, Jean-Marc Steyaert
1982	J	`jnl`	Modèles non Déterministes de Types Abstraits. RAIRO Theor. Informatics Appl. Pierre Lescanne
1982	J	`jnl`	On Multiset Orderings. Inf. Process. Lett. Jean-Pierre Jouannaud, Pierre Lescanne
1982	—	`conf`	Recursive Decomposition Ordering. Formal Description of Programming Concepts Jean-Pierre Jouannaud, Pierre Lescanne, F. Reinig
1982	J	`jnl`	Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems. RAIRO Theor. Informatics Appl. Pierre Lescanne
1981	A*	`conf`	Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. IJCAI Pierre Lescanne
1980	—	`conf`	Manipulation d'arbres syntaxiques et contruction de programmes (Résumé). CLAAP Jacques Guyard, Pierre Lescanne
1980	—	`conf`	Manipulation d'arbres syntaxiques et contruction de programmes. CLAAP Jacques Guyard, Pierre Lescanne
1976	J	`jnl`	Équivalence Entre la Famille des Ensembles Réguliers et la Famille des Ensembles Algébriques. RAIRO Theor. Informatics Appl. Pierre Lescanne