Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar18. POPL 1991: Orlando, Florida, USA
David S. Wise:
Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, January 21-23, 1991. ACM Press 1991, ISBN 0-89791-419-8R. S. Sundaresh, Paul Hudak:
Incremental Compilation via Partial Evaluation. 1-13Charles Consel, Olivier Danvy:
Static and Dynamic Semantics Processing. 14-24Martin Odersky:
How to Make Destructive Updates Less Destructive. 25-36R. C. Sekar, Prateek Mishra, I. V. Ramakrishnan:
On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. 37-48Samson Abramsky, Thomas P. Jensen:
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. 49-54Jong-Deok Choi, Ron Cytron, Jeanne Ferrante:
Automatic Construction of Sparse Data Flow Evaluation Graphs. 55-66Keshav Pingali, Micah Beck, Richard Johnson, Mayan Moudgill, Paul Stodghill:
Dependence Flow Graphs: An Algebraic Approach to Program Dependencies. 67-78Shlomit S. Pinter, Ron Y. Pinter:
Program Optimization and Parallelization Using Idioms. 79-92William Landi, Barbara G. Ryder:
Pointer-Induced Aliasing: A Problem Classification. 93-103Roberto M. Amadio, Luca Cardelli:
Subtyping Recursive Types. 104-118Fritz Henglein, Harry G. Mairson:
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. 119-130Robert Harper, Benjamin C. Pierce:
A Record Calculus Based on Symmetric Concatenation. 131-142Jiazhen Cai, Robert Paige:
"Look Ma, No Hashing, And No Arrays Neither". 143-154William D. Clinger, Jonathan Rees:
Macros That Work. 155-162Bruce F. Duba, Robert Harper, David B. MacQueen:
Typing First-Class Continuations in ML. 163-173Christian Queinnec, Bernard P. Serpette:
A Dynamic Extent Control Operator for Partial Continuations. 174-184Dorai Sitaram, Matthias Felleisen:
Modeling Continuations without Continuations. 185-196Steven Lucco, Oliver Sharp:
Parallel Programming With Coordination Structures. 197-208Yuh-Jzer Joung, Scott A. Smolka:
Coordinating First-Order Multiparty Interactions. 209-220Alon Kleinman, Yael Moscowitz, Amir Pnueli, Ehud Shapiro:
Communication with Directed Logic Variables. 221-232Erik Crank, Matthias Felleisen:
Parameter-Passing and the Lambda Calculus. 233-244Jon G. Riecke:
Fully Abstract Translations between Functional Languages. 245-254Luc Maranget:
Optimal Derivations in Weak Lambda-calculi and in Orthogonal Terms Rewriting Systems. 255-269John C. Mitchell, Sigurd Meldal, Neel Madhav:
An Extension of Standard ML Modules with Subtyping and Inheritance. 270-278Alexander Aiken, Brian R. Murphy:
Static Type Inference in a Dynamically Typed Language. 279-290Xavier Leroy, Pierre Weis:
Polymorphic Type Inference and Assignment. 291-302Pierre Jouvelot, David K. Gifford:
Algebraic Reconstruction of Types and Effects. 303-310Vaughan R. Pratt:
Modeling Concurrency with Geometry. 311-322Martín Abadi, Gordon D. Plotkin:
A Logical View of Composition and Refinement. 323-332Vijay A. Saraswat, Martin C. Rinard, Prakash Panangaden:
Semantic Foundations of Concurrent Constraint Programming. 333-352Thomas A. Henzinger, Zohar Manna, Amir Pnueli:
Temporal Proof Methodologies for Real-time Systems. 353-366
last updated on 2019-10-20 23:22 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
