*mbx*
3bb593bb00000000






























                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            6-Nov-1996 12:17:55 -0300,4082;000000000000-00000000
Received: by mailserv.mta.ca; id AA13289; Wed, 6 Nov 1996 12:16:24 -0400
Date: Wed, 6 Nov 1996 12:16:24 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: EXPRESS fellowships
Message-Id: <Pine.OSF.3.90.961106121539.16895D-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Wed, 06 Nov 1996 08:49:32 +0100
From: Barthe Gilles <Gilles.Barthe@cwi.nl>

------------------------------------------------------------------------------
Call for Applications

EXPRESS: Expressiveness of Languages for Concurrency is an HCM
cooperation network which aims at investigating the interconnections
and relations between formal systems, ranging from languages for
concurrency to related axiom systems or rewrite systems. The network
activities are structured along the following five main themes:
 * process algebra
 * causality based semantics
 * communication mechanisms
 * higher order calculi
 * theory of embeddings.

EXPRESS is offering a number of visiting fellowships at doctoral or
post-doctoral level in the area of concurrency. The duration of these
fellowships is between 6 and 9 months (depending on sites); under
exceptional circumstances, the duration of the fellowships may be
reduced to a duration of 3 months. A starting date between January 1,
1997 and July 1, 1997 is required. Further information concerning
scientific contents, starting date, duration and allowance for the
positions may be obtained from the potential host institutes:  

Site: CWI, Amsterdam, The Netherlands
Contact: Jan Willem Klop (jwk@cwi.nl)
         Jan Friso Groote (jfg@cwi.nl)

Site: Universiteit van Amsterdam, The Netherlands
Contact: Alban Ponse (alban@fwi.uva.nl)

Site: Katholieke Universiteit Nijmegen, The Netherlands
Contact: Frits Vaandrager (Frits.Vaandrager@cs.kun.nl)

Site: INRIA Rennes, France
Contact: Eric Badouel (Eric.Badouel@irisa.fr)  
         Philippe Darondeau (Philippe.Darondeau@irisa.fr)

Site: INRIA Sophia-Antipolis,  France
Contact: Ilaria Castellani (ic@cma.cma.fr) 

Site: University of Sussex, United Kingdom
Contact: Matthew Hennessy (matthewh@cogs.susx.ac.uk)

Site: SICS, Kista, Sweden
Contact: Joachim Parrow (joachim@sics.se)
         Mads Dam (mfd@sics.se)

Site: University of Hildesheim, Germany
Contact: Ursula Goltz (goltz@informatik.uni-hildesheim.de)
         Arend Rensink (rensink@informatik.uni-hildesheim.de)
         Eike Best (eike.best@informatik.uni-oldenburg.de)

Site: University of Genova, Italy
Contact: Catuscia Palamidessi (catuscia@disi.unige.it)

Site: University of Roma, Italy
Contact: Anna Labella (labella@dsi.uniroma1.it)

Potential applications may also wish to consult the EXPRESS home page:

http://www.cwi.nl/~griffioe/express.html

Applications are subject to HCM regulations, in particular:
  * applicants should be nationals of an EC member state excluding 
    Austria, Finland, Liechtenstein, Sweden;
  * the host institute may not be situated in the applicant's country
   of nationality. In addition applicants may not have carried out
   their normal activity in the country of the host institute for more
   than 18 months in the last 2 years;
  * applicants should  preferably be under the age of 35.

  
Please send your applications to the potential host institutes. 
Applications should include:   
  * a brief research proposal (maximum 1 page), 
  * a CV (with list of publications), 
  * the name and address of three referees.
Candidates who wish to apply to more than one site are asked to state
explicitly their order of preference and whether they wish to combine
two 1/2 year positions.  

Candidates are also required to send a notification of application to
the coordinator of the post-doc programme, Jan Willem Klop (jwk@cwi.nl).

Deadline for applications to be considered in the first round of
selections is December 1, 1996. Positions which are not filled during
the first round of selections will be re-advertised.




 7-Nov-1996 08:31:16 -0300,864;000000000000-00000000
Received: by mailserv.mta.ca; id AA14401; Thu, 7 Nov 1996 08:30:32 -0400
Date: Thu, 7 Nov 1996 08:30:32 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Category for higher-order functions 
Message-Id: <Pine.OSF.3.90.961107083021.5825C-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Thu, 7 Nov 96 8:29:30 MET
From: Scott Thibault <Scott.Thibault@irisa.fr>

Hi,
  I've been looking at some applications of category theory in the area of 
computer science, where people have defined a category whose objects are
types and arrows are functions.  I've tried to extended this idea to
functions that return functions, A->(A->B), but can't seem to find the right 
way to do it.  Has this been done before or is there an obvious representation
for this?

--Scott

 8-Nov-1996 11:39:15 -0300,893;000000000001-00000000
Received: by mailserv.mta.ca; id AA29001; Fri, 8 Nov 1996 11:38:02 -0400
Date: Fri, 8 Nov 1996 11:38:02 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Re: Category for higher-order functions 
Message-Id: <Pine.OSF.3.90.961108113754.29877B-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: 07 Nov 96 10:48:36 EST
From: Robert McGrail <103004.2770@CompuServe.COM>

Scott,
	I believe that you are looking for Cartesian Closed categories.  In such
categories the types (A->B) are also objects and a "natural" curry operation on
arrows exists.  Good references include Gunter's Semantics of Programming
Languages and Lambek and Scott's Introduction to Higher Order Categorical Logic.
Also you may want to peek at Ben Pierce's book on Category Theory for Computer
Scientists.

Bob McGrail


12-Nov-1996 09:04:48 -0300,1258;000000000000-00000000
Received: by mailserv.mta.ca; id AA05620; Tue, 12 Nov 1996 09:01:32 -0400
Date: Tue, 12 Nov 1996 09:01:32 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject:  address change
Message-Id: <Pine.OSF.3.90.961112090109.22237B-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Tue, 12 Nov 1996 11:53:10 +0000
From: Philip Wadler <wadler@dcs.gla.ac.uk>

I'm leaving Glasgow to take up a position at Bell Labs.  I will be
working with the Unix and SML groups, aiding the progress of typed
lambda calculus from academic theory to industrial practice.  My new
address is below.  -- P

-----------------------------------------------------------------------
		  NEW ADDRESS AS OF 18 NOVEMBER 1996
-----------------------------------------------------------------------
Philip Wadler                             wadler@research.bell-labs.com
c/o Judy Paone                http://cm.bell-labs.com/cm/cs/who/wadler/
Bell Laboratories, Lucent Technologies          office: +1 908 582 4004
700 Mountain Ave, Room 2C-579                      fax: +1 908 582 5857
Murray Hill, NJ 07974-0636  USA
-----------------------------------------------------------------------

18-Nov-1996 17:11:17 -0300,656;000000000000-00000000
Received: by mailserv.mta.ca; id AA28477; Mon, 18 Nov 1996 17:10:11 -0400
Date: Mon, 18 Nov 1996 17:10:10 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Separated objects 
Message-Id: <Pine.OSF.3.90.961118171003.28370F-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Mon, 18 Nov 1996 17:48:41 +0100 (MET)
From: Sebastiano Vigna <vigna@dotto.usr.dsi.unimi.it>

I need to find out what is known about the separated objects of an
elementary (or even Grothendieck) topos. Pointers to the relevant
literature would be immensely appreciated.

						seba


18-Nov-1996 17:11:19 -0300,4810;000000000000-00000000
Received: by mailserv.mta.ca; id AA28407; Mon, 18 Nov 1996 17:09:52 -0400
Date: Mon, 18 Nov 1996 17:09:52 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: 4th WoLLIC'97 - First Call 
Message-Id: <Pine.OSF.3.90.961118170946.28370D-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Mon, 18 Nov 1996 09:13:39 -0300
From: Ruy de Queiroz <ruy@di.ufpe.br>


                       First Call for Contributions

        4th Workshop on Logic, Language, Information and Computation
       	                       (WoLLIC'97)
                           August 20-22, 1997
                       Fortaleza (Ceara'), Brazil

The "4th Workshop on Logic, Language, Information and Computation" (WoLLIC'97)
will be held in Fortaleza, Ceara' (Brazil), from August 20th to 22nd 1997.
Contributions are invited in the form of two-page (600 words) abstracts in all
areas related to logic, language, information and computation, including: pure
logical systems, proof theory, model theory, algebraic logic, type theory,
category theory, constructive mathematics, lambda and combinatorial calculi,
program logic and program semantics, nonclassical logics, nonmonotonic logic,
logic and language, discourse representation, logic and artificial
intelligence, automated deduction, foundations of logic programming, logic and
computation, and logic engineering.

There will be a number of guest speakers, including:
K. Devlin (Moraga,USA), A. Edalat (London,UK), Y. Gurevich (Ann Arbor),
P. Johnstone (Cambridge,UK), R. Kossak (New York), M. Moortgat (Utrecht) (*),
H. Rott (Konstanz) (*)

(*) to be confirmed

Submission:
Two-page abstracts, preferably by e-mail to *** wollic97@di.ufpe.br *** must be
RECEIVED by JUNE 1st, 1997 by the Chair of the Organising Committee. Authors
will be notified of acceptance by July 1st, 1997.  The 4th WoLLIC'97 is under
the official auspices of the Interest Group in Pure and Applied Logics (IGPL),
The European Association for Logic, Language and Information (FoLLI), and
co-sponsored by the Association for Symbolic Logic (ASL), and the Sociedade
Brasileira de Computacao (SBC).  Abstracts will be published in the Journal of
the IGPL (ISSN 0945-9103) (Oxford University Press) as part of the meeting
report.  Selected contributed papers will be invited for submission (in full
version) to a special issue of the Journal of the IGPL
(http://www.mpi-sb.mpg.de/igpl/Journal).

The location:
Located near the equatorial line in the northeastern coast of Brazil,
Fortaleza, the capital of the state of Ceara', lies by the beach between the
Ceara' and the Coco' rivers, in the middle of 570km (360mi) of sandy beaches
of the State's coast. The hightest point in the city is only 30m (100ft) high
and its beach front is formed of sand dunes up to 10m high and coconut trees.
The weather is dry and sunny. A permanent breeze comes from the ocean and keeps
the air clean and healthy while the temperature rests on a nice level year
around. The lack of rain during most of the year, now a blessing for the
visitors, prevented a definitive settlement in the area of Fortaleza until the
middle of the 17th Century. At that time, need to assure the hold of the land,
the Portuguese established the "Fortaleza de Nossa Senhora da Assuncao" in the
same place where a hundred years before the dutch had built the
Schoonenbroch Fort. Fortaleza, named after the fortress, has been since then an
important trading center and an artistic and cultural center of the country.
(http://www.bec.hosting.ibm.com/pagina/pfortale.html)
(http://www.roadnet.com.br/netmidia/guia/tur.htl)

Programme Committee:
A. Avron (Tel-Aviv Univ., Israel), J. van Benthem (ILLC, Amsterdam),
W. A. Carnielli (UNICAMP, Campinas), N. da Costa (USP, Sao Paulo),
I. Hodkinson (Imperial College, London), L. Moss (Indiana Univ., Bloomington),
V. de Paiva (Birmingham Univ., UK), T. Pequeno (UFC, Fortaleza),
R. de Queiroz (UFPE, Recife), P. Veloso (PUC, Rio).

Organising Committee:
M. Aragao (UFC), F. Carvalho (UFC), A. T. C. Martins (UFC),
A. G. de Oliveira (UFBA/UFPE), M. Pequeno (UFC), T. Pequeno (UFC),
R. de Queiroz (UFPE), W. Vasconcelos (UECE).

For further information, contact the Co-Chairs of Organising Committee:
R. de Queiroz, Departamento de Informatica, Univ. Federal de Pernambuco,
CP 7851, Recife, PE 50732-970, Brazil, e-mail: ruy@di.ufpe.br,
tel.: +55 81 271 8430, fax: +55 81 271 8438.
T. Pequeno, Laboratorio de Inteligencia Artificial, Univ. Federal do Ceara',
CP 12166, Fortaleza, CE 60455-760, Brazil, e-mail: tarcisio@lia.ufc.br,
tel.: +55 85 287 1333, fax: +55 85 288 9845.

Web homepage: http://www.di.ufpe.br/~wollic97/wollic97.html


19-Nov-1996 08:23:40 -0300,1081;000000000000-00000000
Received: by mailserv.mta.ca; id AA15497; Tue, 19 Nov 1996 08:23:03 -0400
Date: Tue, 19 Nov 1996 08:23:03 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Re: Separated objects 
Message-Id: <Pine.OSF.3.90.961119082253.15472B-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Tue, 19 Nov 96 09:48 GMT
From: Dr. P.T. Johnstone <P.T.Johnstone@pmms.cam.ac.uk>

Assuming you mean the separated objects for a Lawvere--Tierney local
operator, what is known (and essentially all that is known) is that
they form a quasitopos. This result is due to me (rather to my
surprise): the first proof of it is in my paper "On a topological
topos" in Proc. London Math. Soc. 38 (1979), 237--271. There is a
lot more detail in Oswald Wyler's book "Lecture Notes on Topoi and
Quasitopoi" (World Scientific, 1991). It remains an open problem
(and a very hard one, I think) whether every quasitopos is
representable as the separated objects for some local operator on
a topos.

Peter Johnstone

19-Nov-1996 21:44:33 -0300,1188;000000000000-00000000
Received: by mailserv.mta.ca; id AA00263; Tue, 19 Nov 1996 21:43:59 -0400
Date: Tue, 19 Nov 1996 21:43:58 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: What kind of functor do I have here? 
Message-Id: <Pine.OSF.3.90.961119214349.284A-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

---------- Forwarded message ----------
Date: Tue, 19 Nov 1996 19:39:26 -0600
Subject: What kind of functor do I have here?

Suppose I have an endofunctor F : C -> C on a category with finite
products and exponents, and a natural transformation s : Exp => Exp o
(Fop x F) such that, for all f in C(A,B),

1
|  \
|   \ 
|    \
|[f]  \[Ff]
v      v
B^A--->FB^FA
   s_AB

where [f] is (f o pr_2)^, the name of f.

Is this called a "strong functor", similar to the "strong monad" idea?

---------------------------------+---------------------------------------------
caplan@cs.uiuc.edu               |Joshua Caplan, Dept. of Computer Sci.
http://acsl.cs.uiuc.edu/~caplan/ |Univ. of Illinois at Urbana-Champaign
---------------------------------+---------------------------------------------

20-Nov-1996 11:59:13 -0300,1019;000000000000-00000000
Received: by mailserv.mta.ca; id AA13845; Wed, 20 Nov 1996 11:58:18 -0400
Date: Wed, 20 Nov 1996 11:58:17 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Re: What kind of functor do I have here? 
Message-Id: <Pine.OSF.3.90.961120115811.13790B-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Wed, 20 Nov 96 10:16:50 GMT
From: Roy L. Crole <rlc3@mcs.le.ac.uk>



Re: Joshua Caplan's question about strong functors.

If you regard C as enriched over itself, with C(A,B) = B^A in obC, and the
functor F is C-enriched, and also s_A,B : C(A,B) ---> C(FA,FB) is precisely
the action of F on hom-objects, then F is often called a strong functor,
and s a functorial strength.

Connections between these ideas and tensorial strengths can be found in

A. Kock, Strong Functors and Monoidal Monads, Archiv der Mathematik, 23
1972.

Basically the short answer to your question is "yes". Hope this helps.

Roy Crole

25-Nov-1996 14:25:45 -0300,1555;000000000000-00000000
Received: by mailserv.mta.ca; id AA20496; Mon, 25 Nov 1996 14:23:54 -0400
Date: Mon, 25 Nov 1996 14:23:53 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Australian Category Seminar announcements and Web pages 
Message-Id: <Pine.OSF.3.90.961125142341.25194A-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Thu, 21 Nov 1996 10:30:52 +1100
From: Sjoerd Erik CRANS <scrans@mpce.mq.edu.au>

Dear all,

I would like to remind you about the possibility of
receiving the weekly announcements for the Australian
Category Seminar by email. If you are interested,
please send an email to scrans@mpce.mq.edu.au or to
stevel@maths.usyd.edu.au.

These announcements are also available via our Web pages,
http://www-math.mpce.mq.edu.au/~coact/seminar.html and
http://cat.maths.usyd.edu.au/auscat/,
where you can also find more information about the Seminar,
including abstracts from past Seminars.

I would like to know whether there are similar seminars
on category theory, or closely related subjects, being
conducted at other universities, and if so, whether they
have information available by email or on the Web (a search
with the usual search engines was not very satisfactory).
Please send your responses directly to scrans@mpce.mq.edu.au,
rather than to the list; I will, with your permission of
course, make this information publicly available via our
Web page mentioned above.

Sjoerd Crans
Macquarie University,
Sydney,
Australia

27-Nov-1996 14:13:01 -0300,816;000000000000-00000000
Received: by mailserv.mta.ca; id AA08120; Wed, 27 Nov 1996 14:10:55 -0400
Date: Wed, 27 Nov 1996 14:10:54 -0400 (AST)
From: categories <cat-dist@mta.ca>
To: categories <categories@mta.ca>
Subject: Poste de professeur 
Message-Id: <Pine.OSF.3.90.961127141043.19386A-100000@olympus.mta.ca>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

Date: Wed, 27 Nov 1996 17:24:41 --100
From: Dominique Bourn <bourn@lma.univ-littoral.fr>

Un poste de professeur va etre cree a l'Universite du Littoral
(Calais/Dunkerque France)
Le profil du poste est le suivant:
theorie des nombres,theorie des corps
ou
algebre categorique,geometrie algebrique
Le candidat recherche devra s'integrer a l'equipe d'algebre
du laboratoire Langal.Les personnes interessees peuvent prendre
 contact avec D.Bourn.

