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 « Arity »
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.
Arithmetical crossover < Arity < Arity constraint  Facettes :

List of bibliographic references indexed by Arity

Number of relevant bibliographic references: 20.
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
009171 (2001) E. A. Cichon [France] ; E. Tahhan-Bittar [Venezuela]Strictly orthogonal left linear rewrite systems and primitive recursion
009254 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
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
009E27 (2000) Reinhard PichlerSpeeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria
009E55 (2000) Jordi Levy [Espagne] ; Margus Veanes [Colombie]On the Undecidability of Second-Order Unification
009E76 (2000) Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]Invariants, Patterns and Weights for Ordering Terms
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
00B361 (1998) Rolf Backofen [Allemagne] ; Ralf Treinen [France]How to Win a Game with Features
00B382 (1998) H. Comon [France]Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
00BB19 (1997) Manuel M. T. Chakravarty [Japon] ; Hendrik C. R. Lock [Allemagne]Towards the uniform implementation of declarative languages
00BB57 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
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
00C658 (1995) Rolf Backofen [Allemagne]A complete axiomatization of a theory with feature and arity constraints
00D184 (1993) Thomas Lehmann [Allemagne] ; Jacques Loeckx [Allemagne]OBSCURE a specification language for abstract data types
00DA45 (1991) G. Marongiu [Italie] ; S. Tulipani [Italie]Quantifier elimination for infinite terms
00DE27 (1990) Pierre Lescanne [France]On the recursive decomposition ordering with lexicographical status and other related orderings
00DE51 (1990) Jeremy Dick [Royaume-Uni] ; John Kalmus [Royaume-Uni] ; Ursula Martin [Royaume-Uni]Automating the Knuth Bendix ordering
00E052 (1989) Hassan Ait-Kaci [États-Unis] ; Roger Nasr [États-Unis]Integrating logic and functional programming

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

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