Conferences in DBLP
Amer Diwan , David Tarditi , J. Eliot B. Moss Memory Subsystem Performance of Programs Using Copying Garbage Collection. [Citation Graph (0, 0)][DBLP ] Conf ] Norman Ramsey Correctness of Trap-Based Breakpoint Implementations. [Citation Graph (0, 0)][DBLP ] Conf ] Hiralal Agrawal Dominators, Super Blocks, and Program Coverage. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Garrigue , Hassan Aït-Kaci The Typed Polymorphic Label-Selective lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Odersky A Functional Theory of Local Names. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Lescanne From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. [Citation Graph (1, 0)][DBLP ] Conf ] Damien Doligez , Georges Gonthier Portable, Unobtrusive Garbage Collection for Multiprocessor Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Hanne Riis Nielson , Flemming Nielson Higher-Order Concurrent Programs with Finite Communication Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Frank S. de Boer , Maurizio Gabbrielli , Elena Marchiori , Catuscia Palamidessi Proving Concurrent Constraint Programs Correct. [Citation Graph (0, 0)][DBLP ] Conf ] Xavier Leroy Manifest Types, Modules, and Separate Compilation. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Harper , Mark Lillibridge A Type-Theoretic Approach to Higher-Order Modules with Sharing. [Citation Graph (0, 0)][DBLP ] Conf ] Dinesh Katiyar , David C. Luckham , John C. Mitchell A Type System for Prototyping Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Castagna , Benjamin C. Pierce Decidable Bounded Quantification. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Aiken , Edward L. Wimmers , T. K. Lakshman Soft Typing with Conditional Types. [Citation Graph (1, 0)][DBLP ] Conf ] Satish Thatté Automated Synthesis of Interface Adapters for Reusable Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Mads Tofte , Jean-Pierre Talpin Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Hankin , Daniel Le Métayer Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Fritz Henglein , Jesper Jørgensen Formally Optimal Boxing. [Citation Graph (0, 0)][DBLP ] Conf ] Agostino Cortesi , Baudouin Le Charlier , Pascal Van Hentenryck Combinations of Abstract Domains for Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Kim Marriott , Maria J. García de la Banda , Manuel V. Hermenegildo Analyzing Logic Programs with Dynamic Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Zhenyu Qian Higher-Order Equational Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Antoy , Rachid Echahed , Michael Hanus A Needed Narrowing Strategy. [Citation Graph (0, 0)][DBLP ] Conf ] Todd A. Proebsting , Christopher W. Fraser Detecting Pipeline Structural Hazards Quickly. [Citation Graph (0, 0)][DBLP ] Conf ] G. Ramalingam , Thomas W. Reps An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Weise , Roger F. Crew , Michael D. Ernst , Bjarne Steensgaard Value Dependence Graphs: Representation without Taxation. [Citation Graph (0, 0)][DBLP ] Conf ] Vadim Maslov Lazy Array Data-Flow Dependence Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Rance Cleaveland , Daniel Yankelevich An Operational Framework for Value-Passing Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Bard Bloom CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. [Citation Graph (0, 0)][DBLP ] Conf ] Kohei Honda , Nobuko Yoshida Combinatory Representation of Mobile Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Jukka Paakki Multi-Pass Execution of Functional Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] John Boyland , Susan L. Graham Composing Tree Attributions. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Muller A Staging Calculus and its Application to the Verification of Translators. [Citation Graph (0, 0)][DBLP ] Conf ] Brad Calder , Dirk Grunwald Reducing Indirect Function call Overhead in C++ Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Koenraad De Bosschere , Saumya K. Debray , David Gudeman , Sampath Kannan Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Lawrence Feigen , David Klappholz , Robert Casazza , Xing Xue The Revival Transformation. [Citation Graph (0, 0)][DBLP ] Conf ] Mitchell Wand , Paul Steckler Selective and Lightweight Closure Conversion. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Filinski Representing Monads. [Citation Graph (0, 0)][DBLP ] Conf ] John Hatcliff , Olivier Danvy A Generic Account of Continuation-Passing Styles. [Citation Graph (0, 0)][DBLP ] Conf ] Guy L. Steele Jr. Building Interpreters by Composing Monads. [Citation Graph (0, 0)][DBLP ] Conf ] 