default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. FPCA 1993: Copenhagen, Denmark
- John Williams:
Proceedings of the conference on Functional programming languages and computer architecture, FPCA 1993, Copenhagen, Denmark, June 9-11, 1993. ACM 1993, ISBN 0-89791-595-X - Rex L. Page, Brian D. Moe:
Experience with a Large Scientific Application in a Functional Language. 3-11 - Philip W. Grant, John A. Sharp, Michael F. Webster, Xiaoming Zhang:
Some Issues in a Functional Implementation of a Finite Element Algorithm. 12-17 - Yasuo Kozato, G. Paul Otto:
Benchmarking Real-Life Image Processing Programs in Lazy Functional Languages. 18-30 - Alexander Aiken, Edward L. Wimmers:
Type Inclusion Constraints and Type Inference. 31-41 - David J. Lillie:
Conjunctive Subtyping. 42-51 - Mark P. Jones:
A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism. 52-64 - Lennart Augustsson:
Implementing Haskell Overloading. 65-73 - Shail Aditya, Alejandro Caro:
Compiler-directed Type Reconstruction for Polymorphic Languages. 74-82 - Annika Aasa:
Precedences for Conctypes. 83-94 - James Hicks:
Experiences with Compiler-Directed Storage Reclamation. 95-105 - Patrick M. Sansom, Simon L. Peyton Jones:
Generational Garbage Collection for Haskell. 106-116 - Jan Sparud:
Fixing Some Space Leaks without a Garbage Collector. 117-124 - Luc Moreau
, Daniel Ribbens:
Sound Rules for Parallel Evaluation of a Functional Language with callcc. 125-135 - Andrew D. Gordon:
An Operational Semantics for I/O in a Lazy Functional Language. 136-145 - Jon G. Riecke:
Delimiting the Scope of Effects. 146-158 - Lucas Roh, Walid A. Najjar, A. P. Wim Böhm:
Generation and Quantitative Evaluation of Dataflow Clusters. 159-168 - Boon Seong Ang:
Efficient Implementation of Sequential Loops in Dataflow Computation. 169-178 - Marc Feeley:
Polling Efficiently on Stock Hardware. 179-190 - Dave Cattrall, Colin Runciman:
Widening the Representation Bottleneck: A Functional Implementation of Relational Programming. 191-200 - Feixiong Liu:
Towards Lazy Evaluation, Sharing and Non-determinism in Resolution Based Functional Logic Languages. 201-209 - Per Hammarlund, Björn Lisper:
On the Relation between Functional and Data Parallel Programming Languages. 210-222 - Andrew John Gill, John Launchbury, Simon L. Peyton Jones:
A Short Cut to Deforestation. 223-232 - Tim Sheard, Leonidas Fegaras:
A Fold for All Seasons. 233-242 - Nobuko Yoshida:
Optimal Reduction in Weak-λ-calculus with Shared Environments. 243-254 - Eric Nöcker:
Strictness Analysis using Abstract Reduction. 255-265 - A. V. S. Sastry, William D. Clinger, Zena M. Ariola:
Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates. 266-275 - S. Purushothaman, Jill Seaman:
From Operational Definitions to Abstract Semantics. 276-288 - Tyng-Ruey Chuang, Benjamin Goldberg:
Real-Time Deques, Multihead Thring Machines, and Purely Functional Programming. 289-298 - Herbert Kuchen, Katia Gladitz:
Parallel Implementation of Bags. 299-307 - Anders Bondorf, Jens Palsberg:
Compiling Actions by Partial Evaluation. 308-320 - Mats Carlsson, Thomas Hallgren:
FUDGETS: A Graphical User Interface in a Lazy Functional Language. 321-330 - Sigbjørn Finne, Geoffrey Livingston Burn:
Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine. 331-340 - Pieter H. Hartel, Koen Langendoen:
Benchmarking Implementations of Lazy Functional Languages. 341-349
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 2026-08-03 00:13 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
