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

List of bibliographic references

Number of relevant bibliographic references: 46.
[0-20] [0 - 20][0 - 46][20-40]
Ident.Authors (with country if any)Title
000B27 (2009) Naohi Eguchi [Japon]A lexicographic path order with slow growing derivation bounds
001D65 (2001) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian Vittek [Slovaquie]A Pattern-Matching Compiler
001D95 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
001F42 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
001F57 (2000) Horatiu Cirstea [France] ; Claude Kirchner [France]The simply typed rewriting calculus
001F59 (2000) Hélène Kirchner [France] ; Isabelle Gnaedig [France]Termination and normalisation under strategy Proofs in ELAN
001F63 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
002008 (2000) Peter Borovansk [France] ; Claude Kirchner [France] ; Hélène Kirchner [France]Controlling Rewriting by Rewriting
002022 (2000) Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]A reflective extension of ELAN
002057 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
002080 (2000) Reinhard PichlerSpeeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria
002086 (2000) Hubert Comon [France]Sequentiality, Monadic Second-Order Logic and Tree Automata
002108 (2000) Jordi Levy [Espagne] ; Margus Veanes [Colombie]On the Undecidability of Second-Order Unification
002129 (2000) Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]Invariants, Patterns and Weights for Ordering Terms
002175 (2000) Ricardo Caferra [France] ; Nicolas PeltierCombining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
002209 (1999) David A. Plaisted [États-Unis] ; Gregory Kucherov [États-Unis, France]The complexity of some complementation problems
002462 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
002577 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
002607 (1998) C. Hintermeier [France] ; C. Kirchner [France] ; H. Kirchner [France]Dynamically Typed Computations for Order-sorted Equational Presentations
002615 (1998) H. Comon [France]Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
002636 (1998) A. Werner [Allemagne]A Semantic Approach to Order-sorted Rewriting

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 "Function symbols" 

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