The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Principles of Programming Languages (POPL) (popl)
1981 (conf/popl/81)

  1. P. Geoffrey Lowney
    Carrier Arrays: An Idiom-Preserving Extension to APL. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:1-13 [Conf]
  2. Robert Cartwright, Robert Hood, Philip Mathews
    Paths: An Abstract Alternative to Pointers. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:14-27 [Conf]
  3. J. Ramanathan, C. J. Shubra
    Modeling of Problem Domains for Driving Program Development Systems. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:28-40 [Conf]
  4. William L. Scherlis
    Program Improvement by Internal Specialization. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:41-49 [Conf]
  5. Ashok K. Chandra
    Programming Primitives for Database Languages. [Citation Graph (29, 17)][DBLP]
    POPL, 1981, pp:50-62 [Conf]
  6. Michael W. Condry
    Paging as a ``Language Processing'' Task. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:63-76 [Conf]
  7. Susan S. Owicki
    Making the World Safe for Garbage Collection. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:77-86 [Conf]
  8. William H. Harrison
    Position Paper on Optimizing Compilers. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:88-89 [Conf]
  9. Stephen C. Johnson
    Position Paper on Optimizing Compilers. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:90-91 [Conf]
  10. Cyril N. Alberga, Alfred L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman
    A Program Development Tool. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:92-104 [Conf]
  11. Alan J. Demers, Thomas W. Reps, Tim Teitelbaum
    Incremental Evaluation for Attribute Grammars with Application to Syntax-Directed Editors. [Citation Graph (2, 0)][DBLP]
    POPL, 1981, pp:105-116 [Conf]
  12. Barry K. Rosen
    Linear Cost is Sometimes Quadratic. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:117-124 [Conf]
  13. Robert Cartwright
    Formal Program Testing. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:125-132 [Conf]
  14. Daniel J. Lehmann, Michael O. Rabin
    On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:133-138 [Conf]
  15. Joseph Y. Halpern, Albert R. Meyer
    Axiomatic Definitions of Programming Languages, II. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:139-148 [Conf]
  16. Wolfgang Polak
    Program Verification Based on Denotational Semantics. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:149-158 [Conf]
  17. Vaughan R. Pratt
    Program Logic Without Binding is Decidable. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:159-163 [Conf]
  18. Mordechai Ben-Ari, Zohar Manna, Amir Pnueli
    The Temporal Logic of Branching Time. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:164-176 [Conf]
  19. Takuya Katayama, Yutaka Hoshino
    Verification of Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:177-186 [Conf]
  20. Norihisa Suzuki
    Inferring Types in Smalltalk. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:187-199 [Conf]
  21. John L. Hennessy
    Program Optimization and Exception Handling. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:200-206 [Conf]
  22. David J. Kuck, Robert H. Kuhn, David A. Padua, Bruce Leasure, Michael Wolfe
    Dependence Graphs and Compiler Optimizations. [Citation Graph (1, 0)][DBLP]
    POPL, 1981, pp:207-218 [Conf]
  23. Eugene W. Myers
    A Precise Interprocedural Data Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:219-230 [Conf]
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