From rrosebru@mta.ca Ukn Sep 2 14:30:09 1994 Date: Fri, 2 Sep 1994 14:06:11 +0500 (GMT+4:00) From: Bob Rosebrugh Subject: Re: Top\op is a quasi-variety Date: Thu, 1 Sep 1994 17:24:13 +0200 (MET DST) From: Paul Johnson Dear Categories: > by Michael Barr and M. Cristina Pedicchio > > We show that there is a certain variety (= category tripleable over > sets) and a simple Horn sentence in it of the form phi(u) = phi(v) ==> > psi(u) = psi(v) whose category of models is equivalent to the opposite > of topological spaces. There is a related result which (since it makes no mention of Horn clauses, this result of Barr and Pedicchio apparently extends, yet, nonetheless) may be of interest: For each topological space B, the contravariant hom-functor Top(-,B) : Top^op -----> Sets is of descent type, if and only if, the space B contains a two-point indiscrete subspace, that is, a pair of points which in the topology on B are contained in the same open sets, and a copy of the Sierpinski space. The first condition is sufficient to ensure that, for each topological space X, the canonical counit map X -----> B^Top(X,B) is an injection, and the second ensures that it is the embedding of a subspace. That these conditions are each necessary is easily checked. Each such space gives rise to an algebraic theory Th_B, as well as a comparison Top^op -----> B-Alg, exhibiting Top^op as a full reflective subcategory of, and hence tripleable over, the category of algebras B-Alg. > The theory consists of that of frames together > with a unary operation we denote ' (it is a kind of pseudocomplement) > satisfying a small set of equations plus an equation scheme that forces > all intervals of the form [u /\ u',u \/ u'] to be complete atomic > boolean algebras with the Sup and ' as operations. The underlying set > functor on Top\op takes a space to the set of all pairs (U,A) where U is > open and A is an arbitrary subset of U. The frame operations are the > usual, while (U,A)' = (U,U - A). This particular algebraic theory to which you refer is perhaps exactly that arising from the space B having three points, one of which is closed, with open complement (containing the other two points) as the only non-trivial open. >The Horn clause is u \/ u' \/ 1' = v > \/ v' \/ 1' ==> u \/ u' = v \/ v'. > > [note from moderator: Michael says the paper will be available by ftp from > triples.math.mcgill.ca soon.] Best regards to all (especially FEJL), Paul. Date: Sat, 10 Sep 1994 22:52:22 +0500 (GMT+4:00) Subject: "Homotopical algebra and triangulated categories" Date: Thu, 8 Sep 1994 09:35:25 +0200 From: Marco Grandis The following preprint is available (by hard mail) Marco Grandis, "Homotopical algebra and triangulated categories" to appear in: Math. Proc. Cambridge Philos. Soc. Abstract We study here the connections between the well known Puppe-Verdier notion of triangulated category and an abstract setting for homotopical algebra, based on homotopy kernels and cokernels, which was exposed by the author in two previous papers ["On the categorical foundations of homological and homotopical algebra", Cahiers Top. Geom. Diff. Categ. 33 (1992), 135-175. "Homotopical algebra in homotopical categories", Appl. Categ. Struct., to appear]. We show that a right-homotopical category A (having well-behaved homotopy cokernels, i.e. mapping cones) has a sort of weak triangulated structure with regard to the suspension endofunctor Sigma, called Sigma-homotopical category. If A is right- and left-homotopical and h-stable (in a sense related to the suspension-loop adjunction), also this structure is h-stable, i.e. satisfies "up to homotopy" the axioms of Verdier for a triangulated category, excepting the octahedral one which depends on some further elementary conditions on the cone endofunctor of A. Every Sigma-homotopical category can be stabilised, by two universal procedures, respectively initial and terminal. Date: Thu, 15 Sep 1994 01:50:44 +0500 (GMT+4:00) Subject: programme de C.A.E.N. 94 Date: Wed, 14 Sep 94 15:36:46 +0200 From: Pierre Ageron PROGRAMME PROVISOIRE DE C.A.E.N. 94 (UNIVERSITE DE CAEN, FRANCE) mardi 27 septembre 11h50 P. DEHORNOY (Caen) Groupe de structure pour une identite algebrique 14h00 P. AGERON (Caen) 1) Pour les esquisses - 2) Esquisses et theorie des groupes 14h50 D. DUVAL (Limoges) et J.-C. REYNAUD (Grenoble) Esquisses et calcul 15h40 D. DUVAL (Limoges) et P. SENECHAUD (Limoges) Esquisses et calcul (suite) 16h40 M. GERNER (Paris) Diagrammes localement libres comme completions inductives 17h30 W. DRECKMANN (Bangor) ??? mercredi 28 septembre 09h10 J. PENON (Paris) ??? 10h00 D. BOURN (Dunkerque) ??? 11h00 Y. DIERS (Valenciennes) Categories d'ensembles algebriques 11h50 J. POWER (Edimbourg) Gabriel-Ulmer duality for categories enriched in bicategories 14h00 C. LAIR (Paris) Neoesquisses : patchworks 14h50 P. JOHNSTONE (Cambridge) Finitary sketches and finitary theories 15h40 T. PORTER (Bangor) Les esquisses en topologie algebrique ? 16h40 M. MATHIEU (Paris) Extensions de theories de Lawvere 17h30 R. BROWN (Bangor) ??? jeudi 29 septembre 14h00 Y. LAFONT (Marseille) Une nouvelle condition de finitude pour les monoides pre- sentes par des systemes de reecriture complets (d'apres C.C. Squier) 14h50 F. LAMARCHE (Londres) Sur la categorie monoidale fermee libre avec produits 15h40 J. VAN DE WIELE (Paris) Des invariants de Vassiliev pour les noeuds a la logique de Lie 16h40 P. TAYLOR (Londres) ??? 17h30 C. RETORE (Nancy) Une modalite autoduale pour un connecteur non commutatif vendredi 30 septembre 09h10 K. LELLAHI (Paris) Types de collections et monades 10h00 A. BURRONI (Paris) Le topos des polygraphes : applications a l'informatique 11h00 P. DAMPHOUSSE (Tours) Les representations naturelles de PX dans PPX 11h50 J. STELL (Keele) Modelling term-rewriting systems by sesquicategories 14h00 R. GUITART (Paris) Logique speculaire 14h50 F. WEHRUNG (Caen) ??? ----------------------------------------------------------------------------------- Date: Fri, 16 Sep 1994 01:16:34 +0500 (GMT+4:00) Subject: preliminary announcement Date: Thu, 15 Sep 1994 19:58:57 +0200 From: Michael Wendt Preliminary Announcement: There will be a conference in the Spring of 1996 in Potsdam, Germany to honour the mathematical contributions of Hans-Juergen Hoehneke on the occasion of his 70th birthday. For more information, contact Klaus Denecke at: kdenecke@hp.rz.uni-potsdam.de Date: Sun, 25 Sep 1994 18:34:52 +0500 (GMT+4:00) Subject: Categories on the Web **************************************************************************** CATEGORIES INFORMATION ON THE WEB **************************************************************************** Subscribers to this list who have access to the World Wide Web may now access the archives of the categories list, link to ftp sites of interest and sources for diagram macros by pointing to the URL http://www.mta.ca/~cat-dist/ If you do not have WWW access directly, you can access the Lynx Web browser by telneting to ukanaix.cc.ukans.edu, login www (needs vt100 terminal) or info.cern.ch. Using a Mosaic browser is a much better solution, and your system should provide it - Mosaic is available for Windows, Mac and X-Windows for free from NCSA. Please send Web addresses for servers of interest to readers of this list to categories-request@mta.ca so that links can be added (or to categories@mta.ca for a general announcement.) The updated routine distribution follows. ***************************************************************************** This is the routine distribution for the categories mailing list. It is the file routine.dist in pub/categories at sun1.mta.ca and was last updated on Sept 15, 1994. Subscribers should note that the From: field of a categories posting is categories (this is different from some other mailing lists). If you `Reply:' to a posting it will be redirected to the entire list (unless another intention is clearly detected by the moderator). Administrative items (address changes etc.) can be sent to categories-request@mta.ca or directly to the moderator. Usually, items of this sort sent to categories@mta.ca will not be posted. Access to archives of categories postings and other useful pointers is available on the World Wide Web; the URL is http://www.mta.ca/~cat-dist/ This page may also be reached by pointing to Mount Allison University in New Brunswick, Canada and then choosing `Academic Information', `Science', `Math and Computer Science' and `Research Information'. The archives of postings on categories are held at the ftp site sun1.mta.ca in the directory pub/categories. This is a Unix system. The postings are filed in yearly subdirectories called 90, 91 etc. Within those subdirectories there are monthly files, and an annual list of dates and subjects of postings. In the pub/categories directory there is also a file called ftp.sites with information about ftp sites holding files of interest to subscribers. Please send information about WWW/ftp sites with holdings of interest to categories-request@mta.ca, or to me. If you need detailed instructions on how to use ftp, ask anyone knowledgable about the Internet at your site, or write to me. Bob Rosebrugh Phone: +1-506-364-2538 Department of Mathematics and Computer Science Mount Allison University Sackville, N. B. E0A 3C0 InterNet: rrosebrugh@mta.ca Canada Date: Mon, 26 Sep 1994 11:42:55 +0500 (GMT+4:00) Subject: postdoctoral positions expected at Sydney Date: Mon, 26 Sep 94 15:32:26 +1000 From: Max Kelly There has been recent evidence that the applications by Ross Street, Bob Walters, Mike Johnson and myself for Australian Research Council research funds for the triennium 1995-1997 will be successful, at least to the extent that we shall certainly receive a grant -- it will now be a single, combined one for the four of us -- of a still- unknown amount. It will probably be late October or early November before we learn the actual sum awarded, and the money will then be available from Jan 1995. As part of our application, we have requested several new post-doctoral positions, and believe ourselves likely to get one at least. If there is only one, it will be offered at Sydney University ; if there are more, there may be some at Macquarie. It seems to us wise, now we know that some funds are coming, to say so publicly at once, in order that those interested in post-doctoral positions may start thinking about the possibility of coming to Australia, and get in touch with us for further enquiries about the kind of post we have in mind. We shall put further details on the bulletin board as soon as we know them; in the meantime, if any one is attracted by the idea, or has young colleagues that may be so, please get in touch with one of us, and in particular with myself concerning positions at Sydney University. Max Kelly Date: Tue, 27 Sep 1994 11:43:24 +0500 (GMT+4:00) Subject: question Date: Tue, 27 Sep 1994 11:35:46 +0100 From: Michael Wendt I met someone at a conference recently who wanted me to post something to the Cats bulletin board. Forwarded message: Ewa Graczynska of Wroclaw, Poland does research on hyperidentities and solid varieties of algebras and would like to know if there is a connection with lambda-calculus. * * In pseudo-latex code: * * Definition: Fix a type \tau =(n_i)_{i\in I}, n_i>0 for all i\in I and * operation symbols (f_i)_{i\in I}, where f_i is n_i-ary. Let W_\tau(X) be the * set of all terms of type \tau over the alphabet X=\{ x_1, x_2, ... \}. Terms * W_\tau(X_n) with X_n =\{ x_1, x_2,..., x_n\} are called n-ary. Moreover, let * Alg(\tau) be the class of all algebras of type \tau. Then a mapping * * \sigma: \{ f_i: i\in I \} --------> W_\tau (X) * * which assigns to every n_i-ary operation symbol, f_i, an n_i-ary term will * be called a HYPERSUBSTITUTION of type \tau. Hypersubstitutions can be uniquely * extended to terms: * * \hat{\sigma}: W_\tau(X) --------> W_\tau(X) * * is defined inductively on the complexity of terms from W_\tau(X) in a * natural way: * (i) \hat{\sigma}[x]:=x for any variable x in the alphabet X; * (ii) \hat{\sigma}[f_i(t_1,...t_{n_i})]:= {\sigma(f_i)}^{W_\tau(X)} (\hat{ * \sigma}[t_1],..., \hat{\sigma}[t_t_{n_i}]), where {\sigma(f_i)}^{W_\tau(X)} * denotes the term operation induced by \sigma(f_i) on the term algebra on the * universe W_\tau(X). * * By Hyp(\tau), we denote the set of all hypersubstitutions of type \tau. * * An equation p=q of type \tau (a pair of terms of W_\tau(X)) is called a * HYPERIDENTITY of type \tau in an algebra A\in Alg(\tau) iff * \hat{\sigma}(p) = \hat{\sigma}(q) is an identity of A for every * \hat{\sigma}\inHyp(\tau). * * SOLID varieties of algebras are varieties of algebras of a given type * \tau in which all identities are hyperidentities as well. (end definition) * * References: * [1] E. Graczynska, D. Swiegert; "Hypervarieties of a Given Type;" Algebra * Universalis 27 (1990), 305-318. * * [2] W. Taylor; "Hyperidentities and Hypervarieties," Aequationes math. 23 * (1981), 30-49. * She would like to know if there are connections between hyperidentities and lambda-calculus. She is not on the categories bulletin board. Please don't send a response to me. E-mail her directly at WSIOPOLE@mvax.ci.pwr.wroc.pl Date: Fri, 30 Sep 1994 19:37:43 +0500 (GMT+4:00) Subject: Chair in Computer Science Date: Fri, 30 Sep 94 18:46:53 BST From: M.Z.Kwiatkowska@computer-science.birmingham.ac.uk Dear Colleague, Please find enclosed an advertisement for a Chair in Theoretical Computer Science or Software Engineering at the University of Birmingham. I would appreciate it if you could distribute it to those who might be interested. The deadline is 14th October 1994. With regards, Marta Kwiatkowska _________________ \documentstyle[10pt]{article} % \pagestyle{empty} \setlength{\oddsidemargin}{-0.5cm} \setlength{\evensidemargin}{-0.5cm} \setlength{\textwidth}{6.75in} \setlength{\topmargin}{-0.5cm} \setlength{\headheight}{0cm} \setlength{\headsep}{0cm} \setlength{\textheight}{9.9in} \def\sp{\\[0.1cm]} \def\Sp{\\[0.2cm]} \def\SP{\\[0.45cm]} \def\ps{\vspace{-0.2 cm}} \def\Ps{\vspace{-0.4 cm}} \def\PS{\vspace{-0.6 cm}} \def\hs{\newline\hspace*{2.0cm}} % indent next line \def\int{\par \vspace{-0.8cm}\hspace{1.0cm}} \def\ind{\parindent 1cm \indent} \begin{document} \hyphenpenalty 10000 \parskip 0.2cm \parindent 0cm \begin {center} {\large \bf SCHOOL OF COMPUTER SCIENCE \\ THE UNIVERSITY OF BIRMINGHAM} \end {center} {\bf POST REFERENCE NUMBER} \hfill {\bf DEPARTMENT} \hfill School of Computer Science {\bf JOB TITLES} \hfill Chair and Head of the School of Computer Science {\bf STARTING SALARY} \hfill \\ . \hfill \\ . \hfill \\ . \hfill {\bf STARTING DATE} \hfill October 1995 {\bf INFORMAL ENQUIRIES TO} \hfill Dr W P Dodd telephone 021 414 3711\\ \hfill email W.P.Dodd@birmingham.ac.uk\\ {\bf CLOSING DATE FOR RECEIPT OF APPLICATIONS} \hfill ~~~~~ 14th October 1994\\ \vspace{0.5cm} \hrule \vspace{3.0cm} {\bf APPLICATION FORMS AND FURTHER DETAILS OBTAINABLE FROM:} \Sp ~ \hs The Director of Staffing Services \hs The University of Birmingham \hs Edgbaston \hs Birmingham B15 2TT \hs England \Sp ~ \hs FAX NO. ~~~~~~~~~~~~~+44 (0)21-414-4802 \hs TELEPHONE NO. +44 (0)21-414-6486\\ \vspace*{1.0cm} PLEASE SEND APPLICATIONS TO THE ABOVE ADDRESS \vspace*{2.0cm} {\bf The University of Birmingham is an Equal Opportunities Employer} \newpage \parskip 0.15cm \parindent 0cm \begin{center} {\large \bf THE UNIVERSITY \\ OF BIRMINGHAM\\ School of Computer Science\\ Chair and Head of the School of Computer Science\\ FURTHER PARTICULARS} \end{center} \PS \section{Introduction} \Ps Applications are invited from candidates with an eminent research record who are able to contribute to research, teaching and leadership in the School of Computer Science. There are no restrictions regarding areas of expertise within the general context of either Software Engineering or Theoretical Computer Science. The successful candidate will be expected to take on the Headship of the School for a fixed term from 1st October 1995. An additional lectureship will be associated with this post. \PS \section{The School of Computer Science} \Ps Computer Science is based in the Faculty of Science though there are teaching and research links with most other faculties. The School is now entering a new phase of a programme of growth and rationalisation that began three years ago with the appointment of, first, Professor Sloman and then Professor Bocca. This period has seen a substantial investment by the University in Computer Science which is reflected in an improved equipment provision and the establishment of four new lectureships in the general areas of Artificial Intelligence, under the direction of Professor Sloman, and funded by new degree courses in AI. This period has also seen the start of a redefinition of the School's teaching and research priorities and these have been grouped into the areas of Software Engineering and Applied Computer Science, Artificial Intelligence and Cognitive Science, and a new growth point, Theoretical Computer Science. The aim of the School, supported by the University, is that all three of these areas should be headed by a professorial appointment. Professor Sloman who has recently stepped down from the headship of the School, will continue to lead the AI and Cognitive Science activities, and the current appointment is for someone to lead either of the other two activities. It is our intention to make an appointment to the remaining area for October 1996, and again it is likely that this post will have an additional associated lectureship. \Ps \subsection*{Research and teaching facilities} \Ps The School is located in pleasant recently refurbished offices with spacious laboratories and a School library complementing the main University library. Computing facilities are built primarily round a network of Unix servers, workstations and X terminals. Most of the research and advanced teaching is done on SPARCServers, SPARCStations and X terminals linked to a Hewlett-Packard network, and we have access via the High Speed Campus Network to powerful computing centre machines and to national and international networks. Some research and teaching is also based on Macs and PCs. Specialised equipment includes a transputer network, image processing facilities and speech facilities. \PS \section{Academic and academic related staff in the school} \Ps At present the school has the following members. {\em Head of School} \hs Peter Dodd {\em Professors} \hs Aaron Sloman, \hs Jorge Bocca (based in Munich), \hs Peter Jarratt (part time), \hs Peter Horne (Apricot Computers, Honorary Professor) {\em Senior lecturers} \hs Tom Axford, \hs William Edmondson, \hs Jim Yandle {\em Lecturers and temporary lecturers} \hs Russell Beale, \hs Mike Brayshaw, \hs Ela Claridge, \hs Antoni Diller, \hs Peter Hancox, \hs Bob Hendley, \hs John Hollows, \hs Lydia Kronsjo, \hs Marta Kwiatkowska, \hs Susan Laflin, \hs Donald Peterson, \hs Riccardo Poli, \hs Mark Ryan, \hs Alan Sexton \hs Salleh Syed-mustaffa {\em Research fellows} \hs Konstantin Bazyk,~~~ Sophia Langley, ~~~David Murphy, ~~~Kal Natarajan, {\em Honorary senior research fellow} \hs John Newell {\em Honorary visiting fellows} \hs Peter Greenfield, ~~~Allen Long , ~~~Keith Jeffery In addition there are three computer officers, a technician, a school administrator and six secretaries. \PS \section{Research areas} \Ps Our research activity includes both theoretical work and applications, and much of it is cross-disciplinary. Links exist with several other departments, including psychology, philosophy, medicine, dentistry and engineering. We also have external research links with software firms, industrial research centres, computer companies, government research laboratories, Defence Research Agency laboratories, and companies using advanced software technology. There is collaboration with universities and industrial research laboratories in the UK, Continental Europe, Australia, Canada and the USA. Current research interests span the following overlapping range of topics: {\em Theoretical computer science, and semantics of computation} \\ This includes applications of logic to computer science and semantics of concurrency. A central theme has been the connections between algebra, topology and logic, including specific topics such as characterizations of program properties, reasoning with fairness, the modal $\mu$-calculus, and applications of Stone duality in semantics, e.g. domain logics. In the field of concurrency we are studying non-interleaving calculi, timing-- and distribution--sensitive models of concurrency, asynchronous communication, and enriched--categorical accounts of process interaction. We expect that research in theoretical computer science would be expanded as a result of the appointment of a new professor in this area and by later new posts associated with the development of a new undergraduate degree in Mathematical Computer Science. {\em Declarative programming and parallel processing} \\ This includes logic programming, functional programming, formalisms for parallelism, analysis of complexity in parallel algorithms, and properties of networks, implementation of functional languages on parallel architectures. {\em Software Engineering and Formal Methods} \\ This includes work on CASE tools for software performance and quality evaluation, object-oriented program analysis, and methodologies and tools for obtaining program code from a formal specification. Recent work includes designing a formal system for the structured specification of computer systems, using modal action logics and deontic logic. Work in AI on default reasoning and belief revision overlaps with this area, as does work on the representatoin of normative statements. A grant from the SERC-DTI initiative in Safety Critical Systems supports work on AI tools and methodologies for risk assessment and risk management in finance and insurance organisations. {\em Databases} \\ This area is led by Professor Bocca, and builds on work done previously at the European Computing Research Centre at Munich. It includes work on logic based data and knowledge based management systems; research on an integrated model to cover the main aspects of object oriented, deductive and extended relational models; GIS, multi-media and constraint database, and research on a new family of file structures for advanced DBMSs. {\em Human-Computer Interaction} \\ This includes work on tools and methodologies for interface design, cognitive modelling of interaction, analysis of different types of interaction styles, computer based training and modelling of users. The "agent-based" approach to interface design is being explored. All this overlaps with the work on image processing and Cognitive Science. Work on intelligent tutoring systems, a graphical tracer for Prolog, and AI development environments, overlaps with research on Sofware Engineering. A recent project on User Interface design tools included Birmingham, Sussex, Integral Solutions Ltd and BMT Ltd. Collaborative work includes sponsorship by Xerox USA of one of our students. A grant from Apricot Computers has provided a three year post for research on HCI. {\em Image Understanding and Computer Vision} \\ This overlaps with studies of visual cognition, but has a strong practical orientation, especially medical image interpretation, including collaboration with clinical researchers, on mammography, diagnosis of skin problems and analysis of muscle cells. Analysis of medical images includes both analysis and interpretation of 2-D images and also the representation and analysis of 3-D shape and motion. An EC-funded AIM project in collaboration with academic and industrial collaborators in Belgium, France and Germany includes work at Birmingham on modelling and interpretation of brain images. Another project partly funded by British Telecom is looking at early diagnosis of melanoma from photographs of skin lesions. Research on human vision involves close collaboration with the School of Psychology. There is also research on analysis of historical texts, and work on computer graphics to aid archaeologists. {\em Artificial Intelligence and Cognitive Science} \\ This area is being developed in collaboration with other Schools, especially Psychology. It includes work on speech processing, language understanding, language learning in children, computer vision, forms of representation and reasoning, "broad" (multi-functional) architectures for intelligent agents and the modelling of motive processing and emotions (in collaboration with the School of Psychology) partly funded by a grant from the Renaissance Trust, and a grant from the Joint Research Council Initiative in Cognitive Science and HCI for work on modelling "broad" (multi-functional) agent architectures, including mechanisms of attention and motive-generation. Recent additions include work on belief revision, default reasoning, formal characterisations of verisimilitude, modal action logics and deontic logic. Work on AI development environments overlaps with HCI and Software Engineering. There is considerable overlap with the other areas listed. Growth of the new undergraduate degrees in AI will lead to expanded research in AI. {\em Neural Nets, Evolutionary Computation, Artificial Life} \\ This work includes the development of trainable recognition systems non-linear tracking systems, and neural nets in computer interfaces which learn to model users. A recent project included online analysis of oceanographic survey data, funded by the Natural Environment Research Council. Methods from the fields of evolutionary computation (including genetic algorithms and genetic programming) and artificial life have been used in developing image analysis systems and also for optimising neural networks for medical image and signal processing. {\em Philosophical Foundations of computing and AI} \\ Research is in progress on philosophical foundations of computing and AI, including for example, the ontological status of virtual machines, the study of conditions under which machines can have minds, architectural requirements for intelligent agents, and the analysis of the role of changing representations in problem solving and creative thinking. For more complete information about research in all these areas please consult the school research review booklet for 1992-3 and the update. A new edition of the booklet, for 1993-4 should be available by January 1995. \PS \section{The Teaching Programme} \Ps The School offers an integrated set of degree programmes at the undergraduate and postgraduate level, and these are likely to be extended over the next few years as the University moves to a modular degree programme. All undergraduate degree programmes are based on long running BSc in Computer Science/Software Engineering and the more recently introduced half degree programme in Artificial Intelligence. The AI half degree is currently combined on an equal basis with Psychology, Mathematics, and Computer Science, with other combinations planned for future years. Computer Science is combined with Mathematics and Electronic Engineering. With the move to modularisation we are introducing programmes in Software Engineering with Business Studies, and with a modern language. Our future plans include the introduction of a BSc course with the working title of Mathematical Computer Science, and discussions with the School of Mathematics are underway. We would expect any new professorial appointment in Theoretical Computer Science to play a major role in developing this degree programme. An additional recent development, under the direction of Professor Bocca, is a new international degree combining International Business Management and Computer Science which is taught in combination with the International Institute of Business Studies based in Munich. At the postgraduate level we offer two taught MSc courses - a conversion course in Computer Science (with streams in IT, AI and Software Engineering) which has been supported by SERC/EPSRC for 25 years, and a more recently introduced course in Cognitive Science which is taught in combination with Psychology, Philosophy and English. Both courses are currently supported by ESF. Research training towards MPhil or PhD degrees is offered in all the above research areas. \PS \section{Responsibilities of a Professor} \Ps A Professor in The University of Birmingham is generally responsible, through the Vice-Chancellor, to the Council, for the overall academic advancement of the University. A Professor who is not a Head of School is thus responsible not only for the progress of his or her own field of knowledge and for the academic leadership in that field, but also for assisting the Head of School in the overall management of the School, including the monitoring of academic standards and the appraisal of staff. Apart from the privileges which go with the position of Professor, such as ex officio membership of the Faculty Board, each Professor is also particularly responsible for assisting the Head of School in maintaining and promoting the standards of efficiency and good order of the School in accordance with the University's regulations. These may be summarised as reaching agreed academic objectives, maintaining and setting up strucutures for academic management and monitoring performance, appraisal of staff, and other matters properly delegated. A Professor who is not a Head of School may be called upon to act as Head of School in the substantive Head's absence. \PS \section {Responsibilities of the Head of School} \Ps The Head of School is responsible to the Dean for submitting the School's plans, for reaching the academic objectives agreed with the University and for the general academic administration of the School. The Head of School is responsible to the Vice-Chancellor direct for managing the School within the agreed budget. \PS \section {General Guidance for Candidates} \Ps The initial salary will be negotiated between the successful candidate and the Vice Chancellor. No application form is provided and candidates are free to set out their applications as they wish provided it is typed on one side only of A4 paper. However, applications must include: (a) a full curriculum vitae\\ (b) a list of publications\\ (c) the names and addresses of three referees\\ and should include (d) the equal opportunities form enclosed. Copies of the following publications are available on request from the School Office. The General University Prospectus\\ The School Annual Research Review\\ Undergraduate and Postgraduate Handbooks\\ The closing date for applications is 21 Oct 1994. It is expected that interviews will be held on 13th Dec 1994. Applications ({\bf ten} copies, one from overseas applicants) should be sent to:\\ Mr P J F Scott, BA, MIPM\\ Director of Staffing Services\\ The University of Birmingham\\ Edgbaston \hfill Tel: 021 414 3841\\ Birmingham B15 2TT\hfill Fax: 021 414 7043\\ \PS \section {Further Information} \Ps For further information, or answers to specific queries, please contact Dr W P Dodd (021 414 3711), email W.P.Dodd@birmingham.ac.uk. All such informal approaches will be treated in the strictest confidence. The School of Computer Science has a World Wide Web directory of information which is accessible from the following URL http://www.cs.bham.ac.uk This includes pointers to information about courses, an online copy of the latest research booklet, pictures of the campus and our laboratories and contact names. The Academic Computing Service also provides a WWW service at http://www.bham.ac.uk This gives access to information about other Schools in the University, as well as more general information about the University. The two point to each other. Both of these information servers are constantly being updated and extended, but you may find some of the information slightly out of date. Please enquire by email or telephone if necessary. A growing subset of research papers produced in the school is being added to the school's ftp site in compressed postscript format. The address is: ftp://ftp.cs.bham.ac.uk/pub/dist/ THE UNIVERSITY OF BIRMINGHAM FACULTY OF SCIENCE PUBLICATIONS In order to assist the selectors in their assessment of your application, you are requested to list your publications under the main headings used by the HEFCE for the Research Assessment Exercise, as follows:- 1. Authored books 2. Edited books 3. Refereed Journal papers 4. Contributions to edited works 5. Review articles 6. Conference proceedings - refereed (not abstracts) 7. Conference proceedings - not refereed (not abstracts) Please list abstracts separately at the end if appropriate. \end{document}