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 « Normal form »
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.
Normal force < Normal form < Normal form analysis  Facettes :

List of bibliographic references indexed by Normal form

Number of relevant bibliographic references: 39.
[0-20] [0 - 20][0 - 39][20-38][20-40]
Ident.Authors (with country if any)Title
009185 (2001) Bernhard Gramlich [Autriche]On interreduction of semi-complete term rewriting systems
009224 (2001) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian Vittek [Slovaquie]A Pattern-Matching Compiler
009262 (2001) H. Cirstea [France] ; K. Kirchner [France]The rewriting calculus - part I
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
009D07 (2000) Hélène Kirchner [France] ; Isabelle Gnaedig [France]Termination and normalisation under strategy Proofs in ELAN
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D41 (2000) Patrick Viry [Italie]Input/Output for ELAN
009D57 (2000) Delia Kesner [France]Confluence of extensional and non-extensional λ-calculi with explicit substitutions
009D69 (2000) Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]A reflective extension of ELAN
009E33 (2000) Hubert Comon [France]Sequentiality, Monadic Second-Order Logic and Tree Automata
009E55 (2000) Jordi Levy [Espagne] ; Margus Veanes [Colombie]On the Undecidability of Second-Order Unification
009E84 (2000) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Higher Order Unification via Explicit Substitutions
009F22 (2000) Ricardo Caferra [France] ; Nicolas PeltierCombining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
00AA68 (1999) K. Stokkermans [Autriche]A Categorical Critical-pair Completion Algorithm
00B361 (1998) Rolf Backofen [Allemagne] ; Ralf Treinen [France]How to Win a Game with Features
00B375 (1998) C. Hintermeier [France] ; C. Kirchner [France] ; H. Kirchner [France]Dynamically Typed Computations for Order-sorted Equational Presentations
00B403 (1998) A. Werner [Allemagne]A Semantic Approach to Order-sorted Rewriting
00BB18 (1997) Miki Hermann [France] ; Roman Galbav [France]Unification of infinite sets of terms schematized by primal grammars
00BB57 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
00BC26 (1997) Robert Nieuwenhuis [Espagne] ; Albert Rubio [Espagne]Paramodulation with Built-in AC-Theories and Symbolic Constraints

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 "Normal form" 

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