From reitz Tue Aug 16 09:40:13 1994 To: reitz@lirmm.fr Subject: Re: CFP: Functional Programming Languages and Computer Architecture (FPCA95) - comp.lang.functional #1819 Forwarding: Mail from 'Philippe REITZ ' dated: Tue, 16 Aug 1994 09:38:54 +0200 Status: R In article <329c24$gnf@sparky.sterling.com>, simonpj@dcs.gla.ac.uk (Professor Simon Peyton-Jones) writes: 7th Annual SIGPLAN/SIGARCH/WG2.8 Conference on Functional Programming Languages and Computer Architecture 1995 La Jolla, California, June 26-28, 1995 CALL FOR PAPERS The seventh conference on Functional Programming Languages and Computer Architectures will cover the design and theory of functional programming languages, their applications, and their implementations on both parallel and sequential architectures. Topics include (but are not limited to): language design, type theory, formal semantics; compilation techniques for sequential and parallel machines, compile-time analysis, optimisations, program transformations; partial evaluation; programming methods; generalisations of the functional programming paradigm for state, control, non-determinism, and parallelism; special-purpose functional languages and architectures; architectural and system support for storage management, for garbage collection, and for input/output in functional languages. Papers accepted for the conference must contain material not presented previously in any formal forum. Authors are also encouraged to submit papers showing how insights from functional programming can be applied to other areas in computer science; for example, the description and transformation of VLSI circuit specifications, the systematic derivation of systolic and data-parallel architectures and algorithms, and so on. Submissions will be judged on relevance, originality, significance, correctness, and clarity. Each paper should explain its contribution in both general and technical terms, identifying what has been accomplished, saying why it is significant, and comparing it with previous work. Authors should make every effort to make the technical content of their papers understandable to a broad audience. Authors should submit 14 copies of a full paper (up to 10 pages, typeset 10-point on 16-point spacing in two-column conference style format, printed double-sided if possible). In addition, each submission should be accompanied by electronic mail to fpca95@dcs.glasgow.ac.uk, with a single postal address and electronic mail address for communication, and complete title, author and affiliation information. For uniformity of submissions, a LaTeX style file is available by electronic mail request from fpca95@dcs.glasgow.ac.uk. The program chair will either reject or arbitrarily truncate all excessively long papers. Submissions must be received by December 31, 1994. Authors of accepted papers will be expected to sign a copyright release form. General Chair Program Chair ~~~~~~~~~~~~ ~~~~~~~~~~~~~ John Williams Simon Peyton Jones IBM Almaden Research Center Department of Computing Science 650 Harry Road Glasgow University San Jose, CA 95120-6099, USA G12 8QQ, Scotland +1-408-927-1888 +44-41-330-4500 williams@almaden.ibm.com simonpj@dcs.glasgow.ac.uk Program Committee ~~~~~~~~~~~~~~~~ Lennart Augustsson, Chalmers University Henry Baker, Nimble Inc Guy Blelloch, Carnegie Mellon University Wim Bohm, Colorado State University Andrew Gordon, University of Cambridge Pieter Hartel, University of Amsterdam Mark Jones, University of Nottingham John Launchbury, Oregon Graduate Institute Christian Lengauer, University of Passau Xavier Leroy, INRIA John Mitchell, Stanford University John O'Donnell, Glasgow University |> FPCA'95: SIGPLAN/SIGARCH/WG2.8 Conference on Functional |> Programming Languages and Computer Architecture June 25-28 |> |> |> ==== FPCA'95 =========================================================== |> |> |> FPCA '95 Conference Program |> |> Tutorial: 5:00pm - 6:30pm, Sunday 25 June |> |> Regularity => Parallelism |> Christian Lengauer (University of Passau) |> |> This tutorial will give an overview of a method for the |> parallelization of functional programs that correspond to nested |> do loops. The programs must fulfill certain regularity conditions. |> |> The method has the following properties: |> |> 1. It is static and automatic, i.e., it can be incorporated into |> a compiler. |> |> 2. It is based on a multi-dimensional geometric model in which |> individual computations are mapped to space-time. This makes |> the generation of target code with explicit parallel statements |> and communication commands easy. |> |> 3. It can generate maximal parallelism with respect to the data |> dependences in the program. |> |> 4. It gives the user (compiler) the ability to trade off time |> versus space, i.e., it can be targeted towards optimizing |> other performance aspects than the number of execution steps |> like the number of processors, the number of communication |> channels, the amount of communication, memory usage, etc. |> |> The method was invented for systolic array design and has recently |> been applied to parallelizing compilation. Its basis on functional |> specifications and recent advances in target code generation make it |> of interest to the functional programming community. |> |> Reception: 6:30-9:00, Sunday 25 June. Beverages only. |> |> Session 1: 9:00-10:30, Monday 26 June |> |> Once upon a type |> D. N. Turner (University of Glasgow), P. L. Wadler (University of Glasgow), |> and C. Mossin (University of Copenhagen) |> |> A generalization of exceptions and control in ML-like languages |> C. A. Gunter (University of Pennsylvania), D. Remy (INRIA Rocquencourt), |> and J. G. Riecke (AT&T Bell Labs) |> |> Unboxed values and polymorphic typing revisited |> P. J. Thiemann (Universitat Tubingen) |> |> Session 2: 11:00-12:30, Monday 26 June |> |> Deriving imperative code from functional programs |> P. Quinton (IRISA), S. Rajopadhye (IRISA and Oregon State University), |> and D. Wilde (Oregon State University) |> |> Using a language of functions and relations for VLSI specification |> R. Sharp and O. Rasmussen (Technical University of Denmark) |> |> The functional side of logic programming |> M. Marchiori (University of Padova) |> |> Session 3: 2:00-3:30, Monday 26 June |> |> Abstract models of memory management |> G. Morrisett (Carnegie Mellon University), M. Felleisen (Rice University), |> and R. Harper (Carnegie Mellon University) |> |> First-class schedules and virtual maps |> R. Mirani and P. Hudak (Yale University) |> |> Purely functional random-access lists |> C. Okasaki (Carnegie Mellon University) |> |> Session 4: 4:00-5:30, Monday 26 June |> |> Pi-calculus, dialogue games and full abstraction for PCF |> J. M. E. Hyland (University of Cambridge) and C. H. L. Ong |> (University of Oxford and National University of Singapore) |> |> Making choices lazily |> R. J. M. Hughes and A. Moran (Chalmers University of Technology) |> |> Compiler correctness for parallel languages |> M. Wand (Northeastern University) |> |> Session 5: 9:00-10:30, Tuesday 27 June |> |> A second look at overloading |> M. Odersky (Universitaet Karlsruhe), P. L. Wadler (University of Glasgow), |> and M. Wehr (Universitaet Karlsruhe) |> |> Dimension inference under polymorphic recursion |> M. Rittri (Chalmers University of Technology) |> |> Simplifying and improving qualified types |> M. P. Jones (University of Nottingham) |> |> Session 6: 11:00-12:30, Tuesday 27 June |> |> Formal language, grammar and set-constraint-based program analysis by |> abstract interpretation |> Patrick Cousot (Ecole Normale Superieure) |> and Radhia Cousot (CNRS & Ecole Polytechnique) |> |> Dynamic typing and subtype inference |> Alex Aiken and M. Fahndrich (University of California, Berkeley) |> |> Safe polymorphic type inference for a dynamically typed language: |> Translating Scheme to ML |> F. Henglein and J. Rehof (DIKU, University of Copenhagen) |> |> Session 7: 2:00-3:30, Tuesday 27 June |> |> Semantics of barriers in a non-strict, implicitly-parallel language |> S. Aditya (MIT), Arvind (MIT), and Joseph Stoy (Oxford University) |> |> How much non-strictness do lenient programs require? |> K. E. Schauser (University of California, Santa Barbara) |> and S. C. Goldstein (University of California, Berkeley) |> |> Parallelism in sequential functional languages |> G. Blelloch and J. Greiner (Carnegie Mellon University) |> |> Session 8: 4:00-5:30, Tuesday 27 June |> |> Polytypic pattern matching |> J. Jeuring (Chalmers University of Technology) |> |> Lambdas in the liftshaft: functional programming and |> an embedded architecture |> M. Wallace and C. Runciman (University of York) |> |> Constructing functional programs for grammar analysis problems |> J. Jeuring (Chalmers University of Technology) |> and D. Swierstra (Utrecht University) |> |> Session 9: 9:00-10:30, Wednesday 28 June |> |> Interprocedural register allocation for lazy functional languages |> U. Boquist (Chalmers University of Technology) |> |> Highlights from nhc - a space-efficient Haskell compiler |> N. Rojemo (Chalmers University of Technology) |> |> Cache performance of fast-allocating programs |> M. J. R. Goncalves and A. W. Appel (Princeton University) |> |> Session 10: 11:00-12:30, Wednesday 28 June |> |> Deforestation in calculational form |> A. Takano (Hitachi Advanced Research Lab) |> and E. Meijer (Utrecht University) |> |> Warm fusion |> J. Launchbury and T. Sheard (Oregon Graduate Institute) |> |> Bananas in space: extending fold and unfold to exponential types |> E. Meijer and G. Hutton (Utrecht University) |> |> |> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |> |> |> FPCA '95 Conference Committee |> |> General Chair: John Williams, IBM Almaden Research Center |> Treasurer and Local Arrangements: |> Dennis Volpano, Naval Postgraduate School |> Publicity: Peter Sestoft, Technical University of Denmark |> Exhibits: Fritz Henglein, DIKU, University of Copenhagen |> Program Chair: Simon Peyton Jones, Glasgow University |> |> Program Committee: |> Lennart Augustsson, Chalmers University |> Henry Baker, Nimble Inc |> Guy Blelloch, Carnegie Mellon University |> Wim Bohm, Colorado State University |> Andrew Gordon, University of Cambridge |> Pieter Hartel, University of Amsterdam |> Mark Jones, University of Nottingham |> John Launchbury, Oregon Graduate Institute |> Christian Lengauer, University of Passau |> Xavier Leroy, INRIA |> John Mitchell, Stanford University |> John O'Donnell, Glasgow University