D. Colazzo and G. Ghelli. Subtyping recursive types in kernel Fun, 1998. file://ftp.di.unipi.it/pub/Papers/ghelli/recursive.ps. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Subtyping Recursive Types in Kernel Fun - Colazzo, Ghelli (1999) (2 citations) Self-citation (Colazzo Ghelli) (Correct)
No context found.
D. Colazzo and G. Ghelli. Subtyping recursive types in kernel Fun, 1998. file://ftp.di.unipi.it/pub/Papers/ghelli/recursive.ps.
Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetà (1999) Self-citation (Ghelli) (Correct)
No context found.
D. Colazzo and G. Ghelli. Subtyping recursive types in kernel Fun, extended abstract. In Proc. of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, June 1999.
Participants - Antonio Albano Professor Self-citation (Colazzo Ghelli) (Correct)
.... of complex databases in interrelated units, and for the de nition of external schemas [6, 17] The language has been implemented, and during this phase we studied the implementation of object with roles, the implementation of typechecking procedures, and the ecient use of persistent memory [26, 4, 28, 29, 16]. A view mechanism for object databases. The main contribution is a set of object viewing operations for the strongly typed database programming language Galileo 97, which supports objects with roles. These viewing operations are then used to give the semantics of a higher level mechanism to de ....
....He published nine papers on refereed journals and twentyeight papers in international refereed conferences and workshops, coauthored with Antonio Albano, Luca Cardelli, Giuseppe Castagna, Richard Connor, Pierre Louis Curien, Giuseppe Longo, Benjamin Pierce, and many others. Selected Papers: [6, 12, 11, 31, 16]. Keywords Database programming languages, Type systems, Data models, Semistructured data, World Wide Web. ....
D. Colazzo and G. Ghelli. Subtyping recursive types in kernel Fun, extended abstract. In Proc. of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, June 1999.
Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetą Self-citation (Ghelli) (Correct)
....can distinguish two (families of) approaches to type level recursion, usually referred to as weak recursion and strong recursion. In the strong approach the type X:A is seen as the only solution of the equation X = A. Therefore the type equality X:A = A[X X:A] holds in a strong sense (see [AC93, CG99] The weak approach, on the other hand, only provides a couple of functions fold X:A : A[X X:A] X:A and unfold X:A : X:A A[X X:A] which allow the programmer to pass explicitly from a recursive type to its unfolding and vice versa [GMW79, AC96b] The weak approach makes type and subtype checking ....
....type checking algorithm, even for terms where no recursive type is used. The definition of complete type and subtype checking algorithms for second order systems with subtyping and strong recursion is still an open problem. The only known result is the algorithm for system kernel fun defined in [CG99] On the other hand, weak recursion does not modify the subtype relation, and has no effect on type checking since the type of a fold X:A or unfold X:A function can be read from its index, thus allowing these functions to be type checked like any user defined function. However, weak recursion is ....
D. Colazzo and G. Ghelli. Subtyping recursive types in kernel Fun, extended abstract. In Proc. of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, June 1999.
Numbering Matters: First-Order Canonical Forms for.. - Gauthier, Pottier (2004) (Correct)
No context found.
Dario Colazzo and Giorgio Ghelli. Subtyping recursive types in kernel fun. In IEEE Symposium on Logic in Computer Science (LICS), pages 137--146, July 1999.
A symbolic labelled transition system for coinductive subtyping.. - Jeffrey (Correct)
No context found.
D. Colazzo and G. Ghelli. Subtyping recursive types in kernel Fun, extended abstract. In Proc. Logic in Computer Science. IEEE Computer Society Press, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC