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 « Natural numbers »
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.
Natural number < Natural numbers < Natural object  Facettes :

List of bibliographic references indexed by Natural numbers

Number of relevant bibliographic references: 29.
[0-20] [0 - 20][0 - 29][20-28][20-40]
Ident.Authors (with country if any)Title
009171 (2001) E. A. Cichon [France] ; E. Tahhan-Bittar [Venezuela]Strictly orthogonal left linear rewrite systems and primitive recursion
009224 (2001) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian Vittek [Slovaquie]A Pattern-Matching Compiler
009389 (2001) He Le Ne Kirchner ; Peter D. MossesAlgebraic Specifications, Higher‐order Types and Set‐theoretic Models
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D57 (2000) Delia Kesner [France]Confluence of extensional and non-extensional λ-calculi with explicit substitutions
009E27 (2000) Reinhard PichlerSpeeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
00B239 (1998) E. A. Cichon [France] ; E. Tahhan Bittar [France]Ordinal recursive bounds for Higman's theorem
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
00BB18 (1997) Miki Hermann [France] ; Roman Galbav [France]Unification of infinite sets of terms schematized by primal grammars
00BB23 (1997) E. A. Cichon [France] ; A. Weiermann [France]Term rewriting theory for the primitive recursive functions
00BB52 (1997) Farid Ajili [France] ; Evelyne Contejean [France]Avoiding slack variables in the solving of linear diophantine equations and inequations
00BB57 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
00BC52 (1997) Ruy J. G. B. De QueirozFourth Workshop on Logic, Language, Information and Computation (WoLLIC'97)
00BC71 (1997) Adel Bouhoula [États-Unis]Automated Theorem Proving by Test Set Induction
00BF60 (1996) Martin Russling [Allemagne]Deriving a class of layer-oriented graph algorithms
00C007 (1996) M. C. F. Ferreira [Pays-Bas] ; H. Zantema [Pays-Bas]Total termination of term rewriting
00C098 (1996) A. Geser [Allemagne]An Improved General Path Order
00C607 (1995) Gregory Kucherov [France] ; Michaël Rusinowitch [France]Undecidability of ground reducibility for word rewriting systems with variables
00C626 (1995) Roger Duke [Australie] ; Gordon Rose [Australie] ; Graeme Smith [Australie]Object-Z: A specification language advocated for the description of standards
00C698 (1995) Pierre Lescanne [France]Termination of rewrite systems by elementary interpretations

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 "Natural numbers" 

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