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