

Stop the war!
Остановите войну!
for scientists:


default search action
LISP and Functional Programming 1990: Nice, France
- Gilles Kahn:

Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990, Nice, France, 27-29 June 1990. ACM 1990, ISBN 0-89791-368-X
- Andrew P. Tolmach, Andrew W. Appel:

Debugging Standard ML Without Reverse Engineering. 1-12
- Pavel Curtis, James Rauen:

A Module System for Scheme. 13-19
- Mark A. Sheldon, David K. Gifford:

Static Dependent Types for First Class Modules. 20-29
- Luca Cardelli, Giuseppe Longo:

A Semantic Basis for Quest. 30-43
- Val Tannen, Carl A. Gunter, Andre Scedrov:

Computing with Coercions. 44-60
- Philip Wadler:

Comprehending Monads. 61-78
- Douglas Johnson:

Trap Architectures for Lisp Systems. 79-86
- Benjamin G. Zorn:

Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collection. 87-98
- Gregor Kiczales, Luis Rodriguez:

Efficient Method Dispatch in PCL. 99-105
- Chris Hanson:

Efficient Stack Allocation for Tail-Recursive Languages. 106-118
- Marc Feeley, James S. Miller:

A Parallel Virtual Machine for Efficient Scheme Compilation. 119-130
- Clifford Walinsky, Deb Banerjee:

A Functional Programming Language Compiler for Massively Parallel Computers. 131-138
- Andrew A. Berlin:

Partial Evaluation Applied to Numerical Computation. 139-150
- Olivier Danvy, Andrzej Filinski:

Abstracting Control. 151-160
- Dorai Sitaram, Matthias Felleisen:

Reasoning with Continuations II: Full Abstraction for Models of Control. 161-175
- Morry Katz, Daniel Weise:

Continuing into the Future: On the Interaction of Futures and First-Class Continuations. 176-184
- Eric Mohr, David A. Kranz, Robert H. Halstead Jr.:

Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs. 185-197
- Randy B. Osborne:

Speculative Computation in Multilisp. 198-208
- J.-F. Giorgi, Daniel Le Métayer:

Continuation-Based Parallel Implementation of Functional Programming Languages. 209-217
- Henry G. Baker:

Unify and Conquer. 218-226
- Geoffrey Livingston Burn:

Using Projection Analysis of Evaluation-Order and Its Application. 227-240
- M. Draghicescu, S. Purushothaman:

A Compositional Analysis of Evaluation-Order and Its Application. 242-250
- Hanne Riis Nielson, Flemming Nielson:

Context Information for Lazy Code Generation. 251-263
- Charles Consel:

Binding Time Analysis for High Order Untyped Functional Languages. 264-272
- Laurence Puel, Ascánder Suárez:

Compiling Pattern Matching by Term Decomposition. 273-281
- Carsten K. Gomard:

Partial Type Inference for Untyped Functional Programs. 282-287
- Daniel Leivant:

Discrete Polymorphism. 288-297
- Brian T. Howard, John C. Mitchell:

Operational and Axiomatic Semantics of PCF. 298-306
- John Field, Tim Teitelbaum:

Incremental Reduction in the lambda Calculus. 307-322
- John Hannan, Dale Miller

:
From Operational Semantics to Abstract Machines: Preliminary Results. 323-332
- Pierre Crégut:

An Abstract Machine for Lambda-Terms Normalization. 333-340
- Gopalan Nadathur, Debra Sue Wilson:

A Representation of Lambda Terms Suitable for Operations on Their Intensions. 341-348

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.

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID
















