default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th POPL 1984: Salt Lake City, Utah, USA
- Ken Kennedy, Mary S. Van Deusen, Larry Landweber:
Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, Utah, USA, January 1984. ACM Press 1984, ISBN 0-89791-125-3 - Richard C. Waters:
Expressional Loops. 1-10 - Harold Ossher:
Grids: A New Program Structuring Mechanism Based on Layered Graphs. 11-22 - Brian Cantwell Smith:
Reflection and Semantics in Lisp. 23-35 - Thomas W. Reps, Bowen Alpern:
Interactive Proof Checking. 36-45 - Nissim Francez, Dexter Kozen:
Generalized Fair Termination. 46-53 - Dennis E. Shasha, Amir Pnueli, W. Ewald:
Temporal Verification of Carrier-Sense Local Area Network Protocols. 54-65 - Eugene W. Myers:
Efficient Applicative Data Types. 66-75 - Jean-Jacques Thiel:
Stop Losing Sleep Over Incomplete Data Type Specifications. 76-82 - Jean-Pierre Jouannaud, Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations. 83-92 - Ehud Shapiro:
Systems Programming in Concurrent Prolog. 93-105 - Robert G. Bandes:
Constraining-Unification and the Programming Language Unicorn. 106-110 - Christoph M. Hoffmann, Michael J. O'Donnell:
Implementation of an Interpreter for Abstract Equations. 111-121 - Paul Hudak, David A. Kranz:
A Combinator-Based Compiler for a Functional Language. 122-132 - Jerald S. Schwarz, Dean Rubine:
Treat - An Applicative Code Generator. 133-139 - Reinhard Wilhelm:
Inverse Currying Transformation on Attribute Grammars. 140-147 - Jean-Claude Raoult, Ravi Sethi:
The Global Storage Needs of a Subcomputation. 148-157 - Mitchell Wand:
A Types-as-Sets Semantics for Milner-Style Polymorphism. 158-164 - David B. MacQueen, Gordon D. Plotkin, Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types. 165-174 - John C. Mitchell:
Coercion and Type Inference. 175-185 - Robert P. Nix:
Editing by Example. 186-195 - Don Milos, Uwe F. Pleban, George Loegel:
Direct Implementation of Compiler Specifications or the Pascal P-code Compiler Revisited. 196-207 - Mark Sherman:
Paragon: Novel Uses of Type Hierarchies for Data Abstraction. 208-217 - Steven D. Johnson:
Applicative Programming and Digital Design. 218-227 - P. A. Subrahmanyam, Jia-Huai You:
Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs. 228-234 - Prateek Mishra, Robert M. Keller:
Static Inference of Properties of Applicative Programs. 235-244 - Joseph Y. Halpern, Albert R. Meyer, Boris A. Trakhtenbrot:
The Semantics of Local Storage, or What Makes the Free-List Free? 245-257 - Michal Grabowski:
On Relative Completeness of Programming Logics. 258-261 - Joseph Y. Halpern:
A Good Hoare Axiom System for an Algol-like Language. 262-271 - Joe D. Warren:
A Hierarchical Basis for Reordering Transformations. 272-282 - Thomas P. Murtagh:
A Less Dynamic Memory Allocation Scheme for Algol-like Languages. 283-289 - Norihisa Suzuki, Minoru Terada:
Creating Efficient Systems for Object-Oriented Languages. 290-296 - L. Peter Deutsch, Allan M. Schiffman:
Efficient Implementation of the Smalltalk-80 System. 297-302
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 2024-09-22 23:43 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
