Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (Crin)

Index « Auteurs » - entrée « Pierre Lescanne »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Pierre Leblond < Pierre Lescanne < Pierre Marchal  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 51.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
001782 (2000) Frederic Lang ; Pierre Lescanne [France] ; Luigi Liquori ; Dan Dougherty ; Rose KristofferA Generic Object-Calculus Based on Addressed Term Rewriting Systems
002943 (1996) Z. Benaissa ; Daniel Briaud ; Pierre Lescanne [France] ; J. Rouyer-DegliLambda upsilon, A Calculus of Explicit Substitutions which Preserves Strong Normalisation
002971 (1996) Pierre Lescanne [France]La science informatique en Lorraine
002B20 (1995) B. Chetali ; Pierre Lescanne [France]Formal Verification of a Protocol for Communications over Faulty Channels
002B86 (1995) Pierre Lescanne [France] ; J. Rouyer-DegliExplicit Substitutions with de Bruijn's Levels
002C25 (1995) Z. Benaissa ; Pierre Lescanne [France]Triad Machine ; A General Computational Model for the Description of Abstract Machines
002D43 (1995) Pierre Lescanne [France]Termination of rewrite systems by elementary interpretations
002F39 (1994) J. Rouyer ; Pierre Lescanne [France]Verification and Programming of First-order Unification, in the Calculus of Constructions with Inductive Type
002F97 (1994) Z. Benaissa ; Pierre Lescanne [France]A Suitable Environments for an Efficient Calculus of Explicit Substitutions
003034 (1994) Pierre Lescanne [France]From λσ to λ\upsilon, a Journey through Calculi of Explicit Substitutions
003120 (1994) Pierre Lescanne [France]An Introduction to ORME
003142 (1994) Pierre Lescanne [France]On Termination of one Rule Rewrite Systems
003180 (1994) Pierre Lescanne [France] ; J. Rouyer-DegliThe Calculus of Explicit Substitutions λ\upsilon
003516 (1992) Pierre Lescanne [France]Well Rewrite Orderings and Well Quasi-Orderings
003667 (1992) B. Chetali ; Pierre Lescanne [France]An Exercice in LP : The Proof of a Non Restoring Division Circuit
003669 (1992) E. A. Cichon ; Pierre Lescanne [France]Polynomial Interpretations and the Complexity of Algorithms
003724 (1992) J. Hsiang ; H. Kirchner ; Pierre Lescanne [France] ; M. RusinowitchThe Term Rewriting Approach to Automated Theorem Proving
003733 (1992) Pierre Lescanne [France]Termination of Rewrite Systems by Elementary Interpretations
003812 (1991) Pierre Lescanne [France]Well Rewrite Orderings and Well Quasi-Orderings
003883 (1991) Pierre Lescanne [France]Rewrite Orderings and Termination of Rewrite Systems
003920 (1991) Pierre Lescanne [France]Proving Identities in Commutative Semigroups and Monoids : An Automaton Approach

List of associated KwdEn.i

Nombre de
documents
Descripteur
15rewriting
11termination
4completion
3confluence
3unification
2equational theories
2inductive equalities
2narrowing
2term rewrite systems
1CLU
1Knuth-Bendix algorithm
1Larch prover
1ORME
1Rewrite systems
1associative and commutative completion
1associativity and commutativity
1automates finis
1communication protocol
1completion procedure
1complexity
1computer checked proof
1conditional rewriting
1critical pair
1disequations
1disunification
1elementary interpretation
1elementary interpretations
1equational problems
1expert system
1extention for parallelism
1formal verification and protocol verification
1free algebra
1functional programming
1ground terms rewrite systems
1initial algebra
1lambda calcul
1lambda calculus
1logic programming
1model
1object calculi
1order
1polynomial
1problème du mot
1rewrite ordering
1rewrite system
1rewrite systems
1rewriting system
1rewriting systems
1run-time system and garbage collection
1simplification ordering
1specification
1term rewriting system
1termiation
1terminaison
1termination of rewrite system
1termination of rewriting system
1terms
1theorem prover
1theorem proving
1total connection
1transformation ordering
1tree transducers
1unity
1well foundedness
1well quasi-orderings
1well-foundedness
1égalités

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdIndexSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/Author.i -k "Pierre Lescanne" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/Author.i  \
                -Sk "Pierre Lescanne" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Crin
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Author.i
   |clé=    Pierre Lescanne
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022