default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonino Salibra
Person information
- affiliation: Ca' Foscari University of Venice, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Antonio Bucciarelli, Antonino Salibra:
Clones, polymorphisms and relations of arity omega. CoRR abs/2303.05471 (2023)- 2022
- [i3]Antonio Bucciarelli, Antonio Ledda, Francesco Paoli, Antonino Salibra:
Sequent calculi of finite dimension. CoRR abs/2204.00435 (2022)
2010 – 2019
- 2019
- [j23]Antonio Bucciarelli, Antonino Salibra:
On noncommutative generalisations of Boolean algebras. Art Discret. Appl. Math. 2(2) (2019) - 2018
- [i2]Antonio Bucciarelli, Antonio Ledda, Francesco Paoli, Antonino Salibra:
Boolean-like algebras of finite dimension. CoRR abs/1806.06537 (2018) - 2017
- [j22]Antonino Salibra
, Antonio Ledda, Francesco Paoli:
Factor varieties. Soft Comput. 21(6): 1443-1454 (2017) - 2016
- [j21]Antonio Bucciarelli, Alberto Carraro, Giordano Favro, Antonino Salibra:
Graph easy sets of mute lambda terms. Theor. Comput. Sci. 629: 51-63 (2016) - [c24]Antonino Salibra, Giulio Manzonetto, Giordano Favro:
Factor Varieties and Symbolic Computation. LICS 2016: 739-748 - 2014
- [c23]Antonio Bucciarelli, Alberto Carraro, Giordano Favro, Antonino Salibra:
A graph-easy class of mute lambda-terms. ICTCS 2014: 59-71 - 2013
- [j20]Alberto Carraro, Antonino Salibra:
Ordered Models of the Lambda Calculus. Log. Methods Comput. Sci. 9(4) (2013) - [c22]Antonio Ledda, Tomasz Kowalski, Francesco Paoli, Antonino Salibra:
Boolean like algebras. TACL 2013: 141-144 - 2012
- [j19]Alberto Carraro, Antonino Salibra:
Easy lambda-terms are not always simple. RAIRO Theor. Informatics Appl. 46(2): 291-314 (2012) - [c21]Alberto Carraro, Antonino Salibra:
On the equational consistency of order-theoretic models of the lambda-calculus. CSL 2012: 152-166 - [c20]Antonino Salibra:
Scott Is Always Simple. MFCS 2012: 31-45 - [c19]Antonio Bucciarelli, Alberto Carraro, Antonino Salibra:
Minimal lambda-theories by ultraproducts. LSFA 2012: 61-76 - [c18]Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
The stack calculus. LSFA 2012: 93-108 - 2010
- [j18]Giulio Manzonetto, Antonino Salibra:
Applying Universal Algebra to Lambda Calculus. J. Log. Comput. 20(4): 877-915 (2010) - [c17]Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
Exponentials with Infinite Multiplicities. CSL 2010: 170-184 - [c16]Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
Resource Combinatory Algebras. MFCS 2010: 233-245
2000 – 2009
- 2009
- [j17]Chantal Berline, Giulio Manzonetto, Antonino Salibra:
Effective lambda-models versus recursively enumerable lambda-theories. Math. Struct. Comput. Sci. 19(5): 897-942 (2009) - [c15]Alberto Carraro, Antonino Salibra:
Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. LICS 2009: 91-100 - [c14]Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
On Linear Information Systems. LINEARITY 2009: 38-48 - 2008
- [j16]Antonio Bucciarelli, Antonino Salibra:
Graph lambda theories. Math. Struct. Comput. Sci. 18(5): 975-1004 (2008) - [c13]Giulio Manzonetto, Antonino Salibra:
From lambda-Calculus to Universal Algebra and Back. MFCS 2008: 479-490 - [i1]Chantal Berline, Giulio Manzonetto, Antonino Salibra:
Effective lambda-models vs recursively enumerable lambda-theories. CoRR abs/0806.2264 (2008) - 2007
- [c12]Chantal Berline, Giulio Manzonetto, Antonino Salibra:
Lambda Theories of Effective Lambda Models. CSL 2007: 268-282 - 2006
- [j15]Chantal Berline, Antonino Salibra:
Easiness in graph models. Theor. Comput. Sci. 354(1): 4-23 (2006) - [c11]Giulio Manzonetto, Antonino Salibra:
Boolean Algebras for Lambda Calculus. LICS 2006: 317-326 - 2004
- [j14]Stefania Lusin, Antonino Salibra:
The Lattice of Lambda Theories. J. Log. Comput. 14(3): 373-394 (2004) - [c10]Antonio Bucciarelli, Antonino Salibra:
The Sensible Graph Theories of Lambda Calculus. LICS 2004: 276-285 - 2003
- [j13]Stefania Lusin, Antonino Salibra:
A Note on Absolutely Unorderable Combinatory Algebras. J. Log. Comput. 13(4): 481-502 (2003) - [j12]Antonino Salibra:
Topological incompleteness and order incompleteness of the lambda calculu. ACM Trans. Comput. Log. 4(3): 379-401 (2003) - [c9]Antonio Bucciarelli, Antonino Salibra:
The Minimal Graph Model of Lambda Calculus. MFCS 2003: 300-307 - 2001
- [j11]Antonino Salibra:
Nonmodularity Results for Lambda Calculus. Fundam. Informaticae 45(4): 379-392 (2001) - [c8]Antonino Salibra:
A Continuum of Theories of Lambda Calculus without Semantics. LICS 2001: 334-343 - [c7]Antonino Salibra:
Towards Lambda Calculus Order-Incompleteness. BOTH 2001: 145-158 - 2000
- [j10]Antonino Salibra:
On the algebraic models of lambda calculus. Theor. Comput. Sci. 249(1): 197-240 (2000)
1990 – 1999
- 1999
- [j9]Antonino Salibra, Robert Goldblatt:
A Finite Equational Axiomatization of the Functional Algebras for the Lambda Calculus. Inf. Comput. 148(1): 71-130 (1999) - 1998
- [j8]Don Pigozzi, Antonino Salibra:
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus. Fundam. Informaticae 33(2): 149-200 (1998) - [c6]Antonino Salibra:
The variety of lambda abstraction algebras does not admit n-permutable congruences for all n. RelMiCS 1998: 182-187 - 1997
- [j7]Don Pigozzi, Antonino Salibra:
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus. Fundam. Informaticae 32(1): 47-90 (1997) - 1996
- [j6]Antonino Salibra, Giuseppe Scollo:
Interpolation and Compactness in Categories of Pre-Institutions. Math. Struct. Comput. Sci. 6(3): 261-286 (1996) - 1995
- [j5]Don Pigozzi, Antonino Salibra:
The abstract variable-binding calculus. Stud Logica 55(1): 129-179 (1995) - [j4]Don Pigozzi, Antonino Salibra:
Lambda Abstraction Algebras: Representation Theorems. Theor. Comput. Sci. 140(1): 5-52 (1995) - 1993
- [c5]Don Pigozzi, Antonino Salibra:
Dimension-Complemented Lambda Abstraction Algebras. AMAST 1993: 129-136 - [c4]Don Pigozzi, Antonino Salibra:
A Representation Theorem for Lambda Abstraction Algebras. MFCS 1993: 629-639 - 1992
- [j3]Vincenzo Manca, Antonino Salibra:
Soundness and Completeness of the Birkhoff Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets. Theor. Comput. Sci. 94(1): 101-124 (1992) - 1991
- [c3]Antonino Salibra, Giuseppe Scollo:
A Soft Stairway to Institutions. COMPASS/ADT 1991: 310-329 - 1990
- [j2]Vincenzo Manca, Antonino Salibra, Giuseppe Scollo:
Equational Type Logic. Theor. Comput. Sci. 77(1&2): 131-159 (1990) - [c2]Vincenzo Manca, Antonino Salibra:
Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets. MFCS 1990: 423-429
1980 – 1989
- 1989
- [c1]Vincenzo Manca, Antonino Salibra, Giuseppe Scollo:
On the Nature of TELLUS (a Typed Equational Logic Look over Uniform Specification). MFCS 1989: 338-349 - 1984
- [j1]Vincenzo Manca, Antonino Salibra:
First-order theories as many-sorted algebras. Notre Dame J. Formal Log. 25(1): 86-94 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
