The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John C. Reynolds: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John C. Reynolds
    Three Approaches to Type Structure. [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:97-138 [Conf]
  2. John C. Reynolds
    Using category theory to design implicit conversions and generic operators. [Citation Graph (0, 0)][DBLP]
    Semantics-Directed Compiler Generation, 1980, pp:211-258 [Conf]
  3. Peter W. O'Hearn, John C. Reynolds, Hongseok Yang
    Local Reasoning about Programs that Alter Data Structures. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:1-19 [Conf]
  4. John C. Reynolds
    Toward a Grainless Semantics for Shared-Variable Concurrency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:35-48 [Conf]
  5. John C. Reynolds
    An Intrinsic Semantics of Intersection Types. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:269-270 [Conf]
  6. John C. Reynolds
    On the Relation between Direct and Continuation Semantics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:141-156 [Conf]
  7. John C. Reynolds
    Syntactic Control of Inference, Part 2. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:704-722 [Conf]
  8. John C. Reynolds
    Automatic computation of data set definitions. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1968, pp:456-461 [Conf]
  9. John C. Reynolds
    A generalized resolution principle based upon context-free grammars. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (2), 1968, pp:1405-1411 [Conf]
  10. John C. Reynolds
    Types, Abstraction and Parametric Polymorphism. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:513-523 [Conf]
  11. John C. Reynolds
    Separation Logic: A Logic for Shared Mutable Data Structures. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:55-74 [Conf]
  12. John C. Reynolds
    An Introduction to Specification Logic. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:442- [Conf]
  13. Qingming Ma, John C. Reynolds
    Types, Abstractions, and Parametric Polymorphism, Part 2. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:1-40 [Conf]
  14. Lars Birkedal, Noah Torp-Smith, John C. Reynolds
    Local reasoning about a copying garbage collector. [Citation Graph (0, 0)][DBLP]
    POPL, 2004, pp:220-231 [Conf]
  15. Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
    Separation and information hiding. [Citation Graph (0, 0)][DBLP]
    POPL, 2004, pp:268-280 [Conf]
  16. John C. Reynolds
    Syntactic Control of Interference. [Citation Graph (0, 0)][DBLP]
    POPL, 1978, pp:39-46 [Conf]
  17. John C. Reynolds
    An Introduction to Logical Relations and Parametric Polymorphism - Tutorial. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:155-156 [Conf]
  18. John C. Reynolds
    Using Functor Categories to Generate Intermediate Code. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:25-36 [Conf]
  19. John C. Reynolds
    Towards a theory of type structure. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1974, pp:408-423 [Conf]
  20. John C. Reynolds
    Polymorphism is not Set-Theoretic. [Citation Graph (0, 0)][DBLP]
    Semantics of Data Types, 1984, pp:145-156 [Conf]
  21. John C. Reynolds
    The Coherence of Languages with Intersection Types. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:675-700 [Conf]
  22. John C. Reynolds
    Reasoning About Arrays. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:5, pp:290-299 [Journal]
  23. John C. Reynolds
    Beyond ML. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:172- [Journal]
  24. John C. Reynolds, Gordon D. Plotkin
    On Functors Expressible in the Polymorphic Typed Lambda Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:1, pp:1-29 [Journal]
  25. Peter W. O'Hearn, John C. Reynolds
    From Algol to polymorphic linear lambda-calculus. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:1, pp:167-223 [Journal]
  26. John C. Reynolds
    Semantics of the Domain of Flow Diagrams. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:3, pp:484-503 [Journal]
  27. John C. Reynolds
    The Discoveries of Continuations. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1993, v:6, n:3-4, pp:233-248 [Journal]
  28. John C. Reynolds
    Definitional Interpreters Revisited. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 1998, v:11, n:4, pp:355-361 [Journal]
  29. John C. Reynolds
    Definitional Interpreters for Higher-Order Programming Languages. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 1998, v:11, n:4, pp:363-397 [Journal]
  30. John C. Reynolds
    Beyond ML. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1997, v:32, n:1, pp:103-105 [Journal]

  31. Using Category Theory to Design Programming Languages. [Citation Graph (, )][DBLP]


  32. Readable Formal Proofs. [Citation Graph (, )][DBLP]


  33. An Overview of Separation Logic. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002