default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFPCA 1991: Cambridge, MA, USA
- John Hughes:
Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings. Lecture Notes in Computer Science 523, Springer 1991, ISBN 3-540-54396-1 - Tobias Nipkow
, Gregor Snelting:
Type Classes and Overloading Resolution via Order-Sorted Unification. 1-14 - Dennis M. Volpano, Geoffrey S. Smith:
On the Complexity of ML Typability with Overloading. 15-28 - Satish R. Thatte:
Coercive Type Isomorphism. 29-49 - Klaus E. Schauser, David E. Culler, Thorsten von Eicken:
Compiler-Controlled Multithreading for Lenient Parallel Languages. 50-72 - Kenneth R. Traub:
Multi-thread Code Generation for Dataflow Architectures from Non-Strict Programs. 73-101 - Luc Maranget:
GAML: a Parallel Implementation of Lazy ML. 102-123 - Erik Meijer, Maarten M. Fokkinga, Ross Paterson:
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. 124-144 - John Launchbury:
A Strongly-Typed Self-Applicable Partial Evaluator. 145-164 - Daniel Weise, Roland Conybeare, Erik Ruf, Scott Seligman:
Automatic Online Partial Evaluation. 165-191 - Vipin Swarup, Uday S. Reddy, Evan Ireland:
Assignments for Applicative Languages. 192-214 - David Wakeling, Colin Runciman:
Linearity and Laziness. 215-240 - Pascal Fradet:
Syntactic Detection of Single-Threading Using Continuations. 241-258 - David J. Lillie, Peter G. Harrison:
A Projection Model of Types. 259-288 - Gudmund Skovbjerg Frandsen, Carl Sturtivant:
What is an Efficient Implementation of the \lambda-calculus? 289-312 - Harry G. Mairson:
Outline of a Proof Theory of Parametricity. 313-327 - Allen Leung, Prateek Mishra:
Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages. 328-351 - Thomas P. Jensen:
Strictness Analysis in Logical Form. 352-366 - Gebreselassie Baraki:
A Note on Abstract Interpretation of Polymorphic Functions. 367-378 - Shail Aditya, Rishiyur S. Nikhil:
Incremental Polymorphism. 379-405 - Xavier Leroy, Michel Mauny:
Dynamics in ML. 406-426 - Alexander Aiken, Brian R. Murphy:
Implementing Regular Tree Expressions. 427-447 - Fritz Henglein:
Efficient Type Inference for Higher-Order Binding-Time Analysis. 448-472 - Carsten Kehler Holst:
Finiteness Analysis. 473-495 - Charles Consel, Olivier Danvy:
For a Better Support of Static Data Flow. 496-519 - Tzi-cker Chiueh:
An Architectural Technique for Cache-level Garbage Collection. 520-537 - Paul S. Barth, Rishiyur S. Nikhil, Arvind:
M-Structures: Extending a Parallel, Non-strict, Functional Language with State. 538-568 - Michael L. Heytens, Rishiyur S. Nikhil:
List Comprehensions in Agna, A Parallel Persistant Object System. 569-591 - Sjaak Smetsers, Eric Nöcker, John H. G. van Groningen, Marinus J. Plasmeijer:
Generating Efficient Code for Lazy Functional Languages. 592-617 - John Hannan:
Making Abstract Machines Less Abstract. 618-635 - Simon L. Peyton Jones, John Launchbury:
Unboxed Values as First Class Citizens in a Non-Strict Functional Language. 636-666
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-11-01 22:18 CET 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:
