Teeft.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Teeft.i » - entrée « Derivation »
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.
Derivable < Derivation < Derivation bounds  Facettes :

List of bibliographic references indexed by Derivation

Number of relevant bibliographic references: 20.
Ident.Authors (with country if any)Title
003A20 (2009) Naohi Eguchi [Japon]A lexicographic path order with slow growing derivation bounds
009171 (2001) E. A. Cichon [France] ; E. Tahhan-Bittar [Venezuela]Strictly orthogonal left linear rewrite systems and primitive recursion
009262 (2001) H. Cirstea [France] ; K. Kirchner [France]The rewriting calculus - part I
009268 (2001) Alessandro Armando [Italie] ; Alessandro Coglio [États-Unis] ; Fausto Giunchiglia [Italie] ; Silvio Ranise [Italie]The Control Layer in Open Mechanized Reasoning Systems: Annotations and Tactics
009400 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
009D07 (2000) Hélène Kirchner [France] ; Isabelle Gnaedig [France]Termination and normalisation under strategy Proofs in ELAN
009D50 (2000) Iliano Cervesato [États-Unis] ; Joshua S. Hodas [États-Unis] ; Frank Pfenning [États-Unis]Efficient resource management for linear logic proof search
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
00AA13 (1999) Joost Engelfriet [Pays-Bas]Derivation Trees of Ground Term Rewriting Systems
00B359 (1998) Jean-Camille Birget [États-Unis]Infinite String Rewrite Systems and Complexity
00B375 (1998) C. Hintermeier [France] ; C. Kirchner [France] ; H. Kirchner [France]Dynamically Typed Computations for Order-sorted Equational Presentations
00BC52 (1997) Ruy J. G. B. De QueirozFourth Workshop on Logic, Language, Information and Computation (WoLLIC'97)
00BC74 (1997) Gilles Richard ; Fre De Ric SaubionAnswer Synthesis for CLP Programs with Negation
00C098 (1996) A. Geser [Allemagne]An Improved General Path Order
00C649 (1995) Maria Alpuente [Espagne] ; Moreno Falaschi [Espagne] ; Ferdinando Manzo [Espagne]Analyses of unsatisfiability for equational logic programming
00C684 (1995) Wlodzimierz Drabent [Pologne, Suède]What is failure? An approach to constructive negation
00D209 (1993) Alexander Bockmayr [Allemagne]Conditional narrowing modulo a set of equations
00D657 (1992) Maribel Fernández [France]Narrowing based procedures for equational disunification
00D683 (1992) Joost Engelfriet [Pays-Bas] ; Linda Heyker [Pays-Bas]Context-free hypergraph grammars have the same term-generating power as attribute grammars
00E855 (1986) Ian Toyn [Royaume-Uni] ; Colin Runciman [Royaume-Uni]Adapting combinator and SECD machines to display snapshots of functional computations

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i -k "Derivation" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Derivation" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Teeft.i
   |clé=    Derivation
}}
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