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 « Recursive »
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.
Recursion variables < Recursive < Recursive algorithm  Facettes :

List of bibliographic references indexed by Recursive

Number of relevant bibliographic references: 27.
[0-20] [0 - 20][0 - 27][20-26][20-40]
Ident.Authors (with country if any)Title
006250 (2005) Olivier Bournez ; Felipe Cucker ; Paulin Jacobe De Naurois ; Jean-Yves MarionImplicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
007A26 (2003) Birgit Stehno [Autriche] ; Gregor Retti [Autriche]Modelling the logical structure of books and journals using augmented transition network grammars
009352 (2001) Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. McconnellEfficient and Practical Algorithms for Sequential Modular Decomposition
009359 (2001) Y.-F. S. Pétermann [Suisse] ; Jean-Luc Rémy [France] ; Ilan Vardi [France]Discrete Derivatives of Sequences
009400 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
009E76 (2000) Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]Invariants, Patterns and Weights for Ordering Terms
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
009E82 (2000) Index
00A824 (1999) Alain Denise [France] ; Paul Zimmermann [France]Uniform random generation of decomposable structures using floating-point arithmetic
00A851 (1999) Cumulative index volumes 1–200
00B231 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
00B239 (1998) E. A. Cichon [France] ; E. Tahhan Bittar [France]Ordinal recursive bounds for Higman's theorem
00BB23 (1997) E. A. Cichon [France] ; A. Weiermann [France]Term rewriting theory for the primitive recursive functions
00BB57 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
00BC44 (1997) Nicolas Peltier [France]Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
00C007 (1996) M. C. F. Ferreira [Pays-Bas] ; H. Zantema [Pays-Bas]Total termination of term rewriting
00C062 (1996) Francois Bronsard [France] ; Uday S. Reddy [États-Unis] ; Robert W. Hasker [États-Unis]Induction using term orders
00C098 (1996) A. Geser [Allemagne]An Improved General Path Order
00C641 (1995) Cumulative index volumes 101–150
00C642 (1995) Cumulative index volumes 101–150
00CD35 (1994) Pieter H. Hartel [Pays-Bas] ; Hugh Glaser [Royaume-Uni] ; John M. Wild [Royaume-Uni]Compilation of functional languages using flow graph analysis

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 "Recursive" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Recursive" \
         | 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é=    Recursive
}}
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