Antonino Salibra Papers


  • Boolean product representations of algebras via binary polynomials. A. Salibra, A. Ledda and F. Paoli. In J. Czelakowski (Ed.),''Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science'', Outstanding Contributions to Logic Vol. 16, Springer-Verlag, 2018.
  • Factor Varieties. A. Salibra, A. Ledda and F. Paoli. Soft Computing, Volume 21, Issue 6, pp 1443-1454, 2017
  • Factor Varieties and Symbolic Computation. A. Salibra, G. Manzonetto, G. Favro. LICS 2016, New York, USA
  • Graph easy sets of mute lambda terms. A. Bucciarelli, A. Carraro, G. Favro, A. Salibra. Theoretical Computer Science, vol. 629, pp. 51-63, 2016
  • The connection of skew Boolean algebras and discriminator varieties to Church algebras. K. Cvetko-Vah and A. Salibra. Algebra Universalis, vol. 73, pp. 369-390, 2015, pdf.
  • The stack calculus: equalities induced by the decomposition of Classical Logic into Linear Logic. A. Carraro, T. Ehrhard and A. Salibra. Preprint 2014
  • A grah easy set of mute lambda terms. A. Bucciarelli, A. Carraro, G. Favro and A. Salibra. ICTCS 2014, CEUR Workshop Proc. vol. 1231, pp. 59-71 (2014)
  • Lambda calculus between Algebra and Topology. A scientific meeting in honor of Antonino Salibra, Paris, July 1-2, 2013 pdf
  • Ordered models of the lambda calculus. A. Carraro, A. Salibra. Logical Methods in Computer Science, Vol. 9, pp. 1-29, 2013 pdf
  • Boolean-like algebras. A. Salibra, A. Ledda, F. Paoli and T. Kowalski. Algebra Universalis, Vol. 69, pp. 113-138, 2013.
  • On Semi-Boolean-like algebras. A. Ledda, F. Paoli and A. Salibra. Acta Univ. Palacki. Olomuc., Fac. rer. nat, Mathematica Vol. 52, pp. 101-120, 2013.
  • Minimal lambda theories by ultraproducts. A. Bucciarelli, A. Carraro and A. Salibra. Proc. 7th Workshop on Logical and Semantic Frameworks, 2012, EPTCS vol. 113, pp. 61-76, 2013. pdf
  • The stack calculus. A. Carraro, T. Ehrhard and A. Salibra. Proc. 7th Workshop on Logical and Semantic Frameworks, 2012, EPTCS vol. 113, pp. 93-108, 2013. pdf
  • Scott is always simple (Invited Lecture). A. Salibra. MFCS 2012, LNCS 7464, pp. 31-45, 2012 pdf
  • On the equational consistency of order-theoretic models of the lambda calculus. A. Carraro, A. Salibra. CSL'12, 21st EACSL Annual Conferences on Computer Science Logic. pdf
  • Easy lambda-terms are not always simple. A. Carraro, A. Salibra. RAIRO - Theor. Inform. and Applic. vol.46, 291-314, 2012. pdf
  • Exponentials with infinite multiplicities. A. Carraro, T. Ehrhard and A. Salibra. CSL'10: 19th EACSL Annual Conference on Computer Science Logic, LNCS 6247, pp. 170-184, 2010. pdf
  • Resource combinatory algebras. A. Carraro, T. Ehrhard, A. Salibra. MFCS'10: 35th Inter. Symp. on Mathem. Found. of Computer Science, LNCS 6281, pp. 233-245, 2010. pdf
  • Applying universal algebra to lambda calculus. G. Manzonetto, A. Salibra. Journal of Logic and Computation 2010 Vol. 20: 877-915. pdf
  • On Linear Information Systems. A. Bucciarelli, A. Carraro, T. Ehrhard, A. Salibra. Linearity'09, Electronic Proceedings TCS vol.22, 2010, pp. 38-48. pdf
  • Lattices of equational theories as Church algebras. G. Manzonetto, A. Salibra. Proceedings of Seventh Panhellenic Logic Symposium, July 15-19, 2009, Patras, Greece. pdf
  • Reflexive domains are not complete for the extensional lambda calculus. A. Carraro, A. Salibra. LICS'09: Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science, pp. 91-100, 2009. pdf
  • Effective lambda models versus recursively enumerable lambda theories. C. Berline, G. Manzonetto, A. Salibra. Mathematical Structures in Computer Science vol.19 (2009) pp. 897-942. pdf
  • From lambda calculus to universal algebra and back. G. Manzonetto, A. Salibra. MFCS'08: 33th Int. Symp. on Math. Found. of Computer Science, LNCS 5162, pp. 479-490, 2008. pdf
  • Graph lambda theories. A. Bucciarelli, A. Salibra. Mathematical Structures in Computer Science vol.18(5), 975-1004, 2008. pdf
  • Lambda theories of effective lambda models. C. Berline, G. Manzonetto, A. Salibra. CSL'07, Proc. of 16th EACSL Annual Conf. on Computer Science and Logic, LNCS 4646, pp. 268-282, 2007.
  • Boolean algebras for lambda calculus. G. Manzonetto, A. Salibra. LICS 2006.
  • Easiness in graph models. C. Berline , A. Salibra. Theoretical Computer Science 2006.
  • The sensible graph theories of lambda calculus. A. Bucciarelli, A. Salibra. LICS 2004.
  • The lattice of lambda theories. S. Lusin, A. Salibra. Journal of Logic and Computation, 2004.
  • A note on absolutely unorderable combinatory algebras. S. Lusin, A. Salibra. Journal of Logic and Computation, 2003.
  • Topological incompleteness and order incompleteness of the lambda calculus. A. Salibra. ACM TOCL, 2003.
  • The minimal graph model of lambda calculus A. Bucciarelli, A. Salibra. MFCS, 2003.
  • Lambda calculus: models and theories. (Invited Lecture). A. Salibra. Proceedings AMiLP-2003, F. Spoto, TWLT Proceedings Series n.21, University of Twente (2003), pp. 39-54.
  • A continuum of theories of lambda calculus without semantics. A. Salibra. LICS'01.
  • Nonmodularity results for lambda calculus. A. Salibra, Fundamenta Informaticae, vol. 45, pp. 379-392, 2001.
  • Towards lambda calculus order-incompleteness. A. Salibra, Workshop on Bohm theorem (BOTH 2001), ENTCS Vol. 50 No. 2, pp. 147-160, 2001.
  • On the algebraic models of lambda calculus. A. Salibra, Theoretical Computer Science 249(1), 2000.
  • A finite equational axiomatization of the functional algebras for the lambda calculus. A. Salibra, R. Goldblatt, Information and Computation 148(1), 1999.
  • Lambda abstraction algebras: coordinatizing models of lambda calculus. D. Pigozzi, A. Salibra, Fundamanta Informaticae 33, 1998.
  • On categorical frames, universal algebra and Boolean algebras with operators in a category (Invited Lecture). A. Salibra, Proc. Workshop on Abstract Algebraic Logic, CRM Quaderns num. 10, pp. 176-185, 1998
  • The variety of lambda abstraction algebras does not admit n-permutable congruences for all n. A. Salibra, 4th International Seminar RelMiCS, Warsaw, Poland, September 14-20, 1998.
  • Interpolation and Compactness in categories of pre-institutions. A. Salibra, G. Scollo, Mathematical Structures in Computer Science vol. 6, 261-286, 1996.
  • Lambda abstraction algebras: representation theorems. D. Pigozzi, A. Salibra, Theoretical Computer Science, vol. 140, 1995.
  • The abstract variable binding calculus. D. Pigozzi, A. Salibra, Studia Logica 55(1), 1995.
  • Dimension-complemented lambda abstraction algebras D. Pigozzi, A. Salibra, Proc. AMAST'93, Enschede, Olanda, 21-25 June 1993, Workshops in Computing, Springer, London (1994), pp. 131-138, 1994.
  • Compactness and Lowenheim-Skolem properties in pre-institution categories A. Salibra, G. Scollo, Banach Center Publications vol. 28, Inst. Math. Polish Acad. Sci., Warszawa (1993), 67-94, 1993.
  • Polyadic algebras over non-classical logics. D. Pigozzi, A. Salibra, Banach Center Publ. 28, 1993.
  • A reduction scheme by pre-institution transformations (abstract). A. Salibra, G. Scollo, Journal of Symbolic Logic vol. 58, 1130-1131, 1993.
  • A soft stairway to institutions. A. Salibra, G. Scollo, Recent Trends in Data Type Specification, LNCS vol. 655, 310-329, 1993.
  • A representation theorem for lambda abstraction algebras. D. Pigozzi, A. Salibra, 18th International Symposium on Mathematical Foundations of Computer Science, LNCS vol. 711, pp. 629-639, 1993.
  • Introduction to lambda abstraction algebras. D. Pigozzi, A. Salibra, Proceedings of the IX Latin American Symposium on Mathematical Logic, Notas de Logica Matematica vol. 38, 93-112, 1993.
  • Soundness and Completeness of the Birkhoff Equational Calculus for Many-sorted Algebras with Possibly Empty Carrier Sets. V. Manca, A. Salibra, Theoretical Computer Science vol. 94, pp. 101-124, 1992.
  • On the Expressiveness of Equational Type Logic. Proc. Conference on The Unified Computation Laboratory: Modelling, Specifications and Tools, Oxford University Press, pp. 85-100, 1992.
  • A general theory of algebras with quantifiers A. Salibra. Colloquia Mathematica Societastis Janos Bolyai vol. 54 Algebraic Logic, 1991 pdf.
  • Introducing equational type logic (abstract). V. Manca, A. Salibra, G. Scollo, Journal of Symbolic Logic vol. 56, p.1132, 1991.
  • On the Power of Equational Logic: Applications and Extensions. V. Manca, A. Salibra, Algebraic Logic, (H. Andreka, I. Nemeti eds.), North-Holland Publishing, 1991.
  • Equational Type Logic. V. Manca, A. Salibra, G. Scollo, Theoretical Computer Science vol. 77, pp. 131-159, 1990.
  • Equational Calculi for Many-sorted Algebras with Empty Carrier Sets V. Manca, A. Salibra, Proc. MFCS'90, LNCS vol. 452, pp. 423-429, 1990.
  • On the nature of TELLUS (a Typed Equational Logic Look over Uniform Specication). V. Manca, A. Salibra, G. Scollo, Proc. MFCS'89, LNCS 379, pp. 338-349, 1989.
  • DELTA: a Deduction system integrating Equational Logic and Type Assignment V. Manca, A. Salibra, G. Scollo, Proc. of the first Inter. Conf. on Algebraic Methodology and Software Technology, Iowa City, pp. 137-140, 1989.
  • First-order Theories as Many-sorted Algebras. V. Manca, A. Salibra, Notre Dame Journal of Formal Logic vol. 25, 86-94, 1984.