Publications
Degrees of definability
A.B., Benjamin Leperchey :
Hypergraphs and Degrees of Parallelism: A Completeness Result. FoSSaCS 2004: 58-71
A.B., Benjamin Leperchey , Vincent Padovani :Relative Definability and Models of Unary PCF. TLCA 2003: 75-89
A.B., Pasquale Malacaria:
Relative definability of boolean functions via hypergraphs. Theor. Comput. Sci. 278(1-2): 91-110 (2002)
A.B.: Degrees of Parallelism in the Continuous Type Hierarchy. Theor. Comput. Sci. 177(1): 59-71 (1997)
Linear Logic
A.B., Thomas Ehrhard:
On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Logic 109(3): 205-241 (2001)
A.B., Thomas Ehrhard:
On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic. Ann. Pure Appl. Logic
102(3): 247-282 (2000)
A.B.,
Alberto Carraro
Thomas Ehrhard
Antonino Salibra:
On linear information systems. First Int. Workshop on linearity, Coimbra, 2009, pages 12-19.
Logical relations: the Extensional Collapse
Extensional collapse situations I: non-termination
and unrecoverable errors .
CoRR abs/1101.4465: (2011)
A.B.,
Ivano Salvo:
Totality, Definability and Boolean Ciruits. ICALP 1998: 808-819
A.B.: Bi-Models: Relational Versus Domain-Theoretic Approaches. Fundam. Inform. 32(3-4): 251-266 (1997)
A.B.: Logical reconstruction of bi-domains.
TLCA 97, LNCS 1012.
A.B.: Logical relations and lambda-theories.
3rd Theory and Formal Methods Workshop, Imperial
College of Science, Medicine and Technology, 37-48,
Imperial College Press, 1997.
Sequentiality
A.B.: Event structures representing domains with coherence. Rapport technique LIENS 95-16, 1995.
A.B., Thomas Ehrhard:
Sequentiality in an Extensional Framework. Information and Computation 110(2): 265-296 (1994)
A.B.: Another Approach to Sequentiality: Kleene's Unimonotone Functions. MFPS 1993: 333-358
A.B., Thomas Ehrhard:
A Theory of Sequentiality. Theor. Comput. Sci. 113(2): 273-291 (1993)
A.B., Thomas Ehrhard:
Extensional Embedding of a Strongly Stable Model of PCF. ICALP 1991: 35-46
A.B., Thomas Ehrhard:
Sequentiality and Strong Stability. LICS 1991: 138-145
Pure lambda calculus and intersection types
A.B.,
Thomas Ehrhard
Giulio Manzonetto:
Not enough points is enough . CSL 07, LNCS 4646, 298-312.
A.B., Antonino Salibra:
Graph Lambda Theories. Mathematical Struct. in Comp. Scie., 18(5):975-1004
A.B., Antonino Salibra:
The Sensible Graph Theories of Lambda Calculus. LICS 2004
A.B., Antonino Salibra:
The Minimal Graph Model of Lambda Calculus. MFCS 2003: 300-307
A.B.,
Adolfo Piperno,
Ivano Salvo:
Intersection Types and lambda-Definability. Mathematical Structures in Computer Science 13(1):15-53 (2003)
A.B., Silvia De Lorenzis,
Adolfo Piperno,
Ivano Salvo:
Some Computational Properties of Intersection Types. LICS 1999: 109-118.
Non-deterministic and Resource calculi
A.B.,
Thomas Ehrhard
Giulio Manzonetto:
A relational model of parallel and non deterministic lambda-calculus. LFCS 09, LNCS 5407, 107-121,
2009.
Categorical models for simply typed resource calculi .
Actes de
26th Int. Conf. on Mathematical Foundations of Progr. Semantics, Ottawa, 2010, Electr. Notes Theor. Comput. Sci. 265: 213-230 (avec T. Ehrhard, G. Manzonetto).
Full abstraction for resource calculus with tests
Actes de 20th Conference on Computer Science Logic, Bergen, 2011
(avec A. Carraro, T. Ehrhard, G. Manzonetto).
A relational semantics for parallelism and non-determinism in a functional setting .
Ann. Pure Appl. Logic, vol. 163, n 7: 918-934, 2012 (avec T. Ehrhard, G. Manzonetto).
Dissertations
Sequential models of PCF: some contributions to the
domain theoretic approach to full abstraction.
PhD, Università di Pisa, 1993.
Sur la lambda-définissabilité.
Habilitation à diriger des recherches, Université Paris Diderot,
2009.