February 1996 - Categories - categories.org.au

The announcement of ALGI3
by AKAMA Youji 01 Mar '96

01 Mar '96

PLEASE POST ** PLEASE POST ** PLEASE POST ** PLEASE POST ** PLEASE POST Preliminary Call for Participation The Third Seminar on Algebra, Logic, and Geometry in Informatics (ALGI 3) April 3-5, 1996 Keio University, Mita, Tokyo The ALGI (Algebra, Logic, and Geometry in Informatics) seminar is a series of informal peripatetic seminars in Japan (hopefully extending to other areas of Eastern Asia / Oceania) on the interaction between informatics and mathematics. Information about ALGI seminars can be found at "http://www.etl.go.jp:8080/People/yoshiki/ALGI-e.html". For the third meeting, watch "http://nicosia.is.s.u-tokyo.ac.jp/~akama/algi3.html". The third ALGI meeting will be held as one of the post-conference workshops of Linear Logic 96 (held at Keio University, organized by Prof. Mitsu OKADA). The scope of ALGI includes Linear Logic, but is not restricted to it. We expect offers of talks about informal, half-baked works, as well as completed ones. Participants should fill in the registration form below and send it to "akama(a)is.s.u-tokyo.ac.jp". The details of the meeting will be announced later in the same place. * Date: 3 April afternoon - 5 April. * Place: Keio University, Mita. * Program: To be decided. * Schedule 3 April: From some time in the afternoon. 4 April: From morning, Rest during 1330-1430, for van Dalen symposium being held meantime. 5 April: From morning. * For program/registration/hotel information for Linear Logic 96, see "http://abelard.flet.mita.keio.ac.jp/person/linear96/Linear96.html". The listing of hotels can be found at "http://abelard.flet.mita.keio.ac.jp/person/linear96/hotel.html". * Registration: Please send the registration form to Yohji AKAMA (akama(a)is.s.u-tokyo.jp) * General inquiry: Yohji AKAMA, Department of Information Science, The University of Tokyo, Hongoh, 7-3-1, Bunkyo-ku,Tokyo, 113, Japan. 03(3812)4177(direct), 03(3812)2111(ext.4097), 03(3818)1073(fax) akama(a)is.s.u-tokyo.ac.jp ===================================================================== ALGI Registration form Please use the following format: I intend to come to the 3rd meeting of the ALGI seminar. * I intend to give a talk entitled ......... * I will need approximately......minutes Name ....................................... Address .................................... ............................................ Email ..................................... Tel ..................................... Fax ..................................... *Delete if inapplicable Please inform us if you need anything else besides blackboard and OHP Please inform us (in)convenient day of your talk.

1 0

Paper available by ftp
by Robert A. G. Seely 28 Feb '96

28 Feb '96

The following paper is available via ftp or WWW browser, at the URLs given after the abstract. Categories for computation in context and unified logic: I by R.F. Blute, J.R.B. Cockett, and R.A.G. Seely Abstract In this paper we introduce the notion of contextual categories. These provide a categorical semantics for the modelling of computation in context, based on the idea of separating logical sequents into two zones, one representing the context over which the computation is occurring, the other the computation itself. The separation into zones is achieved via a bifunctor equipped with a tensorial strength. We show that a category with such a functor can be viewed as having an action on itself. With this interpretation, we obtain a fibration in which the base category consists of contexts, and the reindexing functors are used to change the context. We further observe that this structure also provides a framework for developing categorical semantics for Girard's Unified Logic, a key feature of which is to separate logical sequents into two zones, one in which formulas behave classically and one in which they behave linearly. This separation is analogous to the context/computation separation above, and is handled by our semantics in a similar fashion. Furthermore, our approach allows an analysis of the exponential structure of linear logic using a tensorially strong action as the primitive notion. We demonstrate that from such a structure one can recover a model of the linear storage operator. Finally, we introduce a sequent calculus for the fragment of Unified Logic modeled by contextual categories. We show cut elimination for this fragment, and we introduce a simple notion of proof circuit, which provides a description of free contextual categories. ----------------------------- Available via browser on my home page ftp://triples.math.mcgill.ca/pub/rags/ragstriples.html or directly via ftp ftp://triples.math.mcgill.ca/pub/rags/bang/context1.[ps,dvi].gz (The [X,Y] syntax means you should use either X or Y in the URL, not both and not the "[", "]".)

1 0

Enrichment and Representation Theorems for Domains.
by Marcelo Fiore 27 Feb '96

27 Feb '96

The prepint "Enrichment and Representation Theorems for Categories of Domains and Continuous Functions" is available from http://www.dcs.ed.ac.uk/home/mf files rep.dvi or rep.ps, or by anonymous ftp from ftp.dcs.ed.ac.uk directory pub/mf files rep.dvi or rep.ps. ----------------------------------------------------------------------- Enrichment and Representation Theorems for Categories of Domains and Continuous Functions Synopsis Domain-theoretic categories are axiomatised by means of categorical non-order-theoretic requirements on a cartesian closed category equipped with a commutative monad. We prove an enrichment theorem showing that every axiomatic domain-theoretic category can be endowed with an intensional notion of approximation, the path relation, with respect to which the category Cpo-enriches. Subsequently, we provide a representation theorem of the form: every small domain-theoretic category (with a lifting monad) has a full and faithful representation in a domain-theoretic category of cpos and continuous functions (with a lifting monad) in a suitable intuitionistic set theory. Our analysis suggests more liberal notions of domains. In particular, we present a category where the path order is not omega-complete, but in which the constructions of domain theory (as, for example, the existence of uniform fixed-point operators and the solution of domain equations) are possible. -----------------------------------------------------------------------

1 0

postdoc ad
by I. Moerdijk 22 Feb '96

22 Feb '96

Dear readers of the categories list: A postdoc position as described in the ad below will be available at our department. The description below is somewhat narrow, but I believe that any good candidate with background in algebraic topology will be considered.The starting date is negotiable, and January 1, 1997 could also be a possibility. If you are interested, or if you wish to suggest a candidate, please feel free to approach me directly by e-mail. Ieke Moerdijk. ---------------------------------------------------------- ---------------------------------------------------------- As of September 1996, there will be available a two year post doctoral position at the Mathematical Institute of the University of Utrecht. Holders of a Ph. D. degree in mathematics and those who will obtain such a degree before September 1996 are invited to apply. The positions are tied to a specific NWO (= Dutch Science Foundation) research project in topology, including the theory of foliations, orbifolds, equivariant cohomology, intersection cohomology (of related orbit spaces), C*-algebras and K-theory related to foliations, and related topics. The positions do not involve teaching. Applications should be sent before April 1, 1996, to the attention of the departmental secretary, K. Schoenmaker Mathematical Institute, University of Utrecht, P.O. Box 80.010, 3508 TA Utrecht, The Netherlands. Applications should include the usual items: a c.v., a brief description of past and current research and of the results obtained, a list of publications (if any), the names of mathematicians who will write letters of recommendation, and a research plan. Furthermore, at least two mathematicians must write a letter of recommendation to the address above, with the same deadline. ---------------------------------------------------------- ----------------------------------------------------------

1 0

RESEARCH FELLOWSHIP
by Zhaohui.Luo＠durham.ac.uk 21 Feb '96

21 Feb '96

Department of Computer Science University of Durham Research Fellowship in Type Theory and its Applications to Theorem Proving Applications are invited for a post-doctoral research fellowship funded under the UK EPSRC research project "Subtyping, inheritance and reuse: developing expressive type theory for formal analysis". The area of work is computer-assisted formal reasoning based on type theory. The project is to develop expressive type theories with subtyping and inheritance mechanisms to support structuring and reuse of formal theories and proofs. The theoretical research results will be incorporated into proof development systems such as Lego and used in application case studies. The research fellowship is for a period of three years and available from May 1996. The appointment will be on the AR1A scale (starting salary from 15,986 to 18,294 pounds per annum, according to experience). Candidates would normally be expected to have a PhD in computer science or mathematics, or equivalent experience. Experience or background in areas such as constructive type theory, type systems for programming languages, formal proof development, or implementation of theorem provers, is considered to be desirable, though not necessary. The successful candidate will be working in an active research group at Durham with interests in both theory and application. He or she is also expected to have a close collaboration with the theorem proving group led by Prof. Rod Burstall at LFCS, Edinburgh (a collaborating partner of the above project) and other related institutions in Europe. Further details of the research project and related information can be found from the WWW page "http://www.dur.ac.uk/~dcs0zl/sir.html". Applications should include a curriculum vitae and names of two referees with their addresses (and email addresses if available). Please send applications or enquiries to Dr Zhaohui Luo Dept of Computer Science The Science Laboratories South Road Durham DH1 3LE, U.K. email: Zhaohui.Luo(a)durham.ac.uk tel: +44-(0)191-3743657 fax: +44-(0)191-3742560

1 0

Research Position
by Matthew Hennessy 15 Feb '96

15 Feb '96

UNIVERSITY OF SUSSEX RESEARCH FELLOW IN THE FOUNDATIONS OF COMPUTING A Research Fellow is required for a 3-year project entitled ``Foundations for the Integration of Concurrent Distributed and Functional Computation'', under the direction of Prof. M. Hennessy and funded by the EPSRC. The aim of the project is to - provide a uniform coherent semantic foundation for concurrent, distributed and functional behaviour; - develop proof methodologies for establishing properties of process descriptions expressed in specification languages using these paradigms; - develop prototypes of supporting verification systems. The project will start on 1/4/96 and salary will be related to the academic 1A scale. A Ph.D. in Computer Science or Mathematics or equivalent experience is required. In addition to normal research duties the successful candidate will be expected to provide some assistance to undergraduate teaching. More details of the project and the conditions of service are available at ftp://ftp.cogs.sussex.ac.uk/pub/users/matthewh/details.ps To apply please submit electronic applications to matthewh(a)cogs.sussex.ac.uk Applications should include a detailed curriculum vitae, names of three referees with their email addresses.

1 0

Prolongation by zero (preprint)
by Anders Kock 15 Feb '96

15 Feb '96

The preprint "Locally closed sublocales and prolongation by zero" is available by anonymous ftp from theory.doc.ic.ac.uk/papers/Kock where it appears as the file: loc-clo.ps (it is about 150 kb). Abstract: We prove that abelian group valued sheaves over a locally closed sublocale admit prolongation by zero, and that the prolongation functor has a right adjoint. The method is by left exact comonads; specifically, it uses a version of Artin-Wraith glueing, where one has to put glue on _both_ the items to be glued.

1 0

Preprint (announcement)
by Anders Kock 14 Feb '96

14 Feb '96

The paper "Frame distributions, and support" by A. Kock and G.E,. Reyes is available by anonymous ftp : ftp://theory.doc.ic.ac.uk/papers/Kock where it appears as distr.ps.Z It is a slightly expanded version of the preprint with the same title, Universite de Montreal DMS No 386, janvier 1996. Abstract: We analyze in terms of constructive frame theory the relationship between support of distributions, regularization of opens, and "frame distributions" (sup lattice maps from a frame to the frame of truth values, as considered recently by Bunge and Funk).

1 0

CAAP/ESOP/CC Programme-Registration
by Helene Kirchner 13 Feb '96

13 Feb '96

CALL FOR PARTICIPATION European Symposium on Programming (ESOP'96) 22--24 April Colloquium on Trees in Algebra and Programming (CAAP'96) 22--24 April International Conference on Compiler Construction (CC'96) 24--26 April Linkvping Sweden April 1996 In cooperation with IFIP Note: Early registration deadline - March 15 CAAP/ESOP/CC PROGRAMME ======================= Sunday April 21 --------------- 17.00 - 21.00 REGISTRATION AND RECEPTION (at Frimurarehotellet) Monday April 22 --------------- 09.00 - 10.00 CA1 Invited speaker: S. Abramsky Semantics of interaction 10.00 - 10.30 E1 F. Bueno, D. Cabeza, M. Hermenegildo, G. Puebla Global Analysis of Standard Prolog Programs CA2 A. Bottreau, Y. Mitivier The Kronecker product and local computations in graphs 10.30 - 11.00 COFFEE BREAK 11.00 - 11.30 E2 H. Seidl Integer Constraints to Stop Deforestation CA3 M. Madonia, S. Varricchio Iterative pairs and multitape automata 11.30 - 12.00 E3 T. Jensen, I. Mackie Flow Analysis in the Geometry of Interaction CA4 A. Boudet, H. Comon Diophantine Equations, Presburger Arithmetic and Finite Automata 12.00 - 12.30 E4 R. Giacobazzi, F. Ranzato Compositional Optimization of Disjunctive Abstract Interpretations CA5 A. K|hnemann A pumping Lemma for Output Languages of Macro Tree Transducers 12.30 - 14.00 LUNCH 14.00 - 15.00 E5 C.B. Jones Some Practical Problems and their Influence on Semantics 15.00 - 15.30 E6 F. Maraninchi, N. Halbwachs Compositional Semantics of Non-deterministic Synchronous Languages CA6 D. Merlini, R. Sprugnoli, M.C. Verri The area determined by underdiagonal lattice paths 15.30 - 16.00 COFFEE BREAK 16.00 - 16.30 E7 R. Barbuti, P. Mancarella A Multiple-valued Logical Semantics for Prolog CA7 Y. Takayama Extraction of Concurrent Processes from Higher Dimensional Automata 16.30 - 17.00 E8 M. Alpuente, M. Falaschi, G. Vidal Narrowing-driven Partial Evaluation of Functional Logic Programs CA8 R. Kaivola Axiomatising Extended Computation Tree Logic 17.00 - 17.30 E9 D. Bechet Removing Value Encoding using Alternative Values in Partial Evaluation of Strongly-Typed Languages CA9 M. Lenisa Final Semantics for a Higher Order Concurrent Language Tuesday April 23 ---------------- 09.00 - 10.00 CA10 F. Pfenning The practice of logical framework 10.00 - 10.30 E10 E. Goubault Durations for Truly-concurrent Transitions CA11 L. Bachmair, T. Chen, C.R. Ramakrishnan, I.V. Ramakrishnan Subsumption Algorithms Based on Search Trees 10.30 - 11.00 COFFEE BREAK 11.00 - 11.30 E11 K. Stxlen Assumption/Commitment Rules for Data-flow Networks - with an Emphasis on Completeness CA12 M. Fernandez, I. Mackie Interaction Nets and Term Rewriting Systems 11.30 - 12.00 E12 S. Melzer, J. Esparza Checking System Properties via Integer Programming CA13 B. Lisper Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations 12.00 - 12.30 E13 U. Montanari, M. Pistore, D. Yankelevich Efficient Minimization up to Location Equivalence CA14 J. Glauert, Z. Khasidashvili Relative Normalization in Deterministic Residual Structures 12.30 - 14.00 LUNCH 14.00 - 14.30 E14 G. Smith, D. Volpano Towards an ML-style Polymorphic Type System for C CA15 T. Arts Termination by absence of infinite chains of dependency pairs 14.30 - 15.00 E15 P. Fradet, R. Gaugne, D. Le Mitayer Static Detection of Pointer Errors: an Axiomatisation and a Checking Algorithm CA16 B. Gramlich Confluence without Termination via Parallel Critical Pairs 15.00 - 15.30 E16 E. Rohwedder, F. Pfenning Mode and Termination Checking for Higher-Order Logic Programs CA17 E.A. Cichon, H. Touzet An Ordinal Calculus for Proving Termination in Term Rewriting 15.30 - 16.00 COFFEE BREAK 16.00 - 16.30 E17 J. Palsberg, B. Patt-Shamir, K. Lieberherr A New Approach to Compiling Adaptive Programs CA18 M. Bidoit, A. Tarlecki Behavioural satisfaction and equivalence in concrete model categories 16.30 - 17.00 E18 S. Liang, P. Hudak Modular Denotational Semantics for Compiler Construction CA19 A. Cheng, M. Nielsen Open Maps, Behavioural Equivalences, and Congruences 17.00 - 17.30 E19 E. Rose Linear Time Hierarchies for a Functional Language Machine Model CA20 A. Rensink Denotational, Causal and Operational Determinism in Event Structures 17.30 - 18.00 E20 M. Thuni, K. Ehlander Towards an expressive language for PDE solvers 19.00 CONFERENCE DINNER Wednesday April 24 ------------------ 09.00 - 10.00 E21 Invited speaker: S.L. Peyton Jones Compiling Haskell by Transformation 10.00 - 10.30 E22 J. Launchbury, R. Paterson Parametricity and Unboxing with Unpointed Types CC1 G. Riedewald CC conferences - the first decade 10.30 - 11.00 COFFEE BREAK 11.00 - 11.30 E23 J.C. Gonzalez-Moreno, M.T. Hortala-Gonzalez, F.J. Lspez-Fraguas, M. Rodrmguez-Artalejo A Rewriting Logic for Declarative Programming CC2 J. Wang, G.R. Gao Pipelining-Dovetailing: A Transformation to Enhance Software Pipelining Performance for Nested Loops 11.30 - 12.00 E24 J.A. Bergstra, T.B. Dinesh, J. Field, J. Heering A Complete Transformational Toolkit for Compilers CC3 P. Pfahler, G. Piepenbrock A Comparison of Modulo Scheduling Techniques for Software Pipelining 12.00 - 12.30 E25 S. van Bakel, F. Barbanera, M. Fernandez Rewrite Systems with Abstraction and beta-rule: Types, Approximants and Normalization CC4 M.A. Ertl, A. Krall Removing Anti Dependences by Repairing 12.30 - 14.00 LUNCH 14.00 - 14.30 CA21 M.H. Sxrensen Effective Longest and Infinite Reduction Paths in Untyped lambda-Calculi CC5 J. Janssen Controlled Node Splitting 14.30 - 15.00 CA22 G. Boudol, C. Lavatelli Full abstraction for lambda calculus with resources and convergence testing CC6 J.W. Davidson, S. Jinturkar Aggressive loop unrolling in a retargetable, optimizing compiler 15.00 - 15.30 CA23 J. Tiuryn, M. Wand Untyped Lambda-Calculus with Input-Output CC7 C. Verbrugge, P. Co, L.J. Hendren Generalized Constant Propagation: A Study in C 15.30 - 16.00 COFFEE BREAK 16.00 - 16.30 CC8 C. Cifuentes Structuring Decompiled Graphs 16.30 - 17.00 CC9 A. Geser, J. Knoop, G. Luttgen, O. Ruthing, B. Steffen Non-monotone Fixpoint Iterations to resolve Second Order Effects 17.00 - 17.30 CC10 U. Assmann How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems 17.30 - 18.00 CC11 B. Steensgaard Points-to Analysis by Type Inference of Programs with Structures and Unions 19.00 DEMO SESSION AND BUFFET (at the Department of Computer and Information Science) Thursday April 25 ----------------- 09.00 - 10.00 CC12 Invited speaker: W. Waite Compiler Construction: Craftsmanship or Engineering? 10.00 - 10.30 CC13 A. Nymeyer, J-P. Katoen, Y. Westra, H. Alblas Code Generation = A* + BURS 10.30 - 11.00 COFFEE BREAK 11.00 - 11.30 CC14 M. Pettersson A Compiler for Natural Semantics 11.30 - 12.00 CC15 D. Boucher, M. Feeley Abstract compilation: a new implementation paradigm for static analysis 12.00 - 12.30 CC16 D.J. Salomon Using Partial Evaluation in Support of Portability, Reusability, and Maintainability 12.30 - 14.00 LUNCH 14.00 - 14.30 CC17 J-D. Choi, V. Sarkar, E. Schonberg Incremental Computation of Static Single Assignment Form 14.30 - 15.00 CC18 Z. Li, C. Kirkham Efficient Storage Reuse of Aggregates in Single Assignment Languages 15.00 - 15.30 CC19 F. Chow, S. Chan, S-M. Liu, R. Lo, M. Streich Effective Representation of Aliases and Indirect Memory Operations in SSA Form 15.30 - 16.00 COFFEE BREAK 16.00 - 18.00 POSTER SESSION 19.00 CONFERENCE DINNER Friday April 26 --------------- 09.00 - 09.30 CC20 B.M. Kadhim, W.M. Waite Maptool - Supporting Incremental Syntax Development 09.30 - 10.00 CC21 P. McLean, R.N. Horspool A faster Earley Parser 10.00 - 10.30 CC22 T.A. Proebsting, B.R. Whaley One-Pass, Optimal Tree Parsing - With Or Without Trees 10.30 - 11.00 COFFEE BREAK 11.00 - 11.30 CC23 J. Vitek, R.N. Horspool Compact Dispatch Tables for Dynamically Typed Object Oriented Languages 11.30 - 12.00 CC24 J. Bosch Delegating Compiler Objects - An Object-Oriented Approach to Crafting Compilers 12.00 - 12.30 CC25 P. Fritzson, R. Wism|ller, O. Hansen, J. Sala, P. Skov A Parallel Debugger with Support for Distributed Arrays, Multiple Executables, and Dynamic Processes Please see the separate description for the Friday afternoon satellite meetings. Quick Overview -------------- +----------------------------------------------------+ | Mon | Tue | Wed | Thu | Fri | |----------------------------------------------------| 09.00 - | CA1 | CA10 | E21 | CC12 | CC20 | 09.30 - | - " - | - " - | - " - | - " - | CC21 | 10.00 - | E1 CA2 | E10 CA11 | E22 CC1 | CC13 | CC22 | 10.30 - | COFFEE BREAK | 11.00 - | E2 CA3 | E11 CA12 | E23 CC2 | CC14 | CC23 | 11.30 - | E3 CA4 | E12 CA13 | E24 CC3 | CC15 | CC24 | 12.00 - | E4 CA5 | E13 CA14 | E25 CC4 | CC16 | CC25 | 12.30 - | LUNCH |--------+ 14.00 - | E5 | E14 CA15 | CA21 CC5 | CC17 | 14.30 - | - " - | E15 CA16 | CA22 CC6 | CC18 | 15.00 - | E6 CA6 | E16 CA17 | CA23 CC7 | CC19 | 15.30 - | COFFEE BREAK | 16.00 - | E7 CA7 | E17 CA18 | CC8 | POSTER | 16.30 - | E8 CA8 | E18 CA19 | CC9 | | 17.00 - | E9 CA9 | E19 CA20 | CC10 | | 17.30 - | | E20 | CC11 | | 18.00 +-------------------------------------------+ 19.00 | | DINNER | DEMO | DINNER | +-------------------------------------------+ Demonstrations -------------- A number of systems will be demonstrated during the course of the conference. The demonstrations and buffet will take place at the Department of Computer and Information Science. There is still space available and it may be possible to arrange for equipment for the demonstrations. Contact point below. Note that a fee will be charged for commercial exhibitions. CAAP/ESOP/CC'96 attn. Mikael Pettersson Department of Computer and Information Science Linkvping University S-581 83 Linkvping SWEDEN Telephone: +46 13 26 83 Telefax: +46 13 28 44 99 E-mail: mpe(a)ida.liu.se Venue ----- The CAAP/ESOP/CC conferences will be hosted by Linkvping University in April 1996. Organised by the Programming Environments Laboratory at the Department of Computer and Information Science, the conferences will be held in the Collegium building at the Mjdrdevi Science Park, near the University campus. Accommodation is available at several downtown hotels. Linkvping is the fifth largest city in Sweden and has about 130,000 inhabitants. It is located about 200 kilometres southwest of Stockholm, the capital of Sweden. There are airports in Linkvping and Norrkvping (40 kilometres from Linkvping) with regular flights from Copenhagen and Stockholm. One of the main railways runs from Stockholm through Norrkvping, Linkvping and further to Malmv in the south of Sweden. There are also direct train connections from several European cities. The weather is in general unpredictable. Temperatures in spring can vary between 5 and 150C. You are best advised to bring several layers of clothing which can be put on and taken off as required. Registration ------------ The registration fee covers lunches, coffee breaks, conference dinner(s) and proceedings which are to be published by Springer-Verlag in the Lecture Notes in Computer Science series. Student fees cover lunches and proceedings, but not the conference dinner(s). Extra dinner tickets will be available for purchase at the conference. The registration desk is open on Sunday April 21 from 17 to 21 in the lobby of Frimurarehotellet, Monday April 22 from 8 to 9 in Collegium, and Wednesday April 24 from 8 to 9 in Collegium. The phone number to Collegium is +46 13 20 44 00. Accommodation ------------- We have reserved rooms at a number of downtown hotels. Rooms should be booked before April 1st, after that date no rooms are reserved. Note that you have to contact the hotels yourself for booking accommodation. Booking code and the conference name (or the name of our reference person: Ms. Gunilla Blom) must be given when contacting the hotel for booking. The hotels below have reserved rooms. Prices are per night. Ekoxen Hotell 40 single rooms at SEK 1080 Addr: Klostergatan 68 Booking code FI 651 Tel: +46 13 14 60 70 Fax: +46 13 12 19 03 Frimurarehotellet 75 single rooms at SEK 825 Addr: Sankt Larsgatan 14 Give the conference name Tel: +46 13 12 91 80 Fax: +46 13 13 95 44 Good Evening Hotel 65 single rooms at SEK 555 Addr: Hantverkaregatan 1 Booking code BI 365 Tel: +46 13 12 90 00 Fax: +46 13 13 88 50 Stora Hotellet 80 single rooms at SEK 810 Addr: Stora Torget 9 Booking code BI 364 Tel: +46 13 12 90 00 Fax: +46 13 13 37 69 Linkvpings Vandrarhem 3 single rooms at SEK 390, (youth hostel) 5 double rooms at SEK 470 Addr: Klostergatan 52A (SEK 235/person), 2 flats for 4 Tel: +46 13 14 90 90 persons each at SEK 210/person Fax: +46 13 14 83 00 Give the conference name Satellite meetings ------------------ Workshop on Compiler Techniques for Application Domain Languages and Extensible Language Models. Friday afternoon, April 26. Tentatively 14.00--18.00. Organisers: Jan Bosch (Jan.Bosch(a)ide.hk-r.se) and Gvrel Hedin (Gorel.Hedin(a)dna.lth.se) For more information, please contact the organisers or visit http://www.dna.lth.se/Research/CC96-ALEL/about.html The use of functional languages in industry - the Erlang experience, and other cases. Friday afternoon. Contact: Bengt Lennartsson (bln(a)ida.liu.se) For more information, see the web page below. Workshop on Term Rewriting and Tree Languages. Probably Thursday April 25. Organisers: Dieter Hofbauer (dieter(a)cs.tu-berlin.de) Sophie Tison (tison(a)lifl.fr) The workshops aim at providing a discussion forum for the exchange of ideas and experience in these areas. Participants are required to send a short position paper to one of the organisers before April 5th. WWW --- A word-wide-web page containing information about the conferences is reachable by URL: http://www.ida.liu.se/activities/conferences/CAAP-CC-ESOP96/ Administration -------------- Contact point for Conference administration: CAAP/ESOP/CC'96 attn. Ms. Gunilla Blom Department of Computer and Information Science Linkvping University S-581 83 Linkvping SWEDEN Telephone: +46 13 28 22 97 Telefax: +46 13 28 44 99 E-mail: gunli(a)ida.liu.se Chairpersons ------------ CAAP'96 chair: Hilhne Kirchner E-mail: caap96(a)loria.fr CC'96 chair: Tibor Gyimothy E-mail: cc96(a)inf.u-szeged.hu ESOP'96 chair: Hanne Riis Nielson E-mail: esop96(a)daimi.aau.dk Local arrangements chair: Peter Fritzson E-mail: conf96(a)ida.liu.se Payment ------- Registration fees should be paid by Eurocheque, cheque or bankdraft (in Swedish crowns drawn on a Swedish bank) or travellers cheques in Swedish crowns. We cannot accept bank transfers, credit cards or cheques drawn on non-Swedish banks or in currencies other than Swedish crowns. All payments must be made in advance, preferably enclosed with the registration form. For Swedish participants, we also have the possibility to send an invoice of the amount. Registration form ----------------- Return this form to: CAAP/ESOP/CC'96 attn. Ms. Gunilla Blom Department of Computer and Information Science Linkvping University S-581 83 Linkvping SWEDEN Telephone: +46 13 28 22 97 Telefax: +46 13 28 44 99 E-mail: gunli(a)ida.liu.se Name: ----------------------------------------------------------------- Address: ----------------------------------------------------------------- Affiliation: ----------------------------------------------------------------- Telephone: ----------------------------------------------------------------- Telefax: ----------------------------------------------------------------- E-mail: ----------------------------------------------------------------- Dietary restrictions: ----------------------------------------------------------------- Please check the relevant box. Early Late CAAP/ESOP, regular SEK 2450 [ ] SEK 2750 [ ] CAAP/ESOP, student SEK 1500 [ ] SEK 1750 [ ] CC, regular SEK 2200 [ ] SEK 2550 [ ] CC, student SEK 1450 [ ] SEK 1700 [ ] CAAP/ESOP & CC, regular SEK 4000 [ ] SEK 4550 [ ] CAAP/ESOP & CC, student SEK 2450 [ ] SEK 2750 [ ] Payment enclosed: SEK ----------------------------------------------------------------- Early registration forms must be received by 15th March 1996. Student registrations must include proof of status (e.g. copy of identity card or letter from advisor or supervisor). All cancellations received before 9th April 1996 will incur an administration charge of SEK 200. No refunds can be made for cancellations received after this date.

1 0

H-Day
by Peter Freyd 13 Feb '96

13 Feb '96

I remember the time when the only people who could pronounce the word "functor" without either a sneer or an apologetic little snort were a few homological algebraists. The first exception I knew was Paul Halmos. Among other things, he became the single best salesman for my first book. All of which is a preamble for my forwarding of the following: Date: Mon, 12 Feb 1996 16:49:29 -0600 From: gillman(a)MAIL.UTEXAS.EDU (Leonard Gillman) Subject: Halmos = 80 As you may know, Paul will celebrate his 80th birthday on Sunday March 3rd. I am organizing an email blitz for the occasion, the idea being to deluge the old gent on that day with electronic birthday greetings from near and far. You are invited to join the fun. Halmos's address is phalmos(a)scuacc.scu.edu We are all allowed to add any other mathematicians (or nonmathematicians) we think of. Duplications are inevitable in any case, but that is no problem. I suggest notifying people at least a week in advance of H-Day. People without access to email on a Sunday should wait until Monday the 4th to send their greetings. Len ================== ================== Leonard Gillman 1606 The High Road gillman(a)mail.utexas.edu Austin TX 78746-2236 Fax 512-327-2274 (new) Tel 512-327-2277

1 0