21. POPL 1994: Portland, Oregon, USA
Hans-Juergen Boehm, Bernard Lang, Daniel M. Yellin (Eds.): Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, USA, January 17-21, 1994. ACM Press 1994 ISBN 0-89791-636-0- Amer Diwan, David Tarditi, J. Eliot B. Moss: Memory Subsystem Performance of Programs Using Copying Garbage Collection. 1-14
- Norman Ramsey: Correctness of Trap-Based Breakpoint Implementations. 15-24
- Hiralal Agrawal: Dominators, Super Blocks, and Program Coverage. 25-34
- Martin Odersky: A Functional Theory of Local Names. 48-59
- Pierre Lescanne: From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. 60-69
- Damien Doligez, Georges Gonthier: Portable, Unobtrusive Garbage Collection for Multiprocessor Systems. 70-83
- Hanne Riis Nielson, Flemming Nielson: Higher-Order Concurrent Programs with Finite Communication Topology. 84-97
- Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi: Proving Concurrent Constraint Programs Correct. 98-108
- Xavier Leroy: Manifest Types, Modules, and Separate Compilation. 109-122
- Robert Harper, Mark Lillibridge: A Type-Theoretic Approach to Higher-Order Modules with Sharing. 123-137
- Dinesh Katiyar, David C. Luckham, John C. Mitchell: A Type System for Prototyping Languages. 138-150
- Satish Thatté: Automated Synthesis of Interface Adapters for Reusable Classes. 174-187
- Mads Tofte, Jean-Pierre Talpin: Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions. 188-201
- Chris Hankin, Daniel Le Métayer: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. 202-212
- Agostino Cortesi, Baudouin Le Charlier, Pascal Van Hentenryck: Combinations of Abstract Domains for Logic Programming. 227-239
- Kim Marriott, Maria J. García de la Banda, Manuel V. Hermenegildo: Analyzing Logic Programs with Dynamic Scheduling. 240-253
- Zhenyu Qian: Higher-Order Equational Logic Programming. 254-267
- G. Ramalingam, Thomas W. Reps: An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. 287-296
- Daniel Weise, Roger F. Crew, Michael D. Ernst, Bjarne Steensgaard: Value Dependence Graphs: Representation without Taxation. 297-310
- Vadim Maslov: Lazy Array Data-Flow Dependence Analysis. 311-325
- Bard Bloom: CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. 339-347
- Jukka Paakki: Multi-Pass Execution of Functional Logic Programs. 361-374
- Robert Muller: A Staging Calculus and its Application to the Verification of Translators. 389-396
- Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan: Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. 409-420
- Andrzej Filinski: Representing Monads. 446-457
- Guy L. Steele Jr.: Building Interpreters by Composing Monads. 472-492
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team