Keywords
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

Index « Keywords » - entrée « Lambda calculus »
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.
Labyrinth < Lambda calculus < Lambda mu calculus  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 23.
[0-20] [0 - 20][0 - 23][20-22][20-40]
Ident.Authors (with country if any)Title
000285 (2008) Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France]A Logical Account of PSPACE
000363 (2006) Frédéric Blanqui ; Claude Kirchner ; Colin RibaOn the confluence of λ-calculus with conditional rewriting
000449 (2005) Clara Bertolissi [France]The graph rewriting calculus : Confluence and expressiveness
000476 (2005) Francois Lamarche [France] ; Lutz Strassburger [Allemagne]Naming proofs in classical propositional logic
000574 (2004) Horatiu Cirstea [France] ; Luigi Liquori [France] ; Benjamin Wack [France]Rewriting calculus with fixpoints: Untyped and first-order systems
000599 (2004) Philippe De Groote [France] ; Sylvain Salvati [France]Higher-order matching in the linear λ-calculus with pairing
000673 (2003) René David [France] ; Bruno Guillaume [France]Strong normalization of the typed λws-calculus
000679 (2003) Gilles Barthe [États-Unis, France] ; Horatiu Cirstea ; Claude Kirchner ; Luigi LiquoriPure patterns Type systems
000808 (2002) Germain Faure [France] ; Claude Kirchner [France]Exceptions in the rewriting calculus
000877 (2001) Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France]The Rho cube
000880 (2001) Philippe De Groote [France]Strong normalization of classical natural deduction with disjunction
000976 (2000) M. W. Bunder [Australie]Proof finding algorithms for implicational logics
000986 (2000) E. Ritter [Royaume-Uni] ; D. Pym [Royaume-Uni] ; L. Wallen [Royaume-Uni]On the intuitionistic force of classical search
000995 (2000) G. Dowek [France] ; T. Hardin [France] ; C. Kirchner [France]Higher order unification via explicit substitutions
000A69 (1999) P. De Groote [France]On the strong normalisation of natural deduction with permutation-conversions
000A82 (1999) G. Dowek [France] ; T. Hardin [France] ; C. Kirchner [France]Hol-λσ : An intentional first-order expression of higher-order logic
000B10 (1999) C. Piliere [France]A confluence result for a typed λ-calculus of exception handling with fixed-point
000C13 (1997) S. Malecki [France]Proofs in system Fω can be done in system Fω 1
000C15 (1997) C. Retore [France]Pomset logic : A non-commutative extension of classical linear logic
000C25 (1997) C. Kirchner [France] ; C. Ringeissen [France]Higher-order equational unification via explicit substitutions
000C88 (1996) Z.-E.-A. Benaissa [France] ; Pierre Lescanne [France] ; K. H. Rose [Danemark]Modeling sharing and recursion for weak reduction strategies using explicit substitution

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i -k "Lambda calculus" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i  \
                -Sk "Lambda calculus" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Lambda calculus
}}
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