Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("DEZANI CIANCAGLINI M")

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

Author Country

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

Results 1 to 25 of 28

  • Page / 2
Export

Selection :

  • and

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

A PARENTHESIS MACHINE FOR STRING MANIPULATION.DEZANI CIANCAGLINI M.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 3; PP. 37-46; BIBL. 8 REF.Article

DATA STRUCTURES AND THEIR TRANSFORMATIONS.BOHM C; DEZANI CIANCAGLINI M.1974; CONTROL AND CYBERN.; POLAND; DA. 1974; VOL. 3; NO 3-4; PP. 5-19; ABS. POL. RUSSE; BIBL. 9 REF.Article

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

A DATA STRUCTURE FORMALIZATION THROUGH GENERATING FUNCTIONS. = FORMALISATION DE LA STRUCTURE DES DONNEES PAR DES FONCTIONS DE GENERATIONBOHM C; DEZANI CIANCAGLINI M.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 47-66; BIBL. 12 REF.Article

INTERNATIONAL SYMPOSIUM PROGRAMMING. 5TH COLLOQUIUM, TURIN, APRIL 6-8, 1982. PROCEEDINGSDEZANI CIANCAGLINI M ED; MONTANARI U.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; 406 P.; BIBL. DISSEM.Conference Paper

REDUCTION OF STORAGE EMPLOYED TO REPRESENT FAMILIES OF INFORMATION STRUCTURES.DEZANI CIANCAGLINI M; RONCHI DELLA ROCCA S.1977; CALCOLO; ITAL.; DA. 1977; VOL. 14; NO 1; PP. 45-83; ABS. ITAL.; BIBL. 11 REF.Article

FUNCTIONAL CHARACTERIZATION OF SOME SEMANTIC EQUALITIES INSIDE LAMBDA -CALCULUSCOPPO M; DEZANI CIANCAGLINI M; SALLE P et al.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 133-146; BIBL. 17 REF.Conference Paper

Partial types and intervalsDEZANI-CIANCAGLINI, M; VENNERI, B.SIAM journal on computing (Print). 1990, Vol 19, Num 4, pp 644-658, issn 0097-5397, 15 p.Article

COMPLEXITY OF LAMBDA -TERM REDUCTIONSDEZANI CIANCAGLINI M; RONCHI DELLA ROCCA S; SAITTA L et al.1979; R.A.I.R.O.,INFORMAT.THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 257-287; ABS. FRE; BIBL. 20 REF.Article

(SEMI)-SEPARABILITY OF FINITE SETS OF TERMS IN SCOTT'S D8 MODELS OF THE LAMBDA -CALCULUS.COPPO M; DEZANI CIANCAGLINI M; RONCHI DELLA ROCCA S et al.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 142-164; BIBL. 15 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

Intersection and union types: syntax and semanticsBARBANERA, F; DEZANI-CIANCAGLINI, M.Information and computation (Print). 1995, Vol 119, Num 2, pp 202-230, issn 0890-5401Article

COMPLEXITE ELEMENTAIRE DANS LE LAMBDA -CALCULDEZANI CIANCAGLINI M; RONCHI DELLA ROCCA S; SAITTA L et al.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. 183-212; BIBL. 12 REF.Conference Paper

Intersection types for combinatory logicDEZANI-CIANCAGLINI, M; HINDLEY, J. R.Theoretical computer science. 1992, Vol 100, Num 2, pp 303-324, issn 0304-3975Article

A filter lambda model and the completeness of type assignmentBARENDREGT, H; COPPO, M; DEZANI-CIANCAGLINI, M et al.The Journal of symbolic logic. 1983, Vol 48, Num 4, pp 931-940, issn 0022-4812Article

Discrimination by parallel observers : The algorithmDEZANI-CIANCAGLINI, M; TIURYN, J; URZYCZYN, P et al.Information and computation (Print). 1999, Vol 150, Num 2, pp 153-186, issn 0890-5401Article

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

A filter model for concurrent λ-calculusDEZANI-CIANCAGLINI, M; DE'LIGUORO, U; PIPERNO, A et al.SIAM journal on computing (Print). 1998, Vol 27, Num 5, pp 1376-1419, issn 0097-5397Article

Type theories, normal forms, and D-lambda-modelsCOPPO, M; DEZANI-CIANCAGLINI, M; ZACCHI, M et al.Information and computation (Print). 1987, Vol 72, Num 2, pp 85-116, issn 0890-5401Article

A characterization of F-complete type assignmentsDEZANI-CIANCAGLINI, M; MARGARIA, I; MILNER, R et al.Theoretical computer science. 1986, Vol 45, Num 2, pp 121-157, issn 0304-3975Article

A Filter Lambda Model and the Completeness of type AssignmentBARENDREGT, H; COPPO, M; DEZANI-CIANCAGLINI, M et al.Journal of Symbolic Logic Providence, R.I. 1983, Vol 48, Num 4, pp 931-940Article

Security types for mobile Safe ambientsDEZANI-CIANCAGLINI, M; SALVO, I.Lecture notes in computer science. 2000, pp 215-236, issn 0302-9743, isbn 3-540-41428-2Conference Paper

Infinite λ-calculus and typesBERARDUCCI, A; DEZANI-CIANCAGLINI, M.Theoretical computer science. 1999, Vol 212, Num 1-2, pp 29-75, issn 0304-3975Article

16th International colloquium on automata, languages and programming, selected papers, Stresa, July 11-15, 1989AUSIELLO, G; RONCHI DELLA ROCCA, S; DEZANI-CIANCAGLINI, M et al.Theoretical computer science. 1991, Vol 83, Num 1, issn 0304-3975, 167 p.Conference Proceedings

Principal typing for parallel and non-deterministic λ-calculusAOUN, A. S; BARBANERA, F; DEZANI-CIANCAGLINI, M et al.CIT. Journal of computing and information technology. 1997, Vol 5, Num 2, pp 129-138, issn 1330-1136Article

  • Page / 2