The SCEAS System
Navigation Menu

Search the dblp DataBase


Robert Pollack: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Robert Harper, Robert Pollack
    Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions (Draft). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.2, 1989, pp:241-256 [Conf]
  2. James McKinna, Robert Pollack
    Pure Type Systems Formalized. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:289-305 [Conf]
  3. Robert Pollack
    A Verified Typechecker. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:365-380 [Conf]
  4. Robert Pollack
    Dependently Typed Records for Representing Mathematical Structure. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2000, pp:462-479 [Conf]
  5. L. S. van Benthem Jutting, James McKinna, Robert Pollack
    Checking Algorithms for Pure Type Systems. [Citation Graph (0, 0)][DBLP]
    TYPES, 1993, pp:19-61 [Conf]
  6. Robert Pollack
    On Extensibility of Proof Checkers. [Citation Graph (0, 0)][DBLP]
    TYPES, 1994, pp:140-161 [Conf]
  7. Robert Pollack
    Dependently Typed Records in Type Theory. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2002, v:13, n:3-5, pp:386-402 [Journal]
  8. Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack
    Using Typed Lambda Calculus to Implement Formal Systems on a Machine. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1992, v:9, n:3, pp:309-354 [Journal]
  9. James McKinna, Robert Pollack
    Some Lambda Calculus and Type Theory Formalized. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1999, v:23, n:3-4, pp:373-409 [Journal]
  10. Robert Harper, Robert Pollack
    Type Checking with Universes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:89, n:1, pp:107-136 [Journal]

Search in 0.003secs, Finished in 0.003secs
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