From stg@dcs.ed.ac.uk Thu Feb 3 17:56:47 EST 1994 Article: 9549 of comp.lang.prolog Xref: glinda.oz.cs.cmu.edu comp.lang.prolog:9549 Newsgroups: comp.lang.prolog Path: honeydew.srv.cs.cmu.edu!fs7.ece.cmu.edu!europa.eng.gtefsd.com!howland.reston.ans.net!pipex!uknet!festival!dcs.ed.ac.uk!stg From: stg@dcs.ed.ac.uk (Stephen Gilmore) Subject: CfP: CAAP/ESoP/CC '94, Edinburgh, Scotland Message-ID: Sender: cnews@dcs.ed.ac.uk (UseNet News Admin) Organization: Laboratory for Foundations of Computer Science, Edinburgh U Distribution: comp Date: Thu, 3 Feb 1994 10:56:42 GMT Lines: 575 CALL FOR PARTICIPATION International Conference on Compiler Construction (CC'94) 7-9 April European Symposium on Programming (ESOP'94) 11-13 April Colloquium on Trees in Algebra and Programming (CAAP'94) 11-13 April Edinburgh, Scotland April 1994 Organised by Edinburgh University In cooperation with ACM SIGPLAN _____________________________________________________________________________ PROGRAMME International Conference on Compiler Construction Wednesday 6th April 18.00-21.00 CC REGISTRATION Thursday 7th April 9.00 - 10.00 Keynote talk: K.Nygaard (Univ. Oslo) The language designer: the implementor's friend or foe? 10.00 - 10.30 COFFEE BREAK CC - Session 1 Semantics Specification I 10.30 - 11.00 H. Moura & D. Watt (Univ. Glasgow) Action transformations in the ACTRESS compiler generator 11.00 - 11.30 P. Orbaek (Univ. Aarhus) OASIS: an optimizing action-based compiler generator 11.30 - 12.00 G. Hedin (Univ. Lund) An overview of door attribute grammars 12.00 - 12.30 G. Roussel, D. Parigot & M. Jourdan (INRIA, Rocquencourt) Coupling evaluators for attribute coupled grammars 12.30 - 14.00 LUNCH CC - Session 2 Functional Languages 14.00 - 14.30 M. Hanus (MPI Informatik, Saarbruecken) Towards the global optimization of functional logic programs 14.30 - 15.00 L. George (AT&T Bell Labs, Murray Hill), F. Guillaume (Ecole Normale Superieure, Paris) & J. Reppy (AT&T Bell Labs, Murray Hill) A portable and optimizing backend for the SML/NJ compiler 15.00 - 15.30 G. Hogen (RWTH, Aachen) & R. Loogen (Univ. Marburg) Efficient organization of control structures in distributed implementations 15.30 - 16.00 Y. Ben-Asher (Univ. Haifa), G. Ruenger, R. Wilhelm (Univ. Saarlandes, Saarbruecken) & A. Schuster (Technion, Haifa) Implementing 2DT on a multiprocessor 16.00 Posters - Demonstrations - Buffet Friday 8th April CC - Session 3 Optimization I 9.00 - 9.30 A. Fauth, G. Hommel, C. Mueller (TU Berlin) & A. Knoll (Univ. Bielefeld) Global code selection for directed acyclic graphs 9.30 - 10.00 A. Slowik, G. Piepenbrock & P. Pfahler (Univ.-GH Paderborn) Compiling nested loops for limited connectivity VLIWs 10.00 - 10.30 M.A. Ertl & A. Krall (TU Vienna) Delayed exceptions: speculative execution of trapping instructions 10.30 - 11.00 COFFEE BREAK CC - Session 4 Static Analysis & Abstract Interpretation 11.00 - 11.30 G. Janssens & W. Simoens (Katholieke Univ. Leuven) On the implementation of abstract interpretation systems for (constraint) logic programming 11.30 - 12.00 T. Cheatham, H. Gao & D. Stefanescu (Harvard Univ. & Software Options Inc., Cambridge) A suite of analysis tools based on a general purpose abstract interpreter 12.00 - 12.30 J. Uhl & R.N. Horspool (Univ. Victoria) Flow grammars: a flow analysis methodology 12.30-14.00 LUNCH CC - Session 5 Semantics Specification II 14.00 - 14.30 R. Laemmel & G. Riedewald (Univ. Rostock) Provable correctness of prototype interpreters in LDL 14.30 - 15.00 A. Poetzsch-Heffter (TU Munich) Developing efficient interpreters based on formal language specifications 15.00 - 15.30 J. Ringstrom, P. Fritzson & M. Pettersson (Univ. Linkoping) Generating an efficient compiler for a data parallel language 15.30 - 16.00 COFFEE BREAK CC - Session 6 Mixed 16.00 - 16.30 T. Parr (Univ. Minnesota) & R. Quong (Purdue Univ.) Adding semantic and syntactic predicates to LL(k): pred-LL(k) 16.30 - 17.00 M. Alt (Univ. Saarlandes, Saarbruecken), U. Assmann (GMD Karlsruhe) & H. van Someren (ACE Associated Computer Experts bv) Cosy compiler phase embedding with the CoSy compiler model 17.00 - 17.30 M. Fraenzle & M. Mueller-Olm (Univ. Kiel) Towards provably correct code generation for a hard real-time programming language 19.30 CONFERENCE DINNER Saturday 9th April CC - Session 7 Parallelization 9.00 - 9.30 J. Hendren & L. Hendren (McGill University, Montreal) Supporting array dependence testing for an optimizing/ parallelizing C compiler 9.30 - 10.00 S. Benkner, P. Brezany & H. Zima (Univ. Vienna) Processing array statements and procedure interfaces 10.00 - 10.30 P. Pineo & M.L. Soffa (Univ. Pittsburgh) A practical approach to the symbolic debugging of parallelized code 10.30 - 11.00 COFFEE BREAK CC - Session 8 Data-flow Analysis 11.00 - 11.30 E. Duesterwald, R. Gupta & M.L. Soffa (Univ. Pittsburgh) Reducing the cost of data flow analysis by congruence partitioning 11.30 - 12.00 D. Binkley (Loyola College, Baltimore) Interprocedural constant propagation using dependence graphs and a data-flow model 12.00 - 12.30 T. Reps (Univ. Copenhagen) Solving demand versions of interprocedural analysis problems 12.30-14.00 LUNCH CC - Session 9 Optimization II 14.00 - 14.30 A. Mendlson (Technion, Haifa), R. Shtokhamer (Univ. Delaware, Newark) & S. Pinter (Technion, Haifa) Compile time instruction cache optimizations 14.30 - 15.00 U. Mahadevan & S. Ramakrishnan (Hewlett Packard) Instruction scheduling over regions: a framework for scheduling in basic blocks 15.00 - 15.30 J. Hoogerbrugge & H. Corporaal (Delft Univ. of Technology) Transport-triggering vs. operation-triggering 15.30 COFFEE ______________________________________________________________________________ PROGRAMME European Symposium on Programming Colloquium on Trees in Algebra and Programming Sunday 10th April 18.00-21.00 REGISTRATION Monday 11th April 9.00-10.00 CAAP Invited lecture: J. Engelfriet (Univ. Leiden) Graph grammars and tree grammars 10.00-10.30 ESOP S. Cicerone & F. Parisi Presicce (Univ. L'Aquila) Strategies in modular system design by interface rewriting 10.30-11.00 COFFEE BREAK 11.00-11.30 CAAP N. Klarlund & M. Schwartzbach (Univ. Aarhus) Graphs and decidable transductions based on edge constraints ESOP C. Hankin (Imperial College, London) & D. Le Metayer (INRIA/IRISA, Rennes) Lazy type inference for the strictness analysis of lists 11.30-12.00 CAAP F. Drewes (Univ. Bremen) A lower bound on the growth of functions computed by tree transductions ESOP M. Sorensen, R. Gluck & N. Jones (Univ. Copenhagen) Towards unifying deforestation, supercompilation, partial evaluation and generalized partial computation 12.00-12.30 CAAP D. Hofbauer (Univ. Berlin), M. Huber & G. Kucherov (CRIN, Nancy) Some results on top-context-free tree languages ESOP A. King (Univ. Southampton) A synergistic analysis for sharing and groundness which traces linearity 12.30-14.00 LUNCH 14.00-14.30 CAAP D. Kuske (Univ. Essen) Nondeterministic automata with concurrence relations and domains ESOP J. Andrews (Simon Fraser Univ., Vancouver) Foundational issues in implementing constraint logic programming systems 14.30-15.00 CAAP D. Peled (AT&T Bell Labs, Murray Hill) On projective and separable properties ESOP A. Di Pierro (Univ. Pisa) & C. Palamidessi (Univ. Genoa) A logical denotational semantics for constraint logic programming 15.00-15.30 CAAP J. Esperaza (Univ. Edinburgh) On the decidability of model checking for several mu-calculi and Petri nets ESOP A. Mueck, T. Streicher (Univ. Munich) & H. Lock (IBM Heidelberg) A tiny constraint functional logic language and its continuation semantics 15.30-16.00 COFFEE BREAK 16.00-16.30 CAAP R. Heckmann (Univ. Saarlandes, Saarbruecken) Abstract probabilistic domains ESOP R. Giegerich & S. Kurtz (Univ. Bielefeld) Suffix trees in the functional programming paradigm 16.30-17.00 CAAP F. Alessi (Univ. Udine) Elementary type structures ESOP J. Jeuring and D. Swierstra (Univ. Utrecht) Bottom-up grammar analysis: a functional formulation 17.00-17.30 CAAP E. Ohleblush (Univ. Bielefeld) On the modularity of confluence of constructor-sharing term rewriting systems ESOP M.-M. Corsini & A. Rauzy (Univ. Bordeaux) Symbolic model checking and constraint logic programming: a cross fertilization 17.30-18.00 ESOP B. Li (Univ. Pennsylvania, Philadelphia) A pi-calculus specification of Prolog Tuesday 12th April 9.00-10.00 ESOP Invited lecture: M. Abadi & L. Cardelli (DEC, Palo Alto) A theory of primitive objects: second-order systems 10.00-10.30 ESOP D. Walker (Univ. Warwick) Algebraic proofs of properties of objects 10.30-11.00 COFFEE BREAK 11.00-11.30 CAAP O. Rambow (Univ. Pennsylvania, Philadelphia) & G. Satta (Univ. Venice) A rank hierarchy for deterministic tree-walking transducers ESOP K.V.S. Prasad (Chalmers Univ. of Technology, Gothenburg) Broadcasting with priority 11.30-12.00 CAAP R. Giancarlo & F. Mignosi (Univ. Palermo) Generalizations of the periodicity theorem of Fine and Wilf ESOP H. Andersen & M. Mendler (Technical Univ. Denmark, Lyngby) A process algebra with multiple clocks 12.00-12.30 CAAP B. Ratoandromanana & D. Robillard (Univ. Lille) Superposition in picture languages ESOP B. Berthomieu (LAAS, Toulouse) & T. Le Sergent (Univ. Edinburgh) Programming with behaviors in an ML framework: the syntax and semantics of LCS 12.30-14.00 LUNCH 14.00-1500 CAAP Invited lecture: H. Comon (Univ. Paris XI, Orsay) Ordering constraints on trees 15.00-15.30 ESOP M. Hanus (MPI Informatik, Saarbruecken) Lazy unification with simplification 15.30-16.00 COFFEE BREAK 16.00-16.30 ESOP A. Kennedy (Univ. Cambridge) Dimension types 16.30-17.00 ESOP C.B. Jay (Univ. of Technology, Sydney) & J. Cockett (Univ. Calgary) Shapely types and shape polymorphism 17.00-17.30 ESOP P. O'Hearn (Syracuse Univ.) & J. Riecke (AT&T Bell Labs, Murray Hill) Fully abstract translations and parametric polymorphism 17.30-18.00 ESOP M. Bidoit (LIENS, Paris), R. Hennicker & M. Wirsing (Univ. Munich) Characterizing behavioural semantics and abstractor semantics 19.30 CONFERENCE DINNER Wednesday 13th April 9.00-10.00 ESOP Invited lecture: R. Milner (Univ. Edinburgh) PI nets: the pi-calculus in pictures 10.00-10.30 ESOP W. Li (Beijing Univ. of Aeronautics & Astronautics) A logical framework for evolution of specifications 10.30-11.00 COFFEE BREAK 11.00-11.30 CAAP M. Sorensen (Univ. Copenhagen) A grammar-based data-flow analysis to stop deforestation ESOP L. Moreau (Univ. Liege) The PCKS-machine: an abstract machine for sound evaluation of parallel functional programs with first-class continuations 11.30-12.00 CAAP T. Noll (RWTH, Aachen) On the first-order equivalence of call-by-name and call-by-value ESOP P. Fradet (INRIA/IRISA, Rennes) Compilation of head and strong reduction 12.00-12.30 CAAP J. Palsberg (Northeastern Univ., Boston) Global program analysis in constraint form ESOP C. Boehm, A. Piperno (Univ. Rome) & S. Guerrini (Univ. Pisa) Functional programming: the rescue of normal forms 12.30-14.00 LUNCH 14.00-14.30 CAAP D. Merlini, R. Sprugnoli & M. Verri (Univ. Florence) Algebraic and combinatorial properties of simple, coloured walks ESOP S. Kahrs (Univ. Edinburgh) First-class polymorphism for ML 14.30-15.00 CAAP Y. Metiver and N. Saheb (Univ. Bordeaux) Probabilistic analysis of an election algorithm in a tree ESOP C. Hall, K. Hammond, S. Peyton Jones & P. Wadler (Univ. Glasgow) Type classes in Haskell 15.00-15.30 CAAP A. Cournier & M. Habib (LIRMM, Montpellier) A linear algorithm to build modular decomposition trees ESOP D. MacQueen (AT&T Bell Labs, Murray Hill) & M. Tofte (Univ. Copenhagen) A semantics for higher-order functors 15.30-16.00 COFFEE BREAK 16.00-16.30 CAAP P. Bruscoli, F. Levi, G. Levi & M. Meo (Univ. Pisa) Compilative constructive negation in constraint logic programs ESOP L. Boerio (Univ. Turin) Extending pruning techniques to polymorphic second order lambda-calculus 16.30-17.00 CAAP Z. Khasidashvili (Univ. East Anglia, Norwich) Higher order recursive program schemes are Turing incomplete ESOP K.-H. Buth (Univ. Kiel) Simulation of transition systems with term rewriting systems 17.00-17.30 CAAP P. de Groote (CRIN, Nancy) A CPS-translation of the lambda-mu-calculus ESOP F. Henglein & C. Mossin (Univ. Copenhagen) Polymorphic binding-time analysis 17.30-18.00 ESOP T. Amtoft (Univ. Aarhus) Local type reconstruction by means of symbolic fixed point iteration _____________________________________________________________________________ VENUE The CAAP/ESOP/CC conferences will be hosted by the University of Edinburgh in April 1994. Organised by the Laboratory for Foundations of Computer Science, the conferences will be held in the James Clerk Maxwell Building at King's Buildings, the University's science campus, approximately 2 miles south of Edinburgh city centre. Accommodation is available through us at nearby student residences. Edinburgh, the capital of Scotland, and one of the world's most enchanting cities, is located in the East of Scotland on the Firth of Forth, about 400 miles north of London. It is well served by transport: hourly flights from London, and direct connections to many European cities; nearby Glasgow airport has connections from many US cities. Edinburgh offers numerous places of interest including Edinburgh Castle, one of Scotland's main attractions, beautiful old town houses, the Palace of Holyroodhouse, art galleries, museums, and the Royal Botanic Gardens. Most of these places are within walking distance of the city centre or are easily accessible with local buses. Weather in Scotland is in general unpredictable. Temperatures in spring can vary between 8C and 20C, and there is usually a light breeze. You are best advised to bring several layers of clothing which can be put on and taken off as required, and don't forget your umbrella! REGISTRATION The registration fee covers lunches, coffee breaks, conference dinner and proceedings which are to be published by Springer-Verlag in the Lecture Notes in Computer Science series. Student fees do not cover the conference dinner or the proceedings, but dinner tickets and extra copies of the proceedings will be available for purchase at the conference. The conferences take place in the James Clerk Maxwell Building, King's Buildings, University of Edinburgh. The registration desk is open the evening before each conference and at intervals during the conferences themselves. ACCOMMODATION We have arranged accommodation at a nearby university campus. Rooms are reserved for CC participants from 6th to 8th April 1994 and for CAAP/ESOP participants from 10th to 12th April 1994. It is possible to book rooms for the few days before and after these dates, and for the intervening day. Please note that the accommodation is basic student accommodation in single rooms. The accommodation was chosen because of its price and its convenient location near the conference site. Unfortunately we are unable to arrange alternative accommodation. If you do not want the accommodation we have reserved, you can make your own arrangements with Edinburgh hotels and bed & breakfast establishments. A list of such alternative accommodation is available by anonymous Internet ftp in the file /pub/dts/accommodation on ftp.dcs.ed.ac.uk A printout of this file is available from the address below. Contact point for Conference administration: CAAP/ESOP/CC'94 Laboratory for Foundations of Computer Science Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ SCOTLAND Telephone: +44 31 650 5132 Telefax: +44 31 667 7209 E-mail: tlc@lfcs.ed.ac.uk SATELLITE MEETINGS First International Workshop on Action Semantics Thursday 14 April 1994 Actions speak louder than words: Action Semantics is now being used in practical applications! This workshop will survey recent achievements, demonstrate tools, and coordinate projects. It is open to all. If you wish to attend, please contact Peter D. Mosses (pdmosses@daimi.aau.dk) by 28 February 1994. It is still possible to organise additional satellite meetings; contact George Cleland at the address below. DEMONSTRATIONS A number of academic and commercial systems will be demonstrated during the course of the conference. There is still space available and it may be possible to arrange for equipment for the demonstrations. Contact George Cleland at the address below. Note that a fee will be charged for commercial exhibitors. PUBLISHERS' EXHIBITIONS There will be an exhibition by publishers during the conference. Contact the address below for information about exhibiting. George Cleland, LFCS Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ SCOTLAND Telephone: +44 31 650 5199 Telefax: +44 31 667 7209 E-mail: george.cleland@lfcs.ed.ac.uk ______________________________________________________________________________ REGISTRATION FORM Return this form to: CAAP/ESOP/CC'94 Laboratory for Foundations of Computer Science Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ SCOTLAND Telephone: +44 31 650 5132 Telefax: +44 31 667 7209 E-mail: tlc@lfcs.ed.ac.uk Name: Address: Affiliation: Telephone: Telefax: E-mail: Dietary restrictions: Please check the relevant box. Early registration fee for CC 170 pounds [ ] Late registration fee for CC 200 pounds [ ] Student fee for CC 120 pounds [ ] Early registration fee for CAAP/ESOP 185 pounds [ ] Late registration fee for CAAP/ESOP 215 pounds [ ] Student fee for CAAP/ESOP 120 pounds [ ] Early registration fee for CC & CAAP/ESOP 325 pounds [ ] Late registration fee for CC & CAAP/ESOP 375 pounds [ ] Student fee for CC and CAAP/ESOP 200 pounds [ ] Payment enclosed: Registration: UK pounds ............ (from below): Accommodation: UK pounds ............ TOTAL UK Pounds ............ Early registration forms must be received by 28th February 1994. Student registrations must include proof of status (e.g. copy of identity card or letter from advisor or supervisor) All cancellations received before 27th March 1994 will incur an administration charge of 20 pounds plus any accommodation charges which are not recoverable. No refunds can be made for cancellations received after 27th March. PAYMENTS Registration fees and accommodation should be paid by Eurocheque (each single cheque not exceeding 100 pounds), cheque or bankdraft (in UK pounds drawn on a British bank) or travellers cheques in UK pounds. We cannot accept bank transfers, credit cards or cheques drawn on non-UK banks or in currencies other than UK pounds. All payments must be made in advance. _____________________________________________________________________________ ACCOMMODATION BOOKING FORM Accommodation cost per night: 19.00 pounds Student accommodation cost per night: 16.50 pounds Please check the boxes in the chart below for all the nights you require. --------------------------------------------------------- Before CC Monday 4th April [ ] Tuesday 5th April [ ] --------------------------------------------------------- CC Wednesday 6th April [ ] Thursday 7th April [ ] Friday 8th April [ ] --------------------------------------------------------- Weekend Saturday 9th April [ ] --------------------------------------------------------- CAAP/ESOP Sunday 10th April [ ] Monday 11th April [ ] Tuesday 12th April [ ] --------------------------------------------------------- After Wednesday 13th April [ ] Thursday 14th April [ ] --------------------------------------------------------- Other nights --------------------------------------------------------- Total number of nights: Cost: The accommodation will be at Moray House College of Education, Heriot Watt University. This is 5 minutes walk from King's Buildings, the site of the conferences. Note that all accommodation must be paid for in advance. Any form without the correct payment will be returned. Accommodation is limited, and applications will be dealt with in order of receipt. While we will do our best, accommodation cannot be guaranteed for applications received after 27th March 1994. Special arrangements may be possible for participants planning to bring partners or family. However accommodation of this sort is limited - please contact us early. Please note: all student reservations must include proof of status (e.g. copy of identity card or letter from advisor or supervisor).