Ugo de'Liguoro

Stefano Berardi, Ugo de'Liguoro: Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs. ACM Trans. Comput. Log. 13(2): 11 (2012)

Stefano Berardi, Ugo de'Liguoro: Knowledge Spaces and the Completeness of Learning Strategies. CSL 2012: 77-91

Herman Geuvers, Ugo de'Liguoro (Eds.): Proceedings Fourth Workshop on Classical Logic and Computation. EPTCS 97, 2012

Steffen van Bakel, Franco Barbanera, Ugo de'Liguoro: A Filter Model for the λμ-Calculus - (Extended Abstract). TLCA 2011: 213-228

Franco Barbanera, Ugo de'Liguoro: Two notions of sub-behaviour for session-based client/server systems. PPDP 2010: 155-164

Stefano Berardi, Ugo de'Liguoro: Interactive Realizers and Monads. CoRR abs/1005.2907 (2010)

Stefano Berardi, Ugo de'Liguoro: Toward the interpretation of non-constructive reasoning as non-monotonic learning. Inf. Comput. 207(1): 63-81 (2009)

Franco Barbanera, Sara Capecchi, Ugo de'Liguoro: Typing Asymmetric Client-Server Interaction. FSEN 2009: 97-112

Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro: Sessions and Session Types: An Overview. WS-FM 2009: 1-28

Stefano Berardi, Ferruccio Damiani, Ugo de'Liguoro (Eds.): Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers. Lecture Notes in Computer Science 5497, Springer 2009, isbn 978-3-642-02443-6

Steffen van Bakel, Ugo de'Liguoro: Logical Equivalence for Subtyping Object and Recursive Types. Theory Comput. Syst. 42(3): 306-348 (2008)

Stefano Berardi, Ugo de'Liguoro: Calculi, types and applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi Della Rocca. Theor. Comput. Sci. 398(1-3): 1-11 (2008)

Stefano Berardi, Ugo de'Liguoro: A Calculus of Realizers for EM1 Arithmetic (Extended Abstract). CSL 2008: 215-229

Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Nobuko Yoshida: On Progress for Structured Communications. TGC 2007: 257-275

Steffen van Bakel, Ugo de'Liguoro: Subtyping Object and Recursive Types Logically. ICTCS 2005: 66-80

Franco Barbanera, Ugo de'Liguoro: Type Assignement for Mobile Objects. Electr. Notes Theor. Comput. Sci. 104: 25-38 (2004)

Steffen van Bakel, Ugo de'Liguoro: Logical Semantics for the First Order varsigma-Calculus. ICTCS 2003: 202-215

Ugo de'Liguoro: Subtyping in Logical Form. Electr. Notes Theor. Comput. Sci. 70(1): 72-87 (2002)

Ugo de'Liguoro: Characterizing Convergent Terms in Object Calculi via Intersection Types. TLCA 2001: 315-328

Stefano Berardi, Ugo de'Liguoro: Total Functionals and Well-Founded Strategies. TLCA 1999: 54-68

Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: A Filter Model for Concurrent lambda-Calculus. SIAM J. Comput. 27(5): 1376-1419 (1998)

Fabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro: A Convex Powerdomain over Lattices: Its Logic and lambda-Calculus. Fundam. Inform. 32(3-4): 193-250 (1997)

Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Filter Models for Conjunctive-Disjunctive lambda-Calculi. Theor. Comput. Sci. 170(1-2): 83-128 (1996)

Franco Barbanera, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro: Intersection and Union Types: Syntax and Semantics. Inf. Comput. 119(2): 202-230 (1995)

Ugo de'Liguoro, Adolfo Piperno: Non Deterministic Extensions of Untyped Lambda-Calculus. Inf. Comput. 122(2): 149-177 (1995)

Felice Cardone, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro: Combining Type Disciplines. Ann. Pure Appl. Logic 66(3): 197-230 (1994)

Fabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro: May and Must Convergencey in Concurrent Lambda-Calculus. MFCS 1994: 211-220

Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Fully Abstract Semantics for Concurrent Lambda-calculus. TACS 1994: 16-35

Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Filter Models for a Parallel and Non Deterministic Lambda-Calculus. MFCS 1993: 403-412

Ugo de'Liguoro, Adolfo Piperno: Must Preorder in Non-Deterministic Untyped Lambda-Calculus. CAAP 1992: 203-220

Ugo de'Liguoro, Adolfo Piperno, Richard Statman: Retracts in simply typed lambda-beta-eta-calculus. LICS 1992: 461-469