Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-6
|
Results: 6
BOUNDED EXISTENTIALS AND MINIMAL TYPING
Authors:
GHELLI G PIERCE B
Citation:
G. Ghelli et B. Pierce, BOUNDED EXISTENTIALS AND MINIMAL TYPING, Theoretical computer science, 193(1-2), 1998, pp. 75-96
TERMINATION OF SYSTEM F-BOUNDED - A COMPLETE PROOF
Authors:
GHELLI G
Citation:
G. Ghelli, TERMINATION OF SYSTEM F-BOUNDED - A COMPLETE PROOF, Information and computation, 139(1), 1997, pp. 39-56
COMPLEXITY OF KERNEL FUN SUBTYPE CHECKING
Authors:
GHELLI G
Citation:
G. Ghelli, COMPLEXITY OF KERNEL FUN SUBTYPE CHECKING, ACM SIGPLAN NOTICES, 31(6), 1996, pp. 134-145
A CALCULUS FOR OVERLOADED FUNCTIONS WITH SUBTYPING
Authors:
CASTAGNA G GHELLI G LONGO G
Citation:
G. Castagna et al., A CALCULUS FOR OVERLOADED FUNCTIONS WITH SUBTYPING, Information and computation, 117(1), 1995, pp. 115-135
DIVERGENCE OF F-LESS-THAN-OR-EQUAL-TO TYPE CHECKING
Authors:
GHELLI G
Citation:
G. Ghelli, DIVERGENCE OF F-LESS-THAN-OR-EQUAL-TO TYPE CHECKING, Theoretical computer science, 139(1-2), 1995, pp. 131-162
DECIDABILITY AND CONFLUENCE OF BETA-ETA-TOP(LESS-THAN-OR-EQUAL-TO) REDUCTION IN F(LESS-THAN-OR-EQUAL-TO)
Authors:
CURIEN PL GHELLI G
Citation:
Pl. Curien et G. Ghelli, DECIDABILITY AND CONFLUENCE OF BETA-ETA-TOP(LESS-THAN-OR-EQUAL-TO) REDUCTION IN F(LESS-THAN-OR-EQUAL-TO), Information and computation, 109(1-2), 1994, pp. 57-114
Risultati:
1-6
|