default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st POPL 1994: Portland, Oregon, USA
- Hans-Juergen Boehm, Bernard Lang, Daniel M. Yellin:
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 - Jacques Garrigue, Hassan Aït-Kaci:
The Typed Polymorphic Label-Selective lambda-Calculus. 35-47 - 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 - Giuseppe Castagna, Benjamin C. Pierce:
Decidable Bounded Quantification. 151-162 - Alexander Aiken, Edward L. Wimmers, T. K. Lakshman:
Soft Typing with Conditional Types. 163-173 - 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 - Fritz Henglein, Jesper Jørgensen:
Formally Optimal Boxing. 213-226 - 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 - Sergio Antoy, Rachid Echahed, Michael Hanus:
A Needed Narrowing Strategy. 268-279 - Todd A. Proebsting, Christopher W. Fraser:
Detecting Pipeline Structural Hazards Quickly. 280-286 - 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 - Rance Cleaveland, Daniel Yankelevich:
An Operational Framework for Value-Passing Processes. 326-338 - Bard Bloom:
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. 339-347 - Kohei Honda, Nobuko Yoshida:
Combinatory Representation of Mobile Processes. 348-360 - Jukka Paakki:
Multi-Pass Execution of Functional Logic Programs. 361-374 - John Boyland, Susan L. Graham:
Composing Tree Attributions. 375-388 - Robert Muller:
A Staging Calculus and its Application to the Verification of Translators. 389-396 - Brad Calder, Dirk Grunwald:
Reducing Indirect Function call Overhead in C++ Programs. 397-408 - Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan:
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. 409-420 - Lawrence Feigen, David Klappholz, Robert Casazza, Xing Xue:
The Revival Transformation. 421-434 - Mitchell Wand, Paul Steckler:
Selective and Lightweight Closure Conversion. 435-445 - Andrzej Filinski:
Representing Monads. 446-457 - John Hatcliff, Olivier Danvy:
A Generic Account of Continuation-Passing Styles. 458-471 - Guy L. Steele Jr.:
Building Interpreters by Composing Monads. 472-492
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 2025-10-29 01:24 CET 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:
