The SCEAS System
Navigation Menu

Search the dblp DataBase


Felice Cardone: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Felice Cardone
    An Algebraic Approach to the Interpretation of Recursive Types. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:66-85 [Conf]
  2. Felice Cardone
    Relational Semantics for Recursive Types and Bounded Quantification. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:164-178 [Conf]
  3. Felice Cardone, Mario Coppo
    Decidability Properties of Recursive Types. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:242-255 [Conf]
  4. Anatol W. Holt, Felice Cardone
    An Organisational Theory of Information. [Citation Graph (0, 0)][DBLP]
    ISCO, 1999, pp:77-91 [Conf]
  5. Felice Cardone
    Strict Finitism and Feasibility. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:1-21 [Conf]
  6. Felice Cardone, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro
    Combining Type Disciplines. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:66, n:3, pp:197-230 [Journal]
  7. Felice Cardone, Mario Coppo
    Type Inference with Recursive Types: Syntax and Semantics [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:1, pp:48-80 [Journal]
  8. Paolo Boldi, Felice Cardone, Manfred Droste
    Universal Homogeneous Graph-Like Structures And Domains. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:1, pp:91-109 [Journal]
  9. Felice Cardone
    A coinductive completeness proof for the equivalence of recursive types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:575-587 [Journal]
  10. Felice Cardone
    Recursive Types for Fun. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:1, pp:29-56 [Journal]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002