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 « Axiom »
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.
Axillary buds < Axiom < Axiom link  Facettes :

List of bibliographic references indexed by Axiom

Number of relevant bibliographic references: 52.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
004429 (2008) Ricardo Caferra [France] ; Nicolas Peltier [France]Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview
009334 (2001) François Fages [France] ; Paul Ruet [France] ; Sylvain Soliman [France]Linear Concurrent Constraint Programming: Operational and Phase Semantics
009389 (2001) He Le Ne Kirchner ; Peter D. MossesAlgebraic Specifications, Higher‐order Types and Set‐theoretic Models
009400 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D18 (2000) Didier Galmiche [France] ; David J. Pym [Royaume-Uni]Proof-search in type-theoretic languages: an introduction
009D56 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
009D69 (2000) Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]A reflective extension of ELAN
009E04 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
009E84 (2000) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Higher Order Unification via Explicit Substitutions
00A857 (1999) Philippe De Groote [France]An algebraic correctness criterion for intuitionistic multiplicative proof-nets
00A982 (1999) G. Perrier [France]Labelled proof nets for the syntax and semantics of natural languages
00B235 (1998) D. Galmiche [France] ; B. Martin [France]Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic
00B273 (1998) G. Canals [France] ; C. Godart [France] ; P. Molli [France] ; M. Munier [France]A criterion to enforce correctness of indirectly cooperating applications
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
00B352 (1998) Roberto Segala [Italie] ; Rainer Gawlick ; J Rgen S Gaard-Andersen [Danemark] ; Nancy LynchLiveness in Timed and Untimed Systems
00B361 (1998) Rolf Backofen [Allemagne] ; Ralf Treinen [France]How to Win a Game with Features
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
00BC40 (1997) Zena M. Ariola ; Jan Willem Klop [Pays-Bas]Lambda Calculus with Explicit Recursion

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

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