Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. FPCA 1989: London, England
- Joseph E. Stoy:
Proceedings of the fourth international conference on Functional programming languages and computer architecture, FPCA 1989, London, UK, September 11-13, 1989. ACM 1989, ISBN 0-201-51389-7 - Sebastian Hunt
:
Frontiers and Open Sets in Abstract Interpretation. 1-13 - Torben Æ. Mogensen:
Separating Binding Times in Language Specifications. 14-25 - Adrienne G. Bloss:
Update Analysis and the Efficient Implementation of Functional Aggregates. 26-38 - Peter Sestoft:
Replacing Function Parameters by Global Variables. 39-53 - Simon B. Jones, Daniel Le Métayer:
Computer-Time Garbage Collection by Sharing Analysis. 54-74 - Kenneth R. Traub:
Compilation as Partitioning: A New Approach to Compiling Non-Strict Functional Languages. 75-88 - John Peterson:
Untagged Data in Tagged Environments: Choosing Optimal Representations at Compile Time. 89-99 - Guy Argo:
Improving the Three Instruction Machine. 100-115 - David R. Lester:
Stacklessness: Compiling Recursion for a Distributed Architecture. 116-128 - Hanne Riis Nielson, Flemming Nielson:
Transformations on Higher-Order Functions. 129-143 - Mads Rosendahl:
Automatic Complexity Analysis. 144-156 - Bror Bjerner, Sören Holmström:
A Composition Approach to Time Analysis of First Order Lazy Functional Programs. 157-165 - Colin Runciman, Ian Toyn:
Retrieving Re-Usable Software Components by Polymorphic Type. 166-173 - Mikael Rittri:
Using Types as Search Keys in Function Libraries. 174-183 - Simon L. Peyton Jones, Jon Salkild:
The Spineless Tagless G-Machine. 184-201 - Lennart Augustsson, Thomas Johnsson:
Parallel Graph Reduction with the <nu, G>-Machine. 202-213 - Lal George:
An Abstract Machine for Parallel Graph Reduction. 214-229 - Zena M. Ariola, Arvind:
P-TAC: A Parallel Intermediate Language. 230-242 - Shlomit Weiss, Ilan Y. Spillinger, Gabriel M. Silberman:
Architectural Improvements for Data-Driven VLSI Processing Arrays. 243-259 - Tsung-Min Kuo, Prateek Mishra:
Strictness Analysis: A New Perspective Based on Type Inference. 260-272 - Peter S. Canning, William R. Cook, Walter L. Hill, Walter G. Olthoff, John C. Mitchell:
F-Bounded Polymorphism for Object-Oriented Programming. 273-280 - Atsushi Ohori:
A Simple Semantics for ML Polymorphism. 281-292 - Mitchell Wand, Patrick O'Keefe:
On the Complexity of Type Inference with Coercion. 293-298 - Yukihide Takayama:
Extended Projection - New Method to Extract Efficient Programs from Constructive Proofs. 299-312 - Frank S. K. Silbermann, Bharat Jayaraman:
Set Abstraction in Functional and Logic Programming. 313-326 - Erik Ruf, Daniel Weise:
Nondeterminism and Unification in LogScheme: Integrating Logic and Functional Programming. 327-339 - F. Warren Burton:
Indeterminate Behavior with Determinate Semantics in Parallel Programs. 340-346 - Philip Wadler:
Theorems for Free! 347-359 - Michel Mauny:
Parsers and Printers as Stream Destructors and Constructors Embedded in Functional Languages. 360-370 - Andrew Dwelly:
Functions and Dynamic User Interfaces. 371-381 - Kavi Arya:
Processes in a Functional Animation System. 382-395
a service of 
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 2024-04-22 20:01 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:
