Salibra, A.
90  results:
Search for persons X
?
2

Graph easy sets of mute lambda terms:

Bucciarelli, A. ; Carraro, A. ; Favro, G..
Theoretical Computer Science.  629 (2016)  - p. 51-63 , 2016
 
?
3

Applying Universal Algebra to Lambda Calculus:

Manzonetto, G. ; Salibra, A.
Journal of Logic and Computation.  20 (2008)  4 - p. 877-915 , 2008
 
?
4

Easiness in graph models:

Berline, C. ; Salibra, A.
Theoretical Computer Science.  354 (2006)  1 - p. 4-23 , 2006
 
?
5

A continuum of theories of lambda calculus without semantic:

, In: Proceedings 16th Annual IEEE Symposium on Logic in Computer Science,
Salibra, A. - p. 334,335,336,337,338,339,340,341,342,343 , 2001
 
?
6

Equational type logic:

Manca, V. ; Salibra, A. ; Scollo, G.
Theoretical Computer Science.  77 (1990)  1-2 - p. 131-159 , 1990
 
?
7

Boolean-Like Algebras of Finite Dimension: From Boolean Pro..:

, In: Janusz Czelakowski on Logical Consequence; Outstanding Contributions to Logic,
 
?
 
?
9

Atrial fibrillation detection using photoplethysmographic s..:

, In: 2020 42nd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC),
 
?
10

Factor Varieties and Symbolic Computation:

, In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
12

Factor varieties:

Salibra, Antonino ; Ledda, Antonio ; Paoli, Francesco
Soft Computing.  21 (2015)  6 - p. 1443-1454 , 2015
 
?
14

Boolean-like algebras:

Salibra, Antonino ; Ledda, Antonio ; Paoli, Francesco.
Algebra universalis.  69 (2013)  2 - p. 113-138 , 2013
 
?
15

Easy lambda-terms are not always simple:

Carraro, Alberto ; Salibra, Antonino
RAIRO - Theoretical Informatics and Applications.  46 (2012)  2 - p. 291-314 , 2012
 
1-15