Boolean like algebras
(with A. Ledda, F. Paoli, T. Kowalski). 2012
The stack calculus
(with A. Carraro, T. Ehrhard). 2012
Easy lambda-terms are not always simple
(with A. Carraro).
In
RAIRO - Theoretical Informatics and Applications (to appear 2011). Special Issue 12th Italian Conference on Theoretical Computer Science 2010.
Boolean algebras of arbitrary similarity type.
(with A. Ledda, F. Paoli, T. Kowalski) Second International Conference on Order, Algebra, and Logics, Krakow, Poland, 2011
Exponentials with infinite multiplicities.
(with A. Carraro, T. Ehrhard), CSL'10: 19th EACSL Annual Conference on Computer Science Logic 2010.
Resource combinatory algebras
(with A. Carraro, T. Ehrhard), MFCS'10: 35th International Symposium on Mathematical Foundations of Computer Science 2010.
Applying universal algebra to lambda calculus.
(with G. Manzonetto) - Journal of Logic and Computation 2010 Vol. 20: 877-915
On Linear Information Systems
(with A. Bucciarelli, A. Carraro, T. Ehrhard)
- Linearity09, Electronic Proceedings TCS vol.22, 2010, pp. 38-48.
Lattices of equational theories as Church algebras.
(with G. Manzonetto) - Proceedings of Seventh Panhellenic Logic Symposium, July 15-19, 2009, Patras, Greece
Reflexive domains are not complete for the extensional lambda calculus.
(with A. Carraro) - LICS'09: Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science.
Effective lambda models versus recursively enumerable lambda theories.
(with C. Berline, G. Manzonetto) -
Mathematical Structures in Computer Science vol.19 (2009) pp.897--942
From lambda calculus to universal algebra and back.
(with G. Manzonetto) - MFCS'08: 33th International Symposium on Mathematical Foundations of Computer Science 2008
Graph lambda theories.
(with A. Bucciarelli) - Mathematical Structures in Computer Science vol.18(5), 2008
Lambda theories of effective lambda models.
(with C. Berline, G. Manzonetto) - CSL 07 
Boolean algebras for lambda calculus.
(with G. Manzonetto) - LICS 06 
Easiness in graph models.
(with C. Berline) - TCS 354(1), 2006 
The sensible graph theories of lambda calculus.
(with A. Bucciarelli) - LICS 04 
The lattice of lambda theories.
(with S. Lusin) - JLC 14(3), 2004 
Topological incompleteness
and order incompleteness of the lambda calculus.
- ACM TOCL 4(3),  2003
A continuum of theories of lambda calculus without semantics.
- LICS 01 
Nonmodularity results for lambda calculus. - Fundamenta Informaticae, vol. 45, pp. 379-392, 2001.
On the algebraic models of lambda calculus.
- TCS 249(1), 2000 
A finite equational axiomatization of the functional algebras for
the lambda calculus.
(with R. Goldblatt) - IC 148(1), 1999 
Lambda abstraction algebras: coordinatizing models of lambda calculus.
(with D. Pigozzi) - FI 33, 1998 
Lambda abstraction algebras: representation theorems.
(with D. Pigozzi) - TCS 140, 1995 
The abstract variable binding calculus.
(with D. Pigozzi) - SL 55(1), 1995 
Polyadic algebras over non-classical logics.
(with D. Pigozzi) - Algebraic Methods in Logic and in Comput. Sci.,
Banach Center Publ. 28, 1993 
OTHER PAPERS and ABSTRACTS
S. Lusin, A. Salibra, A note on absolutely unorderable combinatory algebras.
Journal of Logic and Computation, Vol. 13, 2003.
A. Salibra,
Nonmodularity results for lambda calculus. Fundamenta Informaticae, vol. 45 (2001), 379-392.
A. Salibra, G. Scollo, Interpolation and Compactness in categories of pre-institutions. Mathematical Structures in Computer Science vol. 6 (1996), 261-286.
V. Manca, A. Salibra, Soundness and Completeness of the Birkho Equational Calculus for Many-sorted Algebras with Possibly Empty Carrier Sets. Theoretical Computer Science vol. 94 (1992), 101-124.
V. Manca, A. Salibra, G. Scollo,
Equational Type Logic. Theoretical Computer Science vol. 77 (1990), 131-159.
V. Manca, A. Salibra, First-order Theories as Many-sorted Algebras.
Notre Dame Journal of Formal Logic vol. 25 (1984), 86-94.
A. Bucciarelli, A. Salibra,
The minimal graph model of lambda calculus.
Proc. 27th International Symposium on Mathematical Foundations of Computer Science, LNCS 2747, Springer-
Verlag, pp. 300-307, 2003.
A. Salibra, Lambda calculus: models and theories. (Invited Lecture), Proceedings of the
Third AMAST Workshop on Algebraic Methods in Language Processing (AMiLP-2003), F.
Spoto, G. Scollo and A. Nijhol eds., TWLT Proceedings Series n.21, University of Twente
(2003), 39-54.
A. Salibra, Towards lambda calculus order-incompleteness, Workshop on ohm theorem:
applications to Computer Science Theory (BOTH 2001), Electronics Notes in Theoretical
Computer Science Vol. 50 No. 2, Elsevier Science B, V. (2001), 147-160.
A. Salibra, On categorical frames, universal algebra and Boolean algebras with operators in
a category (Invited Lecture), Proc. Workshop on Abstract Algebraic Logic Bellaterra, Spain,
July 1-5, 1997. (J. Font, R. Jansana, D. Pigozzi eds.), CRM Quaderns num. 10/ gener (1998),
176-185.
A. Salibra, The variety of lambda abstraction algebras does not admit n-permutable congruences
for all n, 4th International Seminar RelMiCS, (Ewa Orlowska and Andrzej Szalas
eds.), Warsaw, Poland, Septermber 14-20, 1998.
D. Pigozzi, A. Salibra, Dimension-complemented lambda abstraction algebras, Proc. 3rd
International Conference on Algebraic Methodology and Software Technology (AMAST'93),
Enschede, Olanda, 21{25 June 1993, (M. Nivat, C. Rattray, T. Rus, G. Scollo eds.), Workshops
in Computing, Springer, London (1994), 131-138.
D. Pigozzi, A. Salibra, A representation theorem for lambda abstraction algebras, Proc.
18th International Symposium on Mathematical Foundations of Computer Science, (A.M.
Borzyszkowski, S. Sokolowski eds.) Lecture Notes in Computer Science vol. 711, Springer
(1993), 629-639.
A. Salibra, G. Scollo, A soft stairway to institutions, Recent Trends in Data Type Speci-
cation, (M. Bidoit, C. Choppy eds.), Lecture Notes in Computer Science vol. 655, Springer
(1993), 310-329.
D. Pigozzi, A. Salibra, Introduction to lambda abstraction algebras, Proceedings of the IX
Latin American Symposium on Mathematical Logic, (Baha Blanca, 1992) Notas de Logica
Matematica vol. 38 (1993), 93-112.
V. Manca, A. Salibra, G. Scollo, On the Expressiveness of Equational Type Logic, Proc.
Conference on The Unied Computation Laboratory: Modelling, Specications and Tools,
(C.M.I. Rattray, R.G. Clarke eds.), Oxford University Press (1992), 85-100.
V. Manca, A. Salibra, Equational Calculi for Many-sorted Algebras with Empty Carrier
Sets, Proc. 15th International Symposium on Mathematical Foundation of Computer Science
(MFCS'90), (B. Rovan ed.), Lecture Notes in Computer Science vol. 452, Springer (1990),
423-429.
V. Manca, A. Salibra, G. Scollo, On the nature of TELLUS (a Typed Equational Logic
Look over Uniform Specication), Proc. 14th International Symposium on Mathematical
Foundation of Computer Science (MFCS'89), (A. Kreczmar, G. Mirkowska eds.), Lecture
Notes in Computer Science vol. 379, Springer (1989), 338-349.
V. Manca, A. Salibra, G. Scollo, DELTA: a Deduction system integrating Equational Logic
and Type Assignment, Proc. of the rst International Conference on Algebraic Methodology
and Software Technology, Iowa City, Iowa, May 23{25 (1989), 137-140.
A. Salibra, G. Scollo, Compactness and owenheim-Skolem properties in pre-institution
categories, Algebraic Methods in Logic and in Computer Science, (C. Rauszer ed.), Banach
Center Publications vol. 28, Inst. Math. Polish Acad. Sci., Warszawa (1993), 67{94.
D. Pigozzi, A. Salibra, Polyadic algebras over non-classical logics, Algebraic Methods in
Logic and in Computer Science, (C. Rauszer ed.), Banach Center Publications vol. 28, Polish
Academy of Sciences, Warszawa (1993), 51-66.
A. Salibra, A General Theory of Algebras with Quantiers, Algebraic Logic, (H. Andreka, I. Nemeti eds.), North-Holland Publishing Co., Amsterdam (1991).
V. Manca, A. Salibra, On the Power of Equational Logic: Applications and Extensions,
Algebraic Logic, (H. Andreka, I. Nemeti eds.), North-Holland Publishing Co., Amsterdam (1991).