Conferences in DBLP
John Field On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] John Lamping An Algorithm for Optimal Lambda Calculus Reduction. [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi , Luca Cardelli , Pierre-Louis Curien , Jean-Jacques Lévy Explicit Substitutions. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Griffin A Formulae-as-Types Notion of Control. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Asperti , Gian Luigi Ferrari , Roberto Gorrieri Implicative Formulae in the ``Proofs as Computations'' Analogy. [Citation Graph (0, 0)][DBLP ] Conf ] Yiannis N. Moschovakis Computable processes. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Berry , Gérard Boudol The Chemical Abstract Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Lafont Interaction Nets. [Citation Graph (0, 0)][DBLP ] Conf ] John C. Mitchell Toward a Typed Foundation for Method Specialization and Inheritance. [Citation Graph (2, 0)][DBLP ] Conf ] William R. Cook , Walter L. Hill , Peter S. Canning Inheritance Is Not Subtyping. [Citation Graph (8, 0)][DBLP ] Conf ] Justin O. Graver , Ralph E. Johnson A Type System for Smalltalk. [Citation Graph (1, 0)][DBLP ] Conf ] Geoffrey L. Burn A Relationship Between Abstract Interpretation and Projection Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Deutsch On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications. [Citation Graph (1, 0)][DBLP ] Conf ] R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan Small Domains Spell Fast Strictness Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas J. Marlowe , Barbara G. Ryder An Efficient Hybrid Algorithm for Incremental Data Flow Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Nevin Heintze , Joxan Jaffar A Finite Presentation Theorem for Approximating Logic Programs. [Citation Graph (1, 0)][DBLP ] Conf ] Alexander Aiken , John H. Williams , Edward L. Wimmers Program Transformation in the Presence of Errors. [Citation Graph (0, 0)][DBLP ] Conf ] Guy L. Steele Jr. Making Asynchronous Parallelism Safe for the World. [Citation Graph (0, 0)][DBLP ] Conf ] Vijay A. Saraswat , Martin C. Rinard Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Raghu Ramakrishnan Parallelism in Logic Programs. [Citation Graph (2, 0)][DBLP ] Conf ] Alan J. Demers , Mark Weiser , Barry Hayes , Hans-Juergen Boehm , Daniel G. Bobrow , Scott Shenker Combining Generational and Conservative Garbage Collection: Framework and Implementations. [Citation Graph (0, 0)][DBLP ] Conf ] Krishna V. Palem , Barbara B. Simons Scheduling Time-Critical Instructions on RISC Machines. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ramesh , I. V. Ramakrishnan , David Scott Warren Automata-Driven Indexing of Prolog Clauses. [Citation Graph (1, 0)][DBLP ] Conf ] Paul C. Attie , Nissim Francez , Orna Grumberg Fairness and Hyperfairness in Multi-Party Interactions. [Citation Graph (0, 0)][DBLP ] Conf ] Carl A. Gunter Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] James R. Russell On Oraclizable Networks and Kahn's Principle. [Citation Graph (0, 0)][DBLP ] Conf ] Eugene W. Stark On the Relations Computable by a Class of Concurrent Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Harper , John C. Mitchell , Eugenio Moggi Higher-Order Modules and the Phase Distinction. [Citation Graph (0, 0)][DBLP ] Conf ] François Rouaix Safe Run-time Overloading. [Citation Graph (0, 0)][DBLP ] Conf ] Satish R. Thatte Quasi-Static Typing. [Citation Graph (0, 0)][DBLP ] Conf ] Harry G. Mairson Deciding ML Typability is Complete for Deterministic Exponential Time. [Citation Graph (0, 0)][DBLP ] Conf ] 