The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre Lescanne: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Lescanne
    From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. [Citation Graph (1, 0)][DBLP]
    POPL, 1994, pp:60-69 [Conf]
  2. Pierre Lescanne
    Calculi of Explicit Substitutions: New Results. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1996, pp:309-328 [Conf]
  3. Pierre Lescanne
    Implementations of Completion by Transition Rules + Control: ORME. [Citation Graph (0, 0)][DBLP]
    ALP, 1990, pp:262-269 [Conf]
  4. Pierre Lescanne
    Termination of Rewrite Systems by Elementary Interpretations. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:21-36 [Conf]
  5. Pierre Lescanne
    Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. [Citation Graph (0, 0)][DBLP]
    CAAP, 1984, pp:181-194 [Conf]
  6. Adam Cichon, Pierre Lescanne
    Polynomial Interpretations and the Complexity of Algorithms. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:139-147 [Conf]
  7. Ahlem Ben Cherifa, Pierre Lescanne
    An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:42-51 [Conf]
  8. Isabelle Gnaedig, Pierre Lescanne
    Proving Termination of Associative Commutative Rewriting Systems by Rewriting. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:52-61 [Conf]
  9. Pierre Lescanne
    Term Rewriting Systems and Algebra. [Citation Graph (0, 0)][DBLP]
    CADE, 1984, pp:166-174 [Conf]
  10. Pierre Lescanne
    REVE a Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:695-696 [Conf]
  11. Pierre Lescanne
    ORME: An Implementation of Completion Procedures as Sets of Transition Rules. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:661-662 [Conf]
  12. Chafika Chettaoui, Franck Delaplace, Pierre Lescanne, Mun'delanji Vestergaard, René Vestergaard
    Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation. [Citation Graph (0, 0)][DBLP]
    CMSB, 2006, pp:257-270 [Conf]
  13. Pierre Lescanne
    The Lambda Calculus as an Abstract Data Type. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1995, pp:74-80 [Conf]
  14. Frédéric Lang, Pierre Lescanne, Luigi Liquori
    A Framework for Defining Object-Calculi. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:963-982 [Conf]
  15. Boutheina Chetali, Pierre Lescanne
    Formal Verfication of a Protocol for Communications over Faulty Channels. [Citation Graph (0, 0)][DBLP]
    FORTE, 1995, pp:91-108 [Conf]
  16. Pierre Lescanne
    Current Trends in Rewriting Techniques and Related Problems. [Citation Graph (0, 0)][DBLP]
    Trends in Computer Algebra, 1987, pp:38-51 [Conf]
  17. Pierre Lescanne, Jean-Marc Steyaert
    On the Study Data Structures: Binary Tournaments with Repeated Keys. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:466-477 [Conf]
  18. Steffen van Bakel, Stephane Lengrand, Pierre Lescanne
    The Language chi: Circuits, Computations and Classical Logic. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:81-96 [Conf]
  19. Daniel J. Dougherty, Stephane Lengrand, Pierre Lescanne
    An Improved System of Intersection Types for Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:511-523 [Conf]
  20. Pierre Lescanne
    Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1981, pp:548-550 [Conf]
  21. Boutheina Chetali, Pierre Lescanne
    An Exercise in LP: The Proof of a Non Restoring Division Circuit. [Citation Graph (0, 0)][DBLP]
    Larch, 1992, pp:55-68 [Conf]
  22. Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
    Decidability of the Confluence of Ground Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:353-359 [Conf]
  23. Claude Kirchner, Pierre Lescanne
    Solving Disequations [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:347-352 [Conf]
  24. Pierre Lescanne
    Well Rewrite Orderings [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:249-256 [Conf]
  25. Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
    Strong Normalization of the Dual Classical Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:169-183 [Conf]
  26. Pierre Lescanne
    Rewrite Orderings and Termination of Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:17-27 [Conf]
  27. Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose
    Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. [Citation Graph (0, 0)][DBLP]
    PLILP, 1996, pp:393-407 [Conf]
  28. Pierre Lescanne
    Computer Experiments with the Reve Term Rewriting System Generator. [Citation Graph (0, 0)][DBLP]
    POPL, 1983, pp:99-108 [Conf]
  29. Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
    Characterizing strong normalization in a language with control operators. [Citation Graph (0, 0)][DBLP]
    PPDP, 2004, pp:155-166 [Conf]
  30. Pierre Lescanne, Jocelyne Rouyer-Degli
    Explicit Substitutions with de Bruijn's Levels. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:294-308 [Conf]
  31. Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne
    NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:141-157 [Conf]
  32. Pierre Lescanne
    REVE: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:482-483 [Conf]
  33. Françoise Bellegarde, Pierre Lescanne
    Transformation Ordering. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:69-80 [Conf]
  34. Pierre Lescanne
    Completion Procedures as Transition Rules + Control. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:28-41 [Conf]
  35. Daniel J. Dougherty, Pierre Lescanne
    Reductions, Intersection Types, and Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:121-135 [Conf]
  36. Silvia Ghilezan, Pierre Lescanne
    Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    TYPES, 2003, pp:226-241 [Conf]
  37. Françoise Bellegarde, Pierre Lescanne
    Termination by Completion. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1990, v:1, n:, pp:79-96 [Journal]
  38. Jürgen Giesl, Pierre Lescanne
    Special Issue "Termination". [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:1/2, pp:1-2 [Journal]
  39. Pierre Lescanne
    Behavioural Categoricity of Abstract Data Type Specifications. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1983, v:26, n:4, pp:289-292 [Journal]
  40. Pierre Lescanne
    Well quasi-ordering in a paper by Maurice Janet. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:39, n:, pp:185-188 [Journal]
  41. Pierre Lescanne
    Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1986, v:30, n:, pp:80-83 [Journal]
  42. Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
    Intersection and Union Types in the lambda-my-my/tilde-calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:136, n:, pp:153-172 [Journal]
  43. Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang
    Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:127, n:5, pp:57-82 [Journal]
  44. Pierre Lescanne, René David, Marek Zaionc
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:140, n:, pp:1- [Journal]
  45. Pierre Lescanne
    Termination of Rewrite Systems by Elementary Interpretations. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1995, v:7, n:1, pp:77-90 [Journal]
  46. Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison
    Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:88, n:2, pp:187-201 [Journal]
  47. Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel
    Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:84, n:1, pp:47-70 [Journal]
  48. Stephane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel
    Intersection types for explicit substitutions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:1, pp:17-42 [Journal]
  49. Jean-Pierre Jouannaud, Pierre Lescanne
    On Multiset Orderings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:2, pp:57-63 [Journal]
  50. Pierre Lescanne
    Équivalence Entre la Famille des Ensembles Réguliers et la Famille des Ensembles Algébriques. [Citation Graph (0, 0)][DBLP]
    ITA, 1976, v:10, n:2, pp:57-81 [Journal]
  51. Pierre Lescanne
    Modèles non Déterministes de Types Abstraits. [Citation Graph (0, 0)][DBLP]
    ITA, 1982, v:16, n:3, pp:225-244 [Journal]
  52. Pierre Lescanne
    Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1982, v:16, n:4, pp:331-347 [Journal]
  53. Pierre Lescanne
    On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1990, v:6, n:1, pp:39-49 [Journal]
  54. Frédéric Lang, Pierre Lescanne
    On Strong Normalization of Explicit Substitution Calculi (Short Note). [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2000, v:2000, n:7, pp:- [Journal]
  55. Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, Jocelyne Rouyer-Degli
    lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:5, pp:699-722 [Journal]
  56. Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch
    The Term Rewriting Approach to Automated Theorem Proving. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:14, n:1&2, pp:71-99 [Journal]
  57. Pierre Lescanne, Wolfgang Wechler
    Introduction - ALP 1988. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:12, n:3&4, pp:189- [Journal]
  58. Hubert Comon, Pierre Lescanne
    Equational Problems and Disunification. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:3/4, pp:371-425 [Journal]
  59. Pierre Lescanne
    Well Rewrite Orderings and Well Quasi-Orderings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1992, v:14, n:5, pp:419-436 [Journal]
  60. Daniel J. Dougherty, Pierre Lescanne
    Reductions, Intersection Types, and Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:1, pp:55-85 [Journal]
  61. Ahlem Ben Cherifa, Pierre Lescanne
    Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1987, v:9, n:2, pp:137-159 [Journal]
  62. Gregory Kucherov, Pierre Lescanne, Peter D. Mosses
    Valentin M. Antimirov (1961-1995). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:289-290 [Journal]
  63. Pierre Lescanne
    On Termination of One Rule Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:395-401 [Journal]
  64. Pierre Lescanne
    Mechanizing common knowledge logic using COQ. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:48, n:1-2, pp:15-43 [Journal]

  65. Manipulation d'arbres syntaxiques et contruction de programmes (Résumé). [Citation Graph (, )][DBLP]


  66. Manipulation d'arbres syntaxiques et contruction de programmes. [Citation Graph (, )][DBLP]


  67. Dynamic Logic of Common Knowledge in a Proof Assistant [Citation Graph (, )][DBLP]


  68. Common knowledge logic in a higher order proof assistant? [Citation Graph (, )][DBLP]


  69. (Mechanical) Reasoning on Infinite Extensive Games [Citation Graph (, )][DBLP]


  70. Conversion/Preference Games [Citation Graph (, )][DBLP]


  71. Deconstruction of Infinite Extensive Games using coinduction [Citation Graph (, )][DBLP]


  72. Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games [Citation Graph (, )][DBLP]


  73. On the Rationality of Escalation [Citation Graph (, )][DBLP]


  74. On the Rationality of Escalation [Citation Graph (, )][DBLP]


Search in 0.109secs, Finished in 0.114secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002