Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. FPCA 1995: La Jolla, CA, USA
- John Williams:
Proceedings of the seventh international conference on Functional programming languages and computer architecture, FPCA 1995, La Jolla, California, USA, June 25-28, 1995. ACM 1995, ISBN 0-89791-719-7
Session 1
- David N. Turner, Philip Wadler, Christian Mossin:
Once Upon a Type. 1-11 - Carl A. Gunter, Didier Rémy, Jon G. Riecke:
A Generalization of Exceptions and Control in ML-like Languages. 12-23 - Peter Thiemann:
Unboxed Values and Polymorphic Typing Revisited. 24-35
Session 2
- Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde:
Deriving Imperative Code from Functional Programs. 36-44 - Robin Sharp, Ole Rasmussen:
Using a Language of Functions and Relations for VLSI Specification. 45-54 - Massimo Marchiori:
The Functional Side of Logic Programming. 55-65
Session 3
- J. Gregory Morrisett, Matthias Felleisen, Robert Harper:
Abstract Models of Memory Management. 66-77 - Rajiv Mirani, Paul Hudak:
First-Class Schedules and Virtual Maps. 78-85 - Chris Okasaki:
Purely Functional Random-Access Lists. 86-95
Session 4
- J. M. E. Hyland, C.-H. Luke Ong
:
Pi-Calculus, Dialogue Games and PCF. 96-107 - John Hughes, Andrew Moran:
Making Choices Lazily. 108-119 - Mitchell Wand:
Compiler Correctness for Parallel Languages. 120-134
Session 5
- Martin Odersky, Philip Wadler, Martin Wehr:
A Second Look at Overloading. 135-146 - Mikael Rittri:
Dimension Inference Under Polymorphic Recursion. 147-159 - Mark P. Jones:
Simplifying and Improving Qualified Types. 160-169
Session 6
- Patrick Cousot, Radhia Cousot:
Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation. 170-181 - Alexander Aiken, Manuel Fähndrich:
Dynamic Typing and Subtype Inference. 182-191 - Fritz Henglein, Jakob Rehof:
Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML. 192-203
Session 7
- Shail Aditya, Arvind, Joseph E. Stoy:
Semantics of Barriers in a Non-Strict, Implicitly-Parallel Language. 204-215 - Klaus E. Schauser, Seth Copen Goldstein:
How Much Non-Strictness do Lenient Programs Require? 216-225 - Guy E. Blelloch, John Greiner:
Parallelism in Sequential Functional Languages. 226-237
Session 8
- Johan Jeuring:
Polytypic Pattern Matching. 238-248 - Malcolm Wallace, Colin Runciman:
Lambdas in the Liftshaft - Functional Programming and an Embedded Architecture. 249-258 - Johan Jeuring, S. Doaitse Swierstra:
Constructing Functional Programs for Grammar Analysis Problems. 259-269
Session 9
- Urban Boquist:
Interprocedural Register Allocation for Lazy Functional Languages. 270-281 - Niklas Röjemo:
Highlights from nhc - a Space-efficient Haskell Compiler. 282-292 - Marcelo J. R. Gonçalves, Andrew W. Appel:
Cache Performance of Fast-Allocating Programs. 293-305
Session 10
- Akihiko Takano, Erik Meijer:
Shortcut Deforestation in Calculational Form. 306-313 - John Launchbury, Tim Sheard:
Warm Fusion: Deriving Build-Cata's from Recursive Definitions. 314-323 - Erik Meijer, Graham Hutton:
Bananas in Space: Extending Fold and Unfold to Exponential Types. 324-333
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 2023-06-09 20:46 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:
