default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th POPL 1980: Las Vegas, Nevada, USA
- Paul W. Abrahams, Richard J. Lipton, Stephen R. Bourne:
Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, USA, January 1980. ACM Press 1980, ISBN 0-89791-011-7 - Norihisa Suzuki:
Analysis of Pointer Rotation. 1-11 - Alan J. Demers, James E. Donahue:
Data Types, Parameters, and Type Checking. 12-23 - Brian K. Reid:
A High-Level Approach to Computer Document Formatting. 24-31 - James H. Morris Jr., Eric Schmidt, Philip Wadler:
Experience with an Applicative String Processing Language. 32-46 - Paul Klint:
An Overview of the Summer Programming Language. 47-55 - A. J. Kfoury:
Analysis of Simple Programs Over Different Sets of Primitives. 56-61 - Zohar Manna, Amir Pnueli:
Synchronous Schemes and Their Decision Problems. 62-67 - L. Howard Holley, Barry K. Rosen:
Qualified Data Flow Problems. 68-82 - William E. Weihl:
Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables and Label Variables. 83-94 - Robert Endre Tarjan:
Prime Subprogram Parsing of a Program. 95-105 - Vaughan R. Pratt:
On Specifying Verifiers. 106-116 - Ravi Sethi:
A Case Study in Specifying the Semantics of a Programming Language. 117-130 - Samuel N. Kamin:
Final Data Tye Specifications: A New Data Type Specification Method. 131-138 - Deepak Kapur, Mandayam K. Srivas:
Expressiveness of the Operation Set of a Data Abstraction. 139-153 - David R. Musser:
On Proving Inductive Properties of Abstract Data Types. 154-162 - Dov M. Gabbay, Amir Pnueli, Saharon Shelah
, Jonathan Stavi:
On the Temporal Analysis of Fairness. 163-173 - Leslie Lamport:
"Sometime" is Sometimes "Not Never" - On the Temporal Logic of Programs. 174-185 - Rohit Parikh:
Propositional Logics of Programs: Systems, Models, and Complexity. 186-192 - John H. Reif, Gary L. Peterson:
A Dynamic Logic of Multiprocessing with Incomplete Information. 193-202 - Albert R. Meyer, Joseph Y. Halpern:
Axiomatic Definitions of Programming Languages: A Theoretical Assessment. 203-212 - Harry B. Hunt III, Daniel J. Rosenkrantz:
Efficient Algorithms for Structural Similarity of Grammars. 213-219 - Timothy A. Budd, Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward:
Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs. 220-233 - Alan J. Demers, James E. Donahue:
"Type-Completeness" as a Language Design Principle. 234-244 - Daniel P. Friedman, David S. Wise:
An Indeterminate Constructor for Applicative Programming. 245-250 - John V. Guttag, James J. Horning:
Formal Specification as a Design Tool. 251-261
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-24 23:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
