First-order theories as many-sorted algebras. - Vincenzo Manca; Antonino Salibra (Notre Dame J. Formal Log., 1984)

On the Nature of TELLUS (a Typed Equational Logic Look over Uniform Specification). - Vincenzo Manca; Antonino Salibra; Giuseppe Scollo (MFCS, 1989)

Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets. - Vincenzo Manca; Antonino Salibra (MFCS, 1990)

Equational Type Logic. - Vincenzo Manca; Antonino Salibra; Giuseppe Scollo (Theor. Comput. Sci., 1990)

A Soft Stairway to Institutions. - Antonino Salibra; Giuseppe Scollo (COMPASS/ADT, 1991)

Soundness and Completeness of the Birkhoff Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets. - Vincenzo Manca; Antonino Salibra (Theor. Comput. Sci., 1992)

Dimension-Complemented Lambda Abstraction Algebras. - Don Pigozzi; Antonino Salibra (AMAST, 1993)

A Representation Theorem for Lambda Abstraction Algebras. - Don Pigozzi; Antonino Salibra (MFCS, 1993)

The abstract variable-binding calculus. - Don Pigozzi; Antonino Salibra (Stud Logica, 1995)

Lambda Abstraction Algebras: Representation Theorems. - Don Pigozzi; Antonino Salibra (Theor. Comput. Sci., 1995)

Interpolation and Compactness in Categories of Pre-Institutions. - Antonino Salibra; Giuseppe Scollo (Math. Struct. Comput. Sci., 1996)

The variety of lambda abstraction algebras does not admit n-permutable congruences for all n. - Antonino Salibra (RelMiCS, 1998)

Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus. - Don Pigozzi; Antonino Salibra (Fundam. Informaticae, 1998)

A Finite Equational Axiomatization of the Functional Algebras for the Lambda Calculus. - Antonino Salibra; Robert Goldblatt (Inf. Comput., 1999)

On the algebraic models of lambda calculus. - Antonino Salibra (Theor. Comput. Sci., 2000)

A Continuum of Theories of Lambda Calculus without Semantics. - Antonino Salibra (LICS, 2001)

Towards Lambda Calculus Order-Incompleteness. - Antonino Salibra (BOTH, 2001)

Nonmodularity Results for Lambda Calculus. - Antonino Salibra (Fundam. Informaticae, 2001)

The Minimal Graph Model of Lambda Calculus. - Antonio Bucciarelli; Antonino Salibra (MFCS, 2003)

A Note on Absolutely Unorderable Combinatory Algebras. - Stefania Lusin; Antonino Salibra (J. Log. Comput., 2003)

Topological incompleteness and order incompleteness of the lambda calculu. - Antonino Salibra (ACM Trans. Comput. Log., 2003)

The Sensible Graph Theories of Lambda Calculus. - Antonio Bucciarelli; Antonino Salibra (LICS, 2004)

The Lattice of Lambda Theories. - Stefania Lusin; Antonino Salibra (J. Log. Comput., 2004)

Boolean Algebras for Lambda Calculus. - Giulio Manzonetto; Antonino Salibra (LICS, 2006)

Easiness in graph models. - Chantal Berline; Antonino Salibra (Theor. Comput. Sci., 2006)

Lambda Theories of Effective Lambda Models. - Chantal Berline; Giulio Manzonetto; Antonino Salibra (CSL, 2007)

From lambda-Calculus to Universal Algebra and Back. - Giulio Manzonetto; Antonino Salibra (MFCS, 2008)

Effective lambda-models vs recursively enumerable lambda-theories - Chantal Berline; Giulio Manzonetto; Antonino Salibra (CoRR, 2008)

Graph lambda theories. - Antonio Bucciarelli; Antonino Salibra (Math. Struct. Comput. Sci., 2008)

Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. - Alberto Carraro; Antonino Salibra (LICS, 2009)

On Linear Information Systems - Antonio Bucciarelli; Alberto Carraro; Thomas Ehrhard; Antonino Salibra (LINEARITY, 2009)

Effective lambda-models versus recursively enumerable lambda-theories. - Chantal Berline; Giulio Manzonetto; Antonino Salibra (Math. Struct. Comput. Sci., 2009)

Exponentials with Infinite Multiplicities. - Alberto Carraro; Thomas Ehrhard; Antonino Salibra (CSL, 2010)

Resource Combinatory Algebras. - Alberto Carraro; Thomas Ehrhard; Antonino Salibra (MFCS, 2010)

Applying Universal Algebra to Lambda Calculus. - Giulio Manzonetto; Antonino Salibra (J. Log. Comput., 2010)

On the equational consistency of order-theoretic models of the lambda-calculus. - Alberto Carraro; Antonino Salibra (CSL, 2012)

Scott Is Always Simple. - Antonino Salibra (MFCS, 2012)

Minimal lambda-theories by ultraproducts - Antonio Bucciarelli; Alberto Carraro; Antonino Salibra (LSFA, 2012)

The stack calculus - Alberto Carraro; Thomas Ehrhard; Antonino Salibra (LSFA, 2012)

Easy lambda-terms are not always simple. - Alberto Carraro; Antonino Salibra (RAIRO Theor. Informatics Appl., 2012)

Boolean like algebras. - Antonio Ledda; Tomasz Kowalski; Francesco Paoli; Antonino Salibra (TACL, 2013)

Ordered Models of the Lambda Calculus. - Alberto Carraro; Antonino Salibra (Log. Methods Comput. Sci., 2013)

A graph-easy class of mute lambda-terms. - Antonio Bucciarelli; Alberto Carraro; Giordano Favro; Antonino Salibra (ICTCS, 2014)

Factor Varieties and Symbolic Computation. - Antonino Salibra; Giulio Manzonetto; Giordano Favro (LICS, 2016)

Graph easy sets of mute lambda terms. - Antonio Bucciarelli; Alberto Carraro; Giordano Favro; Antonino Salibra (Theor. Comput. Sci., 2016)

Factor varieties. - Antonino Salibra; Antonio Ledda; Francesco Paoli (Soft Comput., 2017)

Boolean-like algebras of finite dimension. - Antonio Bucciarelli; Antonio Ledda; Francesco Paoli; Antonino Salibra (CoRR, 2018)

On noncommutative generalisations of Boolean algebras. - Antonio Bucciarelli; Antonino Salibra (Art Discret. Appl. Math., 2019)

Sequent calculi of finite dimension. - Antonio Bucciarelli; Antonio Ledda; Francesco Paoli; Antonino Salibra (CoRR, 2022)

Clones, polymorphisms and relations of arity omega. - Antonio Bucciarelli; Antonino Salibra (CoRR, 2023)