Conferences in DBLP
Andrew P. Tolmach , Andrew W. Appel Debugging Standard ML Without Reverse Engineering. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Curtis , James Rauen A Module System for Scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Mark A. Sheldon , David K. Gifford Static Dependent Types for First Class Modules. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Cardelli , Giuseppe Longo A Semantic Basis for Quest. [Citation Graph (0, 0)][DBLP ] Conf ] Val Tannen , Carl A. Gunter , Andre Scedrov Computing with Coercions. [Citation Graph (0, 0)][DBLP ] Conf ] Philip Wadler Comprehending Monads. [Citation Graph (8, 0)][DBLP ] Conf ] Douglas Johnson Trap Architectures for Lisp Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin G. Zorn Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collection. [Citation Graph (1, 0)][DBLP ] Conf ] Gregor Kiczales , Luis Rodriguez Efficient Method Dispatch in PCL. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Hanson Efficient Stack Allocation for Tail-Recursive Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Feeley , James S. Miller A Parallel Virtual Machine for Efficient Scheme Compilation. [Citation Graph (0, 0)][DBLP ] Conf ] Clifford Walinsky , Deb Banerjee A Functional Programming Language Compiler for Massively Parallel Computers. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Berlin Partial Evaluation Applied to Numerical Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Danvy , Andrzej Filinski Abstracting Control. [Citation Graph (0, 0)][DBLP ] Conf ] Dorai Sitaram , Matthias Felleisen Reasoning with Continuations II: Full Abstraction for Models of Control. [Citation Graph (0, 0)][DBLP ] Conf ] Morry Katz , Daniel Weise Continuing into the Future: On the Interaction of Futures and First-Class Continuations. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Mohr , David A. Kranz , Robert H. Halstead Jr. Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Randy B. Osborne Speculative Computation in Multilisp. [Citation Graph (0, 0)][DBLP ] Conf ] J.-F. Giorgi , Daniel Le Métayer Continuation-Based Parallel Implementation of Functional Programming Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Henry G. Baker Unify and Conquer. [Citation Graph (0, 0)][DBLP ] Conf ] Geoffrey L. Burn Using Projection Analysis of Evaluation-Order and Its Application. [Citation Graph (0, 0)][DBLP ] Conf ] M. Draghicescu , S. Purushothaman A Compositional Analysis of Evaluation-Order and Its Application. [Citation Graph (0, 0)][DBLP ] Conf ] Hanne Riis Nielson , Flemming Nielson Context Information for Lazy Code Generation. [Citation Graph (0, 0)][DBLP ] Conf ] Charles Consel Binding Time Analysis for High Order Untyped Functional Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Laurence Puel , Ascánder Suárez Compiling Pattern Matching by Term Decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten K. Gomard Partial Type Inference for Untyped Functional Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Leivant Discrete Polymorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Brian T. Howard , John C. Mitchell Operational and Axiomatic Semantics of PCF. [Citation Graph (0, 0)][DBLP ] Conf ] John Field , Tim Teitelbaum Incremental Reduction in the lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] John Hannan , Dale Miller From Operational Semantics to Abstract Machines: Preliminary Results. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Crégut An Abstract Machine for Lambda-Terms Normalization. [Citation Graph (0, 0)][DBLP ] Conf ] Gopalan Nadathur , Debra Sue Wilson A Representation of Lambda Terms Suitable for Operations on Their Intensions. [Citation Graph (0, 0)][DBLP ] Conf ] 