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 « Function symbol »
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.
Function space < Function symbol < Function symbols  Facettes :

List of bibliographic references indexed by Function symbol

Number of relevant bibliographic references: 32.
[0-20] [0 - 20][0 - 32][20-31][20-40]
Ident.Authors (with country if any)Title
009224 (2001) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian Vittek [Slovaquie]A Pattern-Matching Compiler
009254 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
009320 (2001) N. Peltier [France]On the decidability of the PVD class with equality
009D05 (2000) Horatiu Cirstea [France] ; Claude Kirchner [France]The simply typed rewriting calculus
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
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
00B231 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
00B382 (1998) H. Comon [France]Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
00B403 (1998) A. Werner [Allemagne]A Semantic Approach to Order-sorted Rewriting
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
00BC31 (1997) Alfons Geser [Allemagne]Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems
00BF30 (1996) Adel Bouhoula [France]Using induction and rewriting to verify and complete parameterized specifications
00C007 (1996) M. C. F. Ferreira [Pays-Bas] ; H. Zantema [Pays-Bas]Total termination of term rewriting
00C093 (1996) Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]Any ground associative-commutative theory has a finite canonical system
00C098 (1996) A. Geser [Allemagne]An Improved General Path Order
00C105 (1996) Maribel Fernández [France]AC Complement Problems: Satisfiability and Negation Elimination
00C649 (1995) Maria Alpuente [Espagne] ; Moreno Falaschi [Espagne] ; Ferdinando Manzo [Espagne]Analyses of unsatisfiability for equational logic 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 "Function symbol" 

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