Réductions parallèles dans le Lambda-Calcul : non-existence d'une stratégie optimale fondéesur le partageGengler, Marc; Saint James, Emmanuel.1989, 312 p.Thesis

Syntaxe et sémantique de la facilité en lambda-calcul = Syntax and semantics of ease in lambda-calculusZylberajch, Cécile; Krivine, Jean-Louis.1991, 83 p.Thesis

COMPLEXITY OF NORMALIZATION IN THE PURE TYPED LAMBDA-CALCULUSSCHWICHTENBERG H.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 110; PP. 453-457; BIBL. 5 REF.Conference Paper

AN EXTENSION OF THE BASIC FUNCTIONALITY THEORY FOR THE LAMBDA -CALCULUSCOPPO M; DEZANI CIANCAGLINI M.1980; NOTRE DAME J. FORMAL LOGIC; ISSN 0029-4527; USA; DA. 1980; VOL. 21; NO 4; PP. 685-693; BIBL. 17 REF.Article

AN ALGEBRAIC INTERPRETATION OF THE LAMBDA BETA K-CALCULUS AND A LABELLED LAMBDA -CALCULUS.LEVY JJ.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 103; PP. (27P.); ABS. FR.; BIBL. 15 REF.Article

UN MODELLO DI D-CALCOLO FORTEMENTE EQUIVALENTE AGLI SCHEMI RICORSIVI. = MODELE DE 1-CALCUL FORTEMENT EQUIVALENT AUX SCHEMAS RECURSIFSSIMONE C.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 111-125; ABS. ANGL.; BIBL. 9 REF.Article

RECURSION THEORY AND THE LAMBDA-CALCULUSBYERLY RE.1982; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1982; VOL. 47; NO 1; PP. 67-83; BIBL. 9 REF.Article

DISCRIMINABILITY OF INFINITE SETS OF TERMS IN THE D_INFINI-MODELS OF THE LAMBDA -CALCULUSRONCHI DELLA ROCCA S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 350-364; BIBL. 14 REF.Conference Paper

THE CHURCH-ROSSER THEOREM FOR THE TYPED LAMBDA -CALCULUS WITH SURJECTIVE PAIRINGPOTTINGER G.1981; NOTRE DAME J. FORMAL LOGIC; ISSN 0029-4527; USA; DA. 1981; VOL. 22; NO 3; PP. 264-268; BIBL. 3 REF.Article

REDUCTIONS SURES DANS LE LAMBDA-CALCUL.LEVY JJ.1974; ; S.L.; DA. 1974; PP. 1-105; BIBL. 1 P. 1/2; (THESE DOCT. 3EME CYCLE, SPEC. MATH., MENTION INF. ALGEBRIQUE; PARIS VII)Thesis

WHAT IS A MODEL OF THE LAMBDA CALCULUS.MEYER AR.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 87-122; BIBL. 2 P.Article

CHARACTERIZATION OF NORMAL FORMS POSSESSING INVERSE IN THE LAMBDA -BETA -ETA -CALCULUS.DEZANI CIANCAGLINI M.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 3; PP. 323-337; BIBL. 3 REF.Article

Comparing Hagino's categorical programming language and typed lambda-calculiDYBKJÆR, H; MELTON, A.Theoretical computer science. 1993, Vol 111, Num 1-2, pp 145-189, issn 0304-3975Conference Paper

A type-theoretical alternative to ISWIM, CUCH, OWHYSCOTT, D. S.Theoretical computer science. 1993, Vol 121, Num 1-2, pp 411-440, issn 0304-3975Article

SOME SYNTACTIC AND CATEGORICAL CONSTRUCTIONS OF LAMBDA-CALCULUS MODELSBERRY GERARD.1981; ; FRA; PARIS: IMPR. I.N.R.I.A.; DA. 1981; INRIA/80; PAG. MULT.; 30 CM; ABS. FRE; BIBL. 33 REF.;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 80]Report

LAMBDA CALCULUS: SOME MODELS, SOME PHILOSOPHYSCOTT D.1980; STUD. LOGIC FOUND. MATH.; NLD; DA. 1980; VOL. 101; PP. 223-265; BIBL. 3 P.Conference Paper

LAMBDA-CALCULUS MODELS AND EXTENSIONALITYHINDLEY R; LONGO G.1980; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1980; VOL. 26; NO 4; PP. 289-310; BIBL. 20 REF.Article

PROOFS OF THE NORMALIZATION AND CHURCH-ROSSER THEOREMS FOR THE TYPED LAMBDA -CALCULUS.POTTINGER G.1978; NOTRE DAME J. FORM. LOGIC; USA; DA. 1978; VOL. 19; NO 3; PP. 445-451; BIBL. 1 REF.Article

INTUITONISTIC PROPOSITIONAL LOGIC IS POLYNOMIAL-SPACE COMPLETESTATMAN R.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 67-72; BIBL. 14 REF.Article

SEMANTIQUE FORMELLE DES OPERATEURS D'UN LANGAGE DE LISTES.CASTANET R.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 3; PP. 19-36; BIBL. 13 REF.Article

Representations of first order function types as terminal coalgebrasALTENKIRCH, Thorsten.Lecture notes in computer science. 2001, pp 8-21, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Quelques résultats sur le λ C-calcul = Some results about λ C-calculKARIM NOUR.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 320, Num 3, pp 259-262, issn 0764-4442Article

The small grzegorczyk classes and the typed λ-calculusKRISTIANSEN, Lars; BARRA, Mathias.Lecture notes in computer science. 2005, pp 252-262, issn 0302-9743, isbn 3-540-26179-6, 11 p.Conference Paper

Reductions, intersection types, and explicit substitutionsDOUGHERTY, Dan; LESCANNE, Pierre.Lecture notes in computer science. 2001, pp 121-135, issn 0302-9743, isbn 3-540-41960-8Conference Paper

On the Jacopini techniqueKUPER, J.Information and computation (Print). 1997, Vol 138, Num 2, pp 101-123, issn 0890-5401Article