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 « Theoretical computer science »
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.
Theoretical comput < Theoretical computer science < Theoretical computer science elseviefi  Facettes :

List of bibliographic references indexed by Theoretical computer science

Number of relevant bibliographic references: 58.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
007994 (2003) Didier Galmiche ; Daniel Me RySemantic Labelled Tableaux for Propositional BI⊥
009185 (2001) Bernhard Gramlich [Autriche]On interreduction of semi-complete term rewriting systems
009206 (2001) Vincent D. Blondel [Belgique] ; Olivier Bournez [France] ; Pascal Koiran [France] ; Christos H. Papadimitriou [États-Unis] ; John N. Tsitsiklis [États-Unis]Deciding stability and mortality of piecewise affine dynamical 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
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
009389 (2001) He Le Ne Kirchner ; Peter D. MossesAlgebraic Specifications, Higher‐order Types and Set‐theoretic Models
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
009D12 (2000) Carlos Castro [France]Solving Binary CSP Using Computational Systems
009D18 (2000) Didier Galmiche [France] ; David J. Pym [Royaume-Uni]Proof-search in type-theoretic languages: an introduction
009D19 (2000) D. Galmiche [France] ; J. M. Notin [France]Proof-search and Proof Nets in Mixed Linear Logic
009D21 (2000) D. GalmichePreface
009D41 (2000) Patrick Viry [Italie]Input/Output for ELAN
009D50 (2000) Iliano Cervesato [États-Unis] ; Joshua S. Hodas [États-Unis] ; Frank Pfenning [États-Unis]Efficient resource management for linear logic proof search
009D51 (2000) Peter Borovansk ; Claude Kirchner ; Hélène Kirchner ; Pierre-Etienne Moreau ; Marian VittekELAN
009D55 (2000) Peter Borovansk [France] ; Claude Kirchner [France] ; Hélène Kirchner [France]Controlling Rewriting by Rewriting
009D69 (2000) Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]A reflective extension of ELAN
00A824 (1999) Alain Denise [France] ; Paul Zimmermann [France]Uniform random generation of decomposable structures using floating-point arithmetic
00A832 (1999) Mark Van Den Brand ; Rakesh VermaPreface

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 "Theoretical computer science" 

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