Induction hypotheses < Induction hypothesis < Induction methods

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f KwdFr.f Mesh.f MeshFr.f Teeft.f

List of bibliographic references indexed by Induction hypothesis

Number of relevant bibliographic references: 42.
[0-20] [0 - 20][0 - 42][20-40]

Ident.	Authors (with country if any)	Title
003A20 (2009)	Naohi Eguchi [Japon]	A lexicographic path order with slow growing derivation bounds
007994 (2003)	Didier Galmiche ; Daniel Me Ry	Semantic Labelled Tableaux for Propositional BI⊥
009171 (2001)	E. A. Cichon [France] ; E. Tahhan-Bittar [Venezuela]	Strictly orthogonal left linear rewrite systems and primitive recursion
009185 (2001)	Bernhard Gramlich [Autriche]	On interreduction of semi-complete term rewriting systems
009320 (2001)	N. Peltier [France]	On the decidability of the PVD class with equality
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. Mosses	Algebraic Specifications, Higher‐order Types and Set‐theoretic Models
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
009D50 (2000)	Iliano Cervesato [États-Unis] ; Joshua S. Hodas [États-Unis] ; Frank Pfenning [États-Unis]	Efficient resource management for linear logic proof search
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
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 Peltier	Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
00A824 (1999)	Alain Denise [France] ; Paul Zimmermann [France]	Uniform random generation of decomposable structures using floating-point arithmetic
00A836 (1999)	Alexander Bockmayr [France] ; Friedrich Eisenbrand [Allemagne] ; Mark Hartmann [États-Unis] ; Andreas S. Schulz [États-Unis]	On the Chvátal rank of polytopes in the 0/1 cube
00A857 (1999)	Philippe De Groote [France]	An algebraic correctness criterion for intuitionistic multiplicative proof-nets
00A862 (1999)	G. Perrier [France]	A PSPACE-complete fragment of second-order linear logic
00A982 (1999)	G. Perrier [France]	Labelled proof nets for the syntax and semantics of natural languages
00B231 (1998)	M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]	Transformational methodology for proving termination of logic programs

---

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 "Induction hypothesis" 

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

---

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