Teeft.i
Checkpoint
Istex
Racine
Checkpoint
Istex
Exploration
Accueil
Racine
Racine

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

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

Number of relevant bibliographic references: 27.
[0-20] [0 - 20][0 - 27][20-26][20-40]
Ident.Authors (with country if any)Title
001564 (2005) Olivier Bournez ; Felipe Cucker ; Paulin Jacobe De Naurois ; Jean-Yves MarionImplicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
001A16 (2003) Birgit Stehno [Autriche] ; Gregor Retti [Autriche]Modelling the logical structure of books and journals using augmented transition network grammars
001E94 (2001) Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. McconnellEfficient and Practical Algorithms for Sequential Modular Decomposition
001F01 (2001) Y.-F. S. Pétermann [Suisse] ; Jean-Luc Rémy [France] ; Ilan Vardi [France]Discrete Derivatives of Sequences
001F42 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
002129 (2000) Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]Invariants, Patterns and Weights for Ordering Terms
002134 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
002135 (2000) Index
002208 (1999) Alain Denise [France] ; Paul Zimmermann [France]Uniform random generation of decomposable structures using floating-point arithmetic
002236 (1999) Cumulative index volumes 1–200
002462 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
002470 (1998) E. A. Cichon [France] ; E. Tahhan Bittar [France]Ordinal recursive bounds for Higman's theorem
002655 (1997) E. A. Cichon [France] ; A. Weiermann [France]Term rewriting theory for the primitive recursive functions
002689 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
002777 (1997) Nicolas Peltier [France]Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
002908 (1996) M. C. F. Ferreira [Pays-Bas] ; H. Zantema [Pays-Bas]Total termination of term rewriting
002963 (1996) Francois Bronsard [France] ; Uday S. Reddy [États-Unis] ; Robert W. Hasker [États-Unis]Induction using term orders
002999 (1996) A. Geser [Allemagne]An Improved General Path Order
002A56 (1995) Cumulative index volumes 101–150
002A57 (1995) Cumulative index volumes 101–150
002D24 (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/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i -k "Recursive" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i  \
                -Sk "Recursive" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |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