default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLISP and Functional Programming 1992: San Francisco, California, USA
- Jon L. White:
Proceedings of the Conference on Lisp and Functional Programming, LFP 1992, San Francisco, California, USA, 22-24 June 1992. ACM 1992, ISBN 0-89791-481-3 - Anders Bondorf:
Improving Binding Times Without Explicit CPS-Conversion. 1-10 - Wei-Ngan Chin:
Safe Fusion of Functional Expressions. 11-20 - Luc Maranget:
Compiling Lazy Pattern Matching. 21-31 - Paul R. Wilson, Michael S. Lam, Thomas G. Moher:
Caching Considerations for Generational Garbage Collection. 32-42 - Eric Cooper, Scott Nettles, Indira Subramanian:
Improving the Performance of SML Garbage Collection Using Application-Specific Virtual Memory Management. 43-52 - Benjamin Goldberg, Michael Gloger:
Polymorphic Type Reconstruction for Garbage Collection Without Tags. 53-65 - Didier Rémy:
Projective ML. 66-75 - Daniel de Rauglaudre, Michel Mauny:
Parsers in ML. 76-85 - Sho-Huan Simon Tung:
Interactive Modular Programming in Scheme. 86-95 - Flemming Nielson, Hanne Riis Nielson:
Finiteness Conditions for Fixed Point Iteration. 96-108 - Tyng-Ruey Chuang, Benjamin Goldberg:
A Syntactic Approach to Fixed Point Computation on Finite Domains. 109-118 - Robert Muller, Yuli Zhou:
Abstract Interpretation in Weak Powerdomains. 119-126 - Marc Neuberger, Prateek Mishra:
A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysis. 127-138 - Jawahar Chirimar, Carl A. Gunter, Jon G. Riecke:
Proving Memory Management Invariants for a Language Based on Linear Logic. 139-150 - Mitchell Wand, Dino Oliva:
Proving the Correctness of Storage Representations. 151-160 - Val Tannen, Ramesh Subrahmanyam:
On Extending Computational Adequacy by Data Abstraction. 161-169 - Kung Chen, Paul Hudak, Martin Odersky:
Parametric Type Classes. 170-181 - Giuseppe Castagna, Giorgio Ghelli, Giuseppe Longo:
A Calculus for Overloaded Functions with Subtyping. 182-192 - Stefan Kaes:
Type Inference in the Presence of Overloading, Subtyping and Recursive Types. 193-204 - Fritz Henglein:
Global Tagging Optimization by Type Inference. 205-215 - Edward Wang, Paul N. Hilfinger:
Analysis of Recursive Types in Lisp-Like Languages. 216-225 - Guillermo Juan Rozas:
Taming the Y Operator. 226-234 - Robert A. MacLachlan:
The Python Compiler for CMU Common Lisp. 235-246 - John R. Rose, Hans Muller:
Integrating the Scheme and C Languages. 247-259 - Wade Henessey:
WCL: Delivering Efficient Common Lisp Applications Under Unix. 260-269 - Atsushi Nagasaka, Yoshihiro Shintani, Tanji Ito, Hiroshi Gomi, Junichi Takahashi:
Tachyon Common Lisp: An Efficient and Portable Implementation of CLtL2. 270-277 - Ana Bove, Laura Arbilla:
A Confluent Calculus of Macro Expansion and Evaluation. 278-287 - Amr Sabry
, Matthias Felleisen:
Reasoning About Programs in Continuation-Passing Style. 288-298 - Olivier Danvy, Julia L. Lawall:
Back to Direct Style II: First-Class Continuations. 299-310 - Lorenz Huelsbergen, James R. Larus:
Dynamic Program Parallelization. 311-323 - Kenneth R. Traub, David E. Culler, Klaus E. Schauser:
Global Analysis for Partitioning Non-Strict Programs into Sequential Threads. 324-334 - Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar:
Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. 335-344 - Suresh Jagannathan, James Philbin:
A Foundation for an Efficient Multi-Threaded Scheme System. 345-357
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-22 02:19 CEST 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:
