default search action
LISP and Functional Programming 1994: Orlando, Florida, USA
- Robert R. Kessler:
Proceedings of the 1994 ACM Conference on LISP and Functional Programming, Orlando, Florida, USA, 27-29 June 1994. ACM 1994, ISBN 0-89791-643-3 - Andrew P. Tolmach:
Tag-Free Garbage Collection Using Explicit Type Parameters. 1-11 - Shail Aditya, Christine H. Flood, James E. Hicks:
Garbage Collection for Strongly-Typed Languages Using Run-Time Type Reconstruction. 12-23 - Pascal Fradet:
Collecting More Garbage. 24-33 - James W. O'Toole Jr., Scott Nettles:
Concurrent Replicating Garbage Collection. 34-42 - Darko Stefanovic, J. Eliot B. Moss:
Characterization of Object Behaviour in Standard ML of New Jersey. 43-54 - Edoardo Biagioni, Robert Harper, Peter Lee, Brian Milnes:
Signatures for a Network Protocol Stack: A Systems Application of Standard ML. 55-64 - Brian Reistad, David K. Gifford:
Static Dependent Costs for Estimating Execution Time. 65-78 - Lorenz Huelsbergen, James R. Larus, Alexander Aiken:
Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation. 79-90 - Christian Queinnec:
Locality, Causality and Continuations. 91-102 - J. H. Jacobs, Mark R. Swanson:
Syntax and Semantics of a Persistent Common Lisp. 103-112 - Harley Davis, Pierre Parquier, Nitsan Séniak:
Talking About Modules and Delivery. 113-120 - Harley Davis, Pierre Parquier, Nitsan Séniak:
Sweet Harmony: The Talk/C++ Connection. 121-127 - William D. Clinger, Lars Thomas Hansen:
Lambda, the Ultimate Label or a Simple Optimizing Compiler for Scheme. 128-139 - J. Michael Ashley, R. Kent Dybvig:
An Efficient Implementation of Multiple Return Values in Scheme. 140-149 - Zhong Shao, Andrew W. Appel:
Space-Efficient Closure Representations. 150-161 - Cordelia V. Hall:
Using Hindley-Milner Type Inference to Optimise List Representation. 162-172 - Tyng-Ruey Chuang:
A Randomized Implementation of Multiple Functional Arrays. 173-184 - Zhong Shao, John H. Reppy, Andrew W. Appel:
Unrolling Lists. 185-195 - A. J. Kfoury, J. B. Wells:
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. 196-207 - Satish R. Thatte:
Semantics of Type Classes Revisited. 208-219 - Stavros S. Cosmadakis:
Complete Proof Systems for Algebraic Simply-Typed Terms. 220-226 - Julia L. Lawall, Olivier Danvy:
Continuation-Based Partial Evaluation. 227-238 - Hsianlin Dzeng, Christopher T. Haynes:
Type Reconstruction for Variable-Arity Procedures. 239-249 - Andrew K. Wright, Robert Cartwright:
A Practical Soft Type System for Scheme. 250-262 - A. V. S. Sastry, William D. Clinger:
Parallel Destructive Updating in Strict Functional Languages. 263-272 - Jeffrey Dean, Craig Chambers:
Towards Better Inlining Decisions Using Inlining Trials. 273-282 - Sandip K. Biswas:
In-Place Updates in the Presence of Control Operators. 283-293 - Suresh Jagannathan, Stephen Weeks:
Analyzing Stores and References in a Parallel Symbolic Language. 294-305 - Nevin Heintze:
Set-Based Analysis of ML Programs. 306-317 - Dan C. Stefanescu, Yuli Zhou:
An Equational Framework for the Flow Analysis of Higher Order Functional Programs. 318-327
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.