Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LAMBDA CALCULUS")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1321

  • Page / 53

Export

Selection :

  • and

Differential interaction netsEHRHARD, T; REGNIER, L.Theoretical computer science. 2006, Vol 364, Num 2, pp 166-195, issn 0304-3975, 30 p.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

DISCRIMINABILITY OF INFINITE SETS OF TERMS IN THE DINFINI-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

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

Uniformity and the Taylor expansion of ordinary lambda-termsEHRHARD, Thomas; REGNIER, Laurent.Theoretical computer science. 2008, Vol 403, Num 2-3, pp 347-372, issn 0304-3975, 26 p.Article

Threesomes, With and Without BlameSIEK, Jeremy G; WADLER, Philip.ACM SIGPLAN notices. 2010, Vol 45, Num 1, pp 365-376, issn 1523-2867, 12 p.Conference Paper

Functions over free algebras definable in the simply typed lambda calculusLEIVANT, D.Theoretical computer science. 1993, Vol 121, Num 1-2, pp 309-321, issn 0304-3975Article

Strong normalization from an unusual point of viewPAOLINI, Luca; PIMENTEL, Elaine; RONCHI DELLA ROCCA, Simona et al.Theoretical computer science. 2011, Vol 412, Num 20, pp 1903-1915, issn 0304-3975, 13 p.Article

A call-by-name lambda-calculus machineKRIVINE, Jean-Louis.Higher-order and symbolic computation. 2007, Vol 20, Num 3, pp 199-207, issn 1388-3690, 9 p.Article

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

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

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

CHURCH-ROSSER STRATEGIES IN THE LAMBDA CALCULUSBERGSTRA J; KLOP JW.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 27-38; BIBL. 3 REF.Article

THE DISCRIMINATION THEOREM HOLDS FOR COMBINATORY WEAK REDUCTIONHINDLEY R.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 3; PP. 393-394; BIBL. 2 REF.Article

A DISCRIMINATION ALGORITHM INSIDE LAMBDA -BETA -CALCULUSBOEHM C; DEZANI CIANCAGLINI M; PERETTI P et al.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 3; PP. 271-291; BIBL. 9 REF.Article

Definability of total objects in PCF and related calculiNORMANN, Dag.Lecture notes in computer science. 2001, pp 4-5, issn 0302-9743, isbn 3-540-41960-8Conference Paper

TLCA 2001 : typed lambda calculi and applications (Krakow, 2-5 May 2001)Abramsky, Samson.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-41960-8, XI, 429 p, isbn 3-540-41960-8Conference Proceedings

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

INVERTIBLE TERMS IN THE LAMBDA CALCULUSBERGSTRA J; KLOP JW.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 1; PP. 19-37; BIBL. 13 REF.Article

TYPES ET FONCTIONNALITEROBINET B.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 303-325; BIBL. 3 P.Conference Paper

A GLOBAL REPRESENTATION OF THE RECURSIVE FUNCTIONS IN THE LAMBDA -CALCULUS.BARENDREGT H.1977; THEOR. COMPUT. SCI.; NETHERL.; DA. 1977; VOL. 3; NO 2; PP. 225-242; BIBL. 16 REF.Article

  • Page / 53