Febbraio2001
Tesi di Dottorato
U. de'Liguoro, \Lambda calcolo non deterministico puro. Uno studio sul non determinismo esplicito nei calcoli funzionali d'ordine superiore", Tesi di Dottorato di Ricerca, Roma, febbraio 1992. (versione ingl. \Non-deterministic untyped -calculus. A study about explicit non-determinism in higher order functional calculi", Rapporto di Ricerca SI-91/01, 1991, Dip. di Matematica, Universita di Roma \La Sapienza").
Articoli su riviste internazionali
1. F. Cardone, M. Dezani-Ciancaglini, U. de'Liguoro, \Combining Type Dis- ciplines",Annals of Pure and Applied Logic, 66, 1994, pp. 197-230.
2. F. Barbanera, M. Dezani-Ciancaglini, U. de'Liguoro, \Intersection and Union Types: Syntax and Semantics",Information and Computation119, No. 2, 1995, pp. 202-230.
3. U. de'Liguoro, A. Piperno, \Nondeterministic Extensions of Untyped - Calculus",Information and Computation122, No. 2, 1995, pp. 149-177.
4. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \Filter Models for Conjunctive-Disjunctive-calculi",Theoretical Computer Science170, 1996, pp. 83-128.
5. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \A Filter Model for Concurrent -Calculus",SIAM Journal on Computing 27, No. 5, 1998, 1376-1419.
6. F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro, \A Convex Powerdomain over Lattices: its Logic and-calculus",Fundamenta Informaticae32, No.
3-4, 1998, pp. 193-250.
Articoli recensiti apparsi in volumi collettanei
1. M. Dezani-Ciancaglini, E. Giovannetti, U. de'Liguoro, \Intersection Types,
-models and Bohm Trees", in Theories of Types and Proofs, M. Taka- hashi, M. Okada, M. Dezani-Ciancaglini eds., Mathematical Society of Japan Memoirs, Vol. 2, 1998, pp. 45-97.
Articoli recensiti apparsi in atti di convegni internazionali
1. U. de'Liguoro, A. Piperno, \Must preorder in non-deterministic untyped lambda calculus", Proceedings of CAAP '92, Springer Lecture Notes in Computer Science581, 1992, pp. 203-220.
2. U. de'Liguoro, A. Piperno, R. Statman, \Retracts in simply typed - calculus", Proceedings of IEEE-LICS '92, 1992, pp. 461-469.
3. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \Filter Models for a Parallel and Non Deterministic -Calculus", Proceedings of MFCS '93, Springer Lecture Notes in Computer Science 711, 1993, pp. 403-412.
4. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \Fully Abstract Se- mantics for Concurrent -calculus", Proceedings of TACS '94, Springer Lecture Notes in Computer Science 789, 1994, pp. 16-35.
5. F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro, \May and Must Con- vergency in Concurrent -calculus", Proceedings of MFCS '94,Springer Lecture Notes in Computer Science 841, 1994, pp. 211-220.
6. S. Berardi, U. de' Liguoro, \Total Functionals and Well-Founded Strate- gies", Proceedings of TLCA '99,Springer Lecture Notes in Computer Sci- ence 1581, 1999, pp. 54-68.
7. U. de' Liguoro, \Characterizing convergent terms in object calculi via in- tersection types", apparira nei Proc. of TLCA'01,Springer Lecture Notes in Computer Science.
Rapporti di ricerca
1. U. de'Liguoro, \PCF Denability via Kripke Logical Relations (after O'- Hearn and Riecke)", Rapport de Recherche du LIENS, LIENS-96-7, Ecole Normale Superieure Paris, aprile 1996.
2. S. van Bakel, M. Dezani-Ciancaglini, U. de'Liguoro, Y. Motohama, \The Minimal Relevant Logic and the Call-by-value-calculus", 1999.
2
