Contributions are welcome!
_ _ _ _ _ _ _ _ _ _ _ _ _ _
date: 24 April 1995
e-mail to: amast@cs.utwente.nl
________________________
e-mailed to: 633 subscribers
Update of information in [AL0203M1] .
As anticipated in [AL0203M1] , a preliminary version of the AMAST'95 programme is available .
In addition, the AMAST'95 organizers wish to inform prospective attendees that plans are under way to initiate new and interesting research projects to be carried out by international research teams, in the framework of a long-term AMAST cooperation. Attendance to AMAST'95 could thus be beneficial for the proposal of research topics for those projects, and for the initial set-up of the international teams.
Reminder: the reduced-fee registration deadline is June 5, 1995.
Program Committee
Anton Nijholt (Enschede)
Maurice Nivat (Paris)
Teodor Rus (Iowa City)
The aim of this workshop is to bring together researchers on natural language, programming language and formal language theory, who have a common interest in the use of algebraic methods to specify syntactic, semantic and pragmatic properties of language.
Researchers from the three communities (formal languages, programming languages and natural languages) will be invited to present their results and discuss themes of interest, with a view to setting-up the basis for further cooperative research.
Update of information in [AL0103CA] .
The ASF+SDF'95 Call for Participation is available.
Over the past five years, a significant amount of research has been invested in the development of the ASF+SDF algebraic specification formalism, and the associated supporting system, the ASF+SDF Meta-environment. The formalism is characterized by its notational flexibility, and the system by its support for incrementality and rapid prototyping. Currently, experience with the (industrial) use of ASF+SDF is growing, relations with other approaches are being studied, and a variety of drastic extension plans is being launched.
The aim of this workshop is to bring together researchers and ASF+SDF users with an interest in the further development of ASF+SDF, and to provide a platform for sharing experiences, for explaining relations with other areas, and for discussing future directions.
The ASF+SDF'95 Program and Registration form can be found in the Call for Participation mentioned above.
Up-to-date information about the workshop can be retrieved via:
Update of information in [AL0103C7] .
The CCP'95 Preliminary Program & Registration is available.
Update of information in [AL0101C5] .
COLT'95 Program & Registration Information available.
The full version of this announcement quoted above is a short ascii summary of the information regarding this year's Colt conference.
Additional information, maps, ... can be obtained from the
- COLT'95 web page
Constructive suggestions of how to improve the COLT'95 web page are welcome, to be sent to
colt95@cse.ucsc.edu
Immediately following the Colt conference (on July 9-12) will be the Machine Learning Conference at Tahoe, CA. Some information of how to get to the ML'95 conference is provided on the COLT'95 web page; for more information see
- ML'95 web page
Update of information in [SIAN03p2-2] .
The FCT'95 Program & Registration Information is available.
The full announcement contains the FCT'95 Program (invited lectures, accepted papers, invited talks of the minisymposium on "Specification of time-critical systems"), the registration form and accommodation reservation form.
Deadline for early reservation: June 30, 1995.
One can also get the full version of the announcement by sending an e-mail at
fct95@tcs.inf.tu-dresden.de
Update of information in [AL0103CI] .
The Call for Participation is available as a LaTeX file.
Update of information in [AL0202CF] .
The JFPL'95 Appel a Participation (in French) is available.
Update of information in [AL0201C3] .
The LDPL'95 Program & Call for Participation is available.
Update of information in [AL0203M6] .
The LICS'95 Program and Registration Information is available in several formats (plain text, LaTeX, compressed DVI and PostScript), on the WWW or by anonymous ftp, resp. at the following URL's:
Update of information in [SIAN05p2-6] .
The MPC'95 Advance Program and Registration Information is available
in two forms: plain-text and LaTeX resp..
Update of information in [AL0201S1] .
The Program and Registration Information for STOC'95 is available on the STOC'95 WWW page .
Plain-text, LaTeX and PostScript versions (and lots of other information about the conference) are available.
Update of information in [AL0201C9] .
The Program and Call for Participation is available.
Update of information in [SIAN04p2-4] .
The list of accepted papers for CPM'95 is available.
Participating Conferences
Associated Events
Further Information The advance program and registration information are available online via the WWW page . and by anonymous ftp .
Participating Conferences. Goal of FLoC is to battle fragmentation of the technical community by bringing together synergetic conferences that apply logic to computer science. The following conferences will participate in FLoC: CADE (Conf. on Automated Deduction), CAV (Conf. on Computer-Aided Verification), LICS (IEEE Symposium on Logic in Computer Science), and RTA (Conf. on Rewriting Techniques and Applications).
Location. DIMACS will host the meeting as part of its Special Year on Logic and Algorithms. The meeting will take place at the College Avenue Campus of Rutgers University, downtown New Brunswick, NJ.
Program Chairs. Rajeev Alur (CAV), Harald Ganzinger (RTA), Michael McRobbie & John Slaney (CADE), Ed Clarke (LICS).
Conference Committee. Rajeev Alur (CAV local arrangements chair), Leo Bachmair (RTA), Amy Felty (CADE), Douglas Howe (publicity chair), Jon G. Riecke (LICS, conference committee chair).
Steering Committee. Members of the conference committee plus Steve Mahaney (DIMACS) and Moshe Y. Vardi (steering committee chair).
Further information is available on the WWW .
Call for Logos. The FLoC'96 organizing committee would like a logo for the FLoC WWW pages and for printed items such as posters and programs. The FloC logo should be suitable for displaying beside the full name of the conference. If it uses an acronym, it should use "FLoC". The logo should look good when rendered monochromatically.
Incentives. In addition to the fame, the winner will also receive congratulatory email and approving nods at FLoC'96.
Submissions should be sent by May 19, 1995, to the FLoC publicity chair: Doug Howe (howe@research.att.com), in some reasonably common electronic form, eg postscript. The winner will be announced on May 26.
Further Information. howe@research.att.com .
Topics. The workshop will be held as part of the activity of the European network "Complexity, Logic and Recursion Theory", EC Contract No. ERBCHRXCT930415. Several sessions will be devoted to the scientific activity of the network, covering topics that range from relative computability to structural complexity, randomness and arithmetic.
Invited Speakers
K. Ambos-Spies, J. Balcazar, S.B. Cooper, S. Wainer, P. Odifreddi,
P. van Emde Boas, F. Montagna, M. Arslanov, S. Goncharov, A. Kucera.
Short Courses
Further Information:
Andrea Sorbi, Dipartimento di Matematica
Via del Capitano 15, 53100 Siena Italy
E-mail: SORBI@UNISI.IT, Fax:39-577-263730
The full version of this information is available.
Magma is a new Computer Algebra system developed by the Computational Algebra Group at the University of Sydney. It is designed to support computations in abstract algebra and related areas such as number theory, geometry and combinatorics. The basic mathematical `engine' in Magma provides extensive machinery for the standard classes of groups, rings, fields, modules and algebras.
Magma was first released in December 1993, and has since undergone extensive further development. In particular, its ring and field theory facilities have recently been greatly enriched through the inclusion of modules from the highly regarded number theory systems KANT and PARI.
This workshop is intended to provide mathematicians with an overview of Magma with particular emphasis on its capabilities in rings, fields and modules. The specific goals are:
The lectures will be given in a laboratory equipped with workstations so that participants will be able to experiment immediately with the ideas being discussed. Registered participants will obtain a demo version of Magma, provided they have access to an appropriate platform.
The Magma workshop will immediately precede the CANT'95 conference, also at Macquarie University. To register for either of these, send electronic mail to
cant95@mpce.mq.edu.aurequesting a hard-copy registration form. The fee for the Magma workshop is $25.
The full version of this announcement contains the program of the workshop and short abstracts of the talks.
For further information about the Magma System, send e-mail to
magma@maths.su.oz.au
The full version of this announcement is available.
Workshop organized by Tandy Warnow (Computer and Information Science, U. of Pennsylvania) and Don Ringe (Linguistics, U. of Pennsylvania).
Tentative schedule (including time for discussion after each talk):
Monday, April 17
Tuesday, April 18
All sessions will be held in the large conference room at Institute for Research in Cognitive Science, 3401 Walnut St., West Entrance, 4th Floor. The public is invited to attend. Information about accomodations is available in the full version of this announcement.
Update of information in [AL0203CF] .
The full version of the FST&TCS'95 2nd Call for Papers is available
in two forms: plain-text and LaTeX resp..
Update of information in [AL0201CA] .
The (LaTeX) GD'95 2nd Call for Papers & Demos is available.
Update of information in [AL0101C7] .
The IRREGULAR'95 Final Call for Papers is available in two forms:
plain-text and LaTeX respectively.
Update of information in [AL0103C3] .
The LOPSTR'95 Call for Papers is available in two forms:
plain-text and LaTeX respectively.
More information on this workshop is available on the WWW .
Update of information in [AL0202CA] .
The RTSS'95 2nd Call for Papers is available.
Up-to-date information is kept in the RTSS'95 WWW home page .
Update of information in [AL0203CA] .
The (LaTeX) SAS'95 Final Call For Papers is available.
Details are also available on the WWW .
Update of information in [AL0203C5] .
Reminder: The submission deadline for SEGRAGRA'95 is:
April 21, 1995
Update of information in [AL0203C6] .
The submission deadline for SIROCCO '95 has been extended to:
17 April 1995
Topics. This conference series explores general topology with an emphasis on the connection between it and other areas of mathematics. This year, topology in computer science (especially domain theory and digital topology), in algebra (via valuation theory) and in topological and Lie group theory will receive particular attention.
Invited Speakers. Zoltan Balogh, Peter Collins, Horst Herrlich, Jimmie Lawson, Stephen Watson, Ta-Sun Wu.
Special Sessions
Workshops
Submissions. Titles and abstracts for 25-minute contributed talks are due by June 15. These should not exceed 18 lines of (12-point) text. Send them (preferably in TeX, by e-mail) to: top95@usm.maine.edu, or to Bob Flagg, at the address given below.
Further Information.
Bob Flagg, U. of Southern Maine, Portland, ME 04103, USA
Phone: 207-780-4721. Fax: 207-780-4933. E-mail: top95@usm.maine.edu
- WWW
The full version of this Call for Papers is available.
General Chairman: Lawrence J. Fogel, Natural Selection, Inc.
The conference will serve as a forum for researchers investigating applications and theory of evolutionary programming and other related areas in evolutionary and natural computation.
Topics. Evolutionary programming, evolution strategies, genetic algorithms & genetic programming, artificial life, cultural algorithms, and other models that rely on evolutionary principles. Specific topics include but are not limited to the use of evolutionary simulations in optimization, neural network training and design, automatic control, image processing, and other applications, as well as mathematical theory or empirical analysis providing insight into the behavior of such algorithms. Of particular interest are applications of simulated evolution to problems in biology.
Submissions. Papers which describe original unpublished research in the conference topics. No electronic submissions. Other requirements in the full version of this announcement. Send 5 copies of paper to:
Thomas Baeck, Informatik Centrum Dortmund
Joseph-von-Fraunhofer-Str. 20, D-44227 Dortmund, Germany
Email: baeck@home.informatik.uni-dortmund.de
Peter J. Angeline, Loral Federal Systemsor
1801 State Route 17C, Mail Drop 0210, Owego, NY 13827
Email: pja@lfs.loral.com
Thomas M. English, Computer Science Dep't, Texas Tech Univ.
Lubbock, Texas 79409-3104. Email: english@cs.ttu.edu
Authors outside Europe or the United States may send their paper to any of the above Technical Chairmen at their convenience.
Publication shortly after completion of the conference.
Dates. Subm: Sep. 26, '95; Notif: Nov. 30, '95; Final: Feb. 29, '96
Award for Best Student Paper. See full version of the announcement.
Topics. The workshop is intended to bring together researchers to discuss the integration of logic-based approaches with temporal or dynamic object bases. Suggested topics are (but are not limited to): temporal specification and verification of object-based systems, deduction in temporal databases, logical frameworks for transactions in deductive and object-oriented databases, temporal constraints in deductive and object-oriented databases, non-standard logics for modeling temporal aspects of deductive and object-oriented databases.
Program co-chairs
Jose Luiz Fiadeiro, Department of Informatics, Faculty of Sciences
University of Lisbon, Campo Grande, 1700 Lisboa, Portugal
E-mail: Jose.Luiz.Fiadeiro@di.fc.ul.pt
Gunter Saake, Univ. Magdeburg, Inst. Technical Information Systems
P.O. Box 4120, D-39016 Magdeburg, Germany
E-mail: saake@iti.cs.uni-magdeburg.de
Program Committee. Jose Carmo, Weidong Chen, Jose Fiadeiro, Dov Gabbay, Udo Lipeck, Gunter Saake, Interpal Singh Mumick, Zoltan Somogyi, V.S. Subrahmanian, Kian-Lee Tan, Alexander Tuzhilin, Roel Wieringa, Beat Wuthrich.
Submissions. Electronic submission (PostScript only) of extended abstracts (no longer than 10 pages) to conrad@iti.cs.uni-magdeburg.de . In case electronic submission is not possible, send four hardcopies to
Stefan Conrad (TRDOOD'95)The deadline for submissions is June 1, 1995.
University of Magdeburg, Institute for Technical Information Systems
P.O.Box 4120, D-39016 Magdeburg, Germany
Further Information: conrad@iti.cs.uni-magdeburg.de, or see the WWW page .
The full version of this Call for Papers is available in two forms:
plain-text and LaTeX respectively.
Conference co-Chairs. S Goto (NTT, Japan), J Jaffar (IBM Yorktown, USA), K Kanchanasut (AIT, Thailand).
Organizing Committee. D Bjorner (UNU/IIST, Macau), J-J Levy (INRIA, France), K Nori (Tata RDDC, India), H N Phien (AIT, Thailand).
The conference is intended to provide a forum in Asia for researchers in computer science. A major goal of ACSC is to foster communication and cooperation among the diverse communities involved in the practice and theory of computing, including those involved in systems, languages and applications. It is expected that every accepted paper will be presented at the conference and included in the proceedings which is expected to be published in the Lecture Notes in Computer Science series by Springer-Verlag.
Topics. Contributed papers presenting original research in the following areas of computer science (but not exclusive) are sought: Algorithms; Knowledge Representation and Automated Reasoning; Specification Languages and Software Verification; Parallel, Networking and Distributed Systems; Databases; Reactive Systems.
Submissions. Full papers (in English, up to 18 pages, 12pt) to:
Kanchana KanchanasutIf ordinary mail is used, five copies of the paper should be sent by express or courier mail. Electronic submission is encouraged via e-mail (PostScript(tm) printable files), but a printed reference copy should be sent by post. See full version for further submission requirements.
Computer Science Program, Asian Institute of Technology
Km. 42 Paholyothin Highway, Klong Luang, Pathumthani 12120, Thailand
Phone: +66 2 524 5703, Fax: +66 2 524 5721, E-mail: kk@iist.unu.edu
Dates. Subm: 15 June 1995, Notif: 20 Aug. 1995, Final: 1 Sep. 1995
Conference Format. The conference will be three days long from Monday to Wednesday, and will include several tutorials and invited talks. See the full version for further information.
The (LaTeX) original Call for Papers is available.
Original papers are solicited on all aspects of Theoretical Computer Science. Topics include (but are not limited to): algorithms and data structures; automata and formal languages; computability, computational algebra & geometry; computational complexity; cryptography; databases; data types; logic programming; machine learning; parallel & distributed computation; program specification, transformation and verification; semantics of programming languages; theory of concurrency.
Submissions. Send 15 copies of an extended abstract, max. 10 pages (double-spaced) to the Program Chair at the address given below. The abstract should clearly indicate achieved results, their significance, and their relation to other work in the area.
Dates Subm: May 19, 1995; Notif: July 18, 1995;
Program Chair:
Alfredo De Santis, Dip. Informatica ed Appl., Universita` di SalernoE-mail: ICTCS95@udsab.dia.unisa.it phone +39 (0)89 965329, Fax: +39 (0)89 965272
I-84081 Baronissi (Salerno), Italy
A WWW page for this conference has been installed. This page will contain information and latest news.
Organizing Chairman:
Antonio Gisolfi, Dip. Informatica ed Appl., Universita` di Salerno
I-84081 Baronissi (Salerno), Italy
E-mail:gisolfi@udsab.dia.unisa.it
phone +39 (0)89 965212, Fax: +39 (0)89 965272.
Program Committee. Giorgio Ausiello (Roma), Simonetta Balsamo (Udine), Domenico Cantone (Catania), Crespi Reghizzi (Milano), Aldo de Luca (Roma), Rocco De Nicola (Roma), Alfredo De Santis (Chair,Salerno), Roberto Gorrieri (Bologna), Concettina Guerra (Padova), Fabrizio Luccio (Pisa), Giorgio Levi (Pisa), Maurizio Martelli (Genova), Pierangelo Miglioli (Milano), Simonetta Ronchi della Rocca (Torino), Domenico Sacca` (Cosenza).
The full version of this Call for Papers is available.
This conference, the first of an annual series, will serve as the premier international forum addressing networks, systems, algorithms, and applications that support the symbiosis of portable computers and wireless networks. Technical papers describing previously unpublished, original, completed, or in-progress research, are solicited on topics at the link layer and above. A non-exhaustive list of topics is given in the full version of this announcement.
All papers will be refereed by the program committee. Accepted papers will be published in proceedings. Papers of particular merit will be selected for publication in the ACM/Baltzer journal Wireless Networks.
Tutorials. Proposals for tutorials are solicited. Evaluation will be based on expertise and experience of instructors, and relevance of subject matter. Potential instructors are requested to submit at most 5 pages, incl. biographical sketch to Krishan Sabnani (kks@big.att.com).
Panels are solicited that examine innovative, controversial, or otherwise provocative issues of interest. Panel proposals should not exceed 3 pages, including biographical sketches of the panelist.
Submissions. Paper submission will be handled electronically. Authors should email a PostScript version of their full paper to:
mcn95-submission@cs.columbia.eduThis Email address will become operational on March 1. The address will be backed by software that can test submissions for printability. See the full version of this announcement for more details about this.
Dates. Subm: Apr. 17, '95; Notif: June 16, '95; Final: Aug. 14, '95
Student Participation. Papers with a student as a primary author will enter a student paper award competition. A cover letter must identify the paper as a candidate for the student paper competition.
Further Information. The CfP and other ACM related activities may be found on the WWW .
For more information please contact Dan Duchamp (djd@cs.columbia.edu) or Baruch Awerbuch (baruch@blaze.cs.jhu.edu), the Program Co-Chairs.
The full version of this information is available.
The aim of the workshop is to be a meeting point between research and industry and between theory & practice. Research papers and industrial usage reports as well as proposals for tutorials (advanced technology seminars), poster displays and tool demonstrations are requested.
Topics of interest include, but are not limited to: Methodology and architecture, Test sequences generation and test results analysis, Practical testing experience, Formalization and theory for testing, Tools and tool support, Testing for high-speed & multimedia protocols, ATM and ODP testing, Mobile and Intelligent Network Protocol Testing.
Conference Co-Chairs
Prof. Ana Cavalli and Prof. Stanislaw Budkowski
INT - Dept LOR, 9, rue Charles Fourier, 91011 Evry Cedex
Tel: +33-1-60764427 Fax: -60783927 Email: Ana.Cavalli@int-evry.fr
Tel: +33-1-60764720 Fax: -60783927 Email: Stan.Budkowski@int-evry.fr
Submissions. Full original papers, in English, 16-page max., 12pt. Indicate whether paper is submitted for oral or poster presentation. In case of poster presentation the submitted paper may be reduced to 5 pages. All submitted papers will be reviewed and selected by the Program Committee. All submissions (5 copies) should be sent to one of the Conference Co-Chairs. Further submission requirements are in the full version of this announcement. The posters will be displayed in front of the Conference Room(s). Each presenter will be requested to be at his/her poster board during the Poster Sessions. Display board will be provided for the poster presentations (115cm wide and 85 high).
Proceedings. A participant proceedings will be made available at the workshop; the final proceedings will be published by the official publisher of IFIP. The accepted papers not presented by the authors at the workshop will not be included in the final proceedings.
Dates. Subm: April 15, '95; Notif: June 15, '95; CRC Participants' Proc.: July 10,'95; Final CRC: September 4, '95
Expression of interest in IWPTS'95: see form in the full version.
The full version of this Call for Papers is available in two forms:
plain-text and LaTeX respectively.
Aim of this workshop is to bring together people who are interested in computational aspects of analysis, to discuss related issues. Main focuses will be the state of the art in computability and complexity theory of analysis, with the emphasis on Turing machine based theory, as well as comparison of different models of computation for analysis. In particular, discussions in the direction of whether there is (can or should be) a standard foundation of computability and computational complexity in analysis (i.e., an extension of Church's Thesis on real-valued computation) are encouraged.
Topics (not exclusive): computability in analysis; computational complexity in analysis (both with emphasis on models based on Turing machines); foundations of computable analysis; presentation and comparison of models of computation in analysis.
Organizers
Ker-I Ko, Department of Computer Science, State Univ. of New York
Stony Brook, NY 11794, USA. Tel: (516)632-8460. Fax: (516)632-8334.
Email: keriko@cs.sunysb.edu
Klaus Weihrauch, Theoretische Informatik I, FernUniversität
D-58084 Hagen, Germany. Tel: +49-2331-9872722. Fax: +49-2331-987313.
email(workshop): cca@fernuni-hagen.de
Submissions. Participants who wish to give a talk must send an extended abstract (ca. 5-10 pages) as a hardcopy by mail or a printable PostScript file by email to one of the organizers, by August 4, 1995.
Copies of the abstracts will be available at the meeting and will be published later as a technical report.
Registration. Please fill out the form which is included in the full version of this Call and send it by mail or email to K. Weihrauch before August 10, 1995. You will get traveling and hotel information. Early hotel reservation is recommended.
Further Information. A WWW page for this workshop has been installed.
Two Research Assistanships are available at the Industrial Engineering Department at Louisiana State University, Baton Rouge, LA. Each assistanship offers $8,000 for 9 months and a potential for a tuition waiver. The assistanships are for 3 years and will start in the Fall of 1995.
We are looking for highly qualified Ph.D. students with areas of expertise in Operations Research and AI. These students will be doing research in the areas of inductive inference, machine learning and discrete optimization. They will be working for a project recently funded by the U.S. Navy.
The students will become members of a larger research group, comprised by 4 more Ph.D. students and 3 faculty of the Industrial Engineering Department. Louisiana State University offers many state of the art computational facilities, including an IBM 3090 mainframe and many Unix machines.
Interested candidates must first send their CVs/Transcripts to the following address:
Professor Evangelos Triantaphyllou
Department of Industrial Engineering
3128 CEBA Building
Louisiana State University
Baton Rouge, LA 70803-6409
U.S.A.
Phone: (504) 388-5372
FAX: (504) 388-5990
E-mail: IETRIAN@LSUVM.SNCC.LSU.EDU
The University invites applications for one permanent and two temporary lectureships in the Department of Computing Science. This Department is top-rated for both teaching and research.
Applicants should possess the enthusiasm and ability to fit into a dynamic academic environment, and should show considerable promise in both teaching and research. Applicants for the permanent lectureship should also have substantial experience in both teaching and research.
In 1995-96 the Department will launch a new MSc course in Advanced Information Systems, covering databases, information retrieval, and multimedia. For two of the appointments, preference will be given to applicants who can demonstrate expertise in at least one of these areas. Strong applications in other areas that match departmental interests are also welcomed.
The permanent lecturer will be appointed on the Lecturer A or B scale (#14,756-25,735 p.a.), at a point determined by age, experience, and ability. The temporary lecturers will be appointed on the Lecturer A scale (#14,756-19,326 p.a.). One temporary appointment will be tenable for three years in the first instance, the other for one year in the first instance. If the applicants are strong enough, consideration will be given to increasing the number and length of these appointments.
Informal enquiries may be made to the Head of Department, Dr David Watt, e-mail daw@dcs.gla.ac.uk . Information about the Department may be found from its WWW page .
Further particulars may be obtained from the Academic Personnel Office, University of Glasgow, Glasgow G12 8QQ, Scotland (tel. 0141 330 5161, fax 0141 330 4921).
Applications (three copies from UK applicants, one copy from overseas applicants) must be sent to this address by 21 April 1995.
Each application must be accompanied by a curriculum vitae, list of publications, and names and addresses of three referees. In all correspondence please quote reference number 8675.
This research studentship commences in October 1995. Full funding is given to students with UK residential qualifications; EC citizens do qualify, and get fees, but no grant, so it seems unlikely to be appropriate more generally.
The work will apply 2-categories and 2-groupoids in areas as in the title, and in areas related to aspects of computer science. It is expected to involve symbolic computation with AXIOM, GAP, MAGMA.
The School of Mathematics has a networked Research Laboratory with a DEC Alpha 2100 server, model 4/200, supported by EPSRC and University grants.
Fuller details, including the case for the proposal, are on WWW .
Further information:
Prof R. Brown
School of Mathematics
Dean St
University of Wales
Bangor
Gwynedd LL57 1UT
UK
Tel: (direct) +44 248 382474
(office) +44 248 382475
Fax: +44 248 355881
email: mas010@bangor.ac.uk
- WWW for maths
Oxford Parallel, the Parallel Applications Centre of the University of Oxford, is a major centre for industrial applications of parallel computing. It is pioneering a new approach to the development of architecture independent software for scalable parallel computing systems, based on the bulk synchronous parallel (BSP) model. Oxford Parallel now seeks to appoint three new research officers to work on two new projects in this area. Both projects will run for three years from April 1995, directed by Bill McColl. They are both funded by the UK Engineering & Physical Sciences Research Council. Salary will be on the experience related RS1A scale, currently 13,941-20,953 pounds/annum
The first project "A BSP Programming Environment" is primarily concerned with the design and implementation of BSP software tools. The aim is to produce an integrated environment for the support of BSP programming, with training, benchmarking, debugging, performance analysis and prediction, data partitioning and superstep transformation facilities. For this project we seek two researchers, preferably with a Ph.D. or M.Sc. in computer science, who have experience in software tool development. Experience in parallel programming is desirable, but not essential.
The second project "Design, analysis and implementation of BSP algorithms" is concerned with the development of a comprehensive and integrated library of BSP algorithms for computationally intensive problems. For this project we seek a researcher, preferably with a Ph.D. in computer science, who has experience in parallel algorithms and their implementation.
To apply for any of these three posts, please email a brief C.V. (ASCII text only, no more than three pages) and the names and (email) addresses of two referees to: bsp-jobs@comlab.ox.ac.uk .
The email should be sent before 13 April 1995 for full consideration. All three posts are available immediately. Some papers giving further information about the BSP approach are available .
More information is available on the WWW about
The Department of Computer Science has strong well-resourced research groups in several mainstream areas of computer science including artificial intelligence; computer graphics; virtual reality; distributed and parallel systems; human computer interaction; programming and the theory of computation. The Department was rated 4A in the last research assessment exercise; and we are strongly committed to greater research excellence.
The Reader will be expected to have a distinguished research reputation with demonstrable experience of research direction and leadership, and to be an enthusiastic teacher. Applicants in any area of computer science are encouraged to apply, although we particularly welcome those with research relating to the work of the Department that combines theory and application.
The Department has a number of modular degree programmes in the University of London degree system. There is an MSc in Advanced Methods in Computer Science, with four streams based on the research expertise within the Department. The Department also runs a conversion MSc in Information Technology jointly with the Department of Electronic Engineering.
Informal enquiries can be made to Mel Slater (Head of Department) on 0171-975 5242 (email mel@dcs.qmw.ac.uk). Further information can be obtained on the WWW .
For an application form and further details of this post, please telephone 0171-975 5171, quoting reference number 95044.
Applications should be returned by 28th April 1995 to the
Recruitment Coordinator
Queen Mary and Westfield College
London E1 4NS
The School of Computer & Information Science is the principal centre for teaching and research in computer science and software engineering at the University of South Australia. It has made rapid progress over the last five years to become a leading centre for teaching and research in Information Technology. The research profile of the School has been strengthened by the recent appointment of two new professors and now has 26 academic staff, approximately 450 students and offers a full range of awards from Associate Diploma to Doctorate.
The research activities in computing and advanced software engineering at the University of South Australia are based in the Advanced Computing Research Centre (ACRC), one of nine newly funded research centres at the University. The designated research areas of the ACRC are software engineering, database systems, concurrent systems and artificial intelligence/expert systems.
We are seeking to appoint an Associate Professor with a research background which will strengthen the above research areas. The appointee will have a substantial research record, including publications and research grants, and will have demonstrated abilities to create and manage a successful research team, including the necessary leadership qualities. Essential criteria include a doctorate in computer science or closely related discipline or equivalent accreditation and standing, an outstanding research record, preferably in one of the research areas listed above, and a record of teaching excellence in a tertiary education environment.
Applicants must obtain position description & lodgement details from Dr John Roddick, Head of School, tel. 08 3023463, fax 08 3023988, email roddick@cis.unisa.edu.au . Informal enquiries and information related to the ACRC may also be directed to Professor George Milne, Director, tel. 08 3023943, fax 08 3023988, email milne@cis.unisa.edu.au
Closing date: 5.00pm Friday 12 May 1995.
The University reserves the right to invite application, or not to make an appointment. The University is an Equal Opportunity Employer
DIMACS invites applications for a NSF Research Experience for Undergraduates (REU) program. DIMACS is one of 25 Science and Technology Centers funded by the NSF. It is located at Rutgers University, and is a joint project of Rutgers Princeton, AT&T Bell Laboratories, and Bellcore. DIMACS has over 120 permanent members in mathematics, computer science, and operations research, and hosts many distinguished visitors each year.
The program begins with eight weeks of intensive work during the summer of 1995 and continues through the academic year 1995-96. Up to five undergraduates will be selected to participate. Each will have a DIMACS faculty member as a supervisor. Research topics this year will include computational biology, combinatorial optimization, combinatorics, computational geometry/graphics, and computational group theory. The timing of the eight-week summer work period is to be arranged by the student and supervisor, during June - August, 1995. The program will provide each student with a stipend funded by the NSF which includes summer living expenses and travel.
Applicants should be undergraduates with a major in Computer Science, Mathematics, or a closely related field. They should be current juniors (graduating in 1996), although sophomores with exceptionally strong backgrounds will be considered. Preference will be given to students who will continue their research projects during the academic year, under the direction of either their supervisor or a faculty member from their home institution. NSF requires that recipients be U.S. Citizens or permanent residents.
For a copy of this announcement, list of supervisors & projects, and an application, send an email to reuappl@dimacs.rutgers.edu (material will be sent automatically), or write to:
Ida Castellano - REU program, DIMACS, Core 406, Busch campusor see the WWW DIMACS home page .
Rutgers University, Piscataway, NJ 08855-1179
Tel: 908-445-5932, Fax: 908-445-5928, Email: ida@dimacs.rutgers.edu
Applications Due - April 17, 1995
The full version of this announcement is available.
The European Institute in the Logical Foundations of Computer Science invites applications for PostDoctoral Fellowships. These can be held for periods ranging from six months to one year. The goal of the work in the Institute is to achieve a unified and applicable theory of the semantics and logic of languages used to describe, design and program computing systems. The research of the Insititute is characterised by a unified approach to foundational problems that emphasises the combination of ideas arising in design and practice with ideas originating in logic and allied mathematical areas. The applicability of the ideas developed is demonstrated by producing experimental systems for specification, verification and development.
The research has both national and EC support, with involvement in several ESPRIT Basic Research Actions, including CONFER, CONCUR, COMPASS, Categorical Logic in Computer Science and Types for Proofs and Programs. Research Topics of Interest include: Semantics of Programming Languages; Logic Programming Theory; Object-Oriented Programming; Functional Programming Theory; Lambda-Calculus; Formal Development of Programs and Systems; Concurrency Theory.
The Institute sites are:
Applications must be sent to the prospective host site. More general information on the Institute or the fellowship programme may be requested from Gordon Plotkin <gdp@lfcs.ed.ac.uk> (scientific information), or George Cleland <g.cleland@lfcs.ed.ac.uk> (administrative information).
The Department of Management at Ball State University in Muncie is looking for a visiting faculty member in information systems.
The appointment is for the academic year 1995-96 beginning August 19, 1995 and ending May 10 (around), 1996. It is ideally suited for those who want to take a sabbatical from their present position and want to work in a different environment.
The ideal candidate will have interests in Data Base Management, Telecommunication Networks, and Technology Management, perhaps an overlap with Operations Management in the business schools.
Rank and salary are open but may be constrained because of the nature of the appointment.
Contact Jeet Gupta at the following address and e-mail as soon as possible.
Jeet Gupta
Professor and Chairman
Department of Management
Ball State University
Muncie, IN 47306, USA
317-285-5301 (office)
317-747-9105 (home)
317-285-8024 (FAX)
e-mail 00jngupta@bsuvc.bsu.edu
In September 1995 there will be a number of Ph.D. positions in Operations Research available at the Mathematical Research Institute (MRI). The MRI is the cooperation between the Mathematical Departments of the Universities of Groningen, Nijmegen, Twente and Utrecht in the Netherlands.
Deadline for applications: 1st May, 1995
Application forms may be obtained (via e-mail) from either of
MRIphd@math.rug.nl
An der Technischen Universität München in der Fakultät für Informatik ist zum nächstmöglichen Zeitpunkt die Stelle einer Universitätsprofessorin/- eines Universitätsprofessors der BesGr. C 3 für Theoretische Informatik zu besetzen.
Zu den Aufgaben gehört die Vertretung des Fachgebietes in Forschung und Lehre. Bewerberinnen/Bewerber sollen sich in einem oder mehreren der folgenden Gebiete international ausgewiesen haben:
Einstellungsvoraussetzungen sind ein abgeschlossenes Studium an einer wissenschaftlichen Hochschule, pädagogische Eignung, Promotion und Habilitation oder der Nachweis gleichwertiger wissenschaftlicher Leistungen. Die Bewerberin/der Bewerber darf das 52. Lebensjahr zum Zeitpunkt der Ernennung noch nicht vollendet haben. Schwerbehinderte werden bei gleicher Eignung bevorzugt berücksichtigt.
Die Technische Universität strebt eine Erhöhung des Anteiles von Frauen in Forschung und Lehre an und fordert deshalb qualifizierte Wissenschaftlerinnen nachdrücklich auf, sich zu bewerben.
Bewerbungen sind mit den üblichen Unterlagen (Lebenslauf, Zeugnisse, Urkunden, Schriftenverzeichnis einschliesslich ausgewählter Sonderdrucke) beim Dekanat der Fakultät für Informatik, Technische Universität München, 80290 München, einzureichen.
Bewerbungsende 8 Mai 1995.
Prof. Ernst W. Mayr, Lehrstuhl Effiziente Algorithmen
Institut für Informatik, TU München, 80290 München, Germany
Tel: +49-89-2105-2680, Secr: +49-89-2105-2681, Fax: +49-89-2105-5297
Email: mayr@informatik.tu-muenchen.de
- WWW
Qualifications
Work: linguistic engineering, consultancy, technical activities, product evaluation.
Preferably some experience. Job applications (in Dutch or English) to
PolyDoc N.V., Mr. Arjen Narinx, EBC/MECC office building
P.O. Box 1637, NL-6201 BP Maastricht, The Netherlands
For further information please contact Mr. Arjen Narinx:
phone: + 31 43 821574, e-mail: NARINX@XS4ALL.NL
PolyDoc N.V. The company was founded 1993 by an international group of experienced professionals in the fields of information technology, automation, document production, process redesign, linguistics and above all the creation of new business.
Aims and objectives
To enhance clients' competiveness in the global market by: reducing the costs and improving the productivity of international document creation and management; reducing time to market; ensuring conformity to total quality and legal liability of products and services.
PolyDoc aims to create an advanced worldwide teleservice that will enable companies and organisations tot make use of language technology on demand and on-line: a LangTech teleservice. A start has been made by introducing the TeleTaal service in the Netherlands in 1994.
PolyDoc also aims to create architectures for document production by means of a combination of workflow and language support. These architectures provide a completely integrated system for document production with tailor-made document flow support and language technology support on demand.
In keywords. Improvement of document production processes. Multilingual, correct documents. LangTech teleservice. Integration of workflow & language technology. Prefab workflows. Platform independent. Worldwide, focus on Europe. EC and Eureka! support.
Applications are invited for two Lectureships in the Computer Science and Artificial Intelligence Group: one permanent and one two-year fixed-term post. The persons appointed will be members of of the School of Cognitive and Computing Sciences (COGS). The Group is highly rated (awarded the highest rank in each of the last two research-assessment exercises).
The permanent vacancy is for a theoretical computer scientist, to replace Dr Edmund Robinson (now professor-elect of the University of London). Theoretical computer science is one of the group's chief areas of research strength with particular interests in the semantics of programming languages and theories of concurrency.
The fixed-term post replaces a member of staff on secondment. Appropriate subject specialisms include software engineering, software design, human-computer interaction and CSCW. Involvement with our innovative MSc in Human-Centred Computer Systems is likely.
Salaries will be on the 1A or 1B scale.
Application forms may be obtained from
Ms Victoria Lay, Personnel Office, Sussex House
University of Sussex, Falmer, Brighton BN1 9RH
Tel. (01273) 678201; fax (01273) 678335.
Technical questions about the posts may be directed to
Dr Geoffrey Sampson, Computer Science and Artificial Intelligence
University of Sussex, Brighton BN1 9QH
Tel. (01273) 678525; fax (01273) 671320; geoffs@cogs.susx.ac.uk
Closing date for receipt of applications: 5th May 1995.
Applications are invited for a number of fellowships for research in mathematics at the Mathematical Institute of Oxford University.
Conditions. Applicants must be citizens of one of the member states of the European Community, other than the United Kingdom, or residents of the Community; similar rules apply to applicants from several non-member states which participate in the HCM program (Austria, Switzerland, Sweden, Norway, Finland, Iceland).
The activity is intended primarily for the benefit of young researchers at post-doctoral level, defined as researchers having at least six years of higher education and who hold a doctorate or an equivalent degree, or have had two or more years of research experience following a post-gradute course.
Applications. These must include a c.v., list of publications, concise description of research interests, letters of recommendations and/or names of 3 referees, and should reach:
Professor B.J. Birch, Chairman of Mathematics
Mathematical Institute, 24-29 St Giles, Oxford OX1 3LB
Tel: 01865 273528, Fax: 01865 273583, e-mail: birch:maths.ox.ac.uk
Application deadline: 30 April 1995.
Duration of fellowship: 6-12 months, exceptionally 24 months.
A committee will make an initial selection of the Fellows in May '95. Scientific information is available from the following people:
Algebra and Number Theory: Professor BJ Birch and Dr R Heath-Brown
Tel: 01865 273528 / 273557, e-mail: birch@maths.ox.ac.uk
Geometry: Professor S.K. Donaldson
Tel: 01865 273540, e-mail: donaldso@maths.ox.ac.uk
Logic: Professor A.J. Macintyre and Dr A.J. Wilkie
Tel: 01865 273535 / 273539, e-mail: {ajm,wilkie}@maths.ox.ac.uk
General Relativity and Twistor Theory: Professor Sir Roger Penrose
Tel: 01865 273544, e-mail: val@maths.ox.ac.uk
Combinatorics and Optimisation: Professor D.J.A. Welsh
Tel: 01865 273529, e-mail: dwelsh@maths.ox.ac.uk
The full version of this announcement is available.
Applications are invited for a permanent Lectureship and a two year Research Fellowship in the School of Computer Science.
The Theory of Computation group, of which the successful candidates for the two posts will be members, concentrates on the development of logics and semantics for programming languages. See the full version for further information on the group's research activities.
Applicants for the Lectureship should be enthusiastic researchers, and must have a proven research record, preferably in one of the following areas: (Typed) lambda calculus, Type theory, Calculi and logics for concurrent processes. Candidates with expertise in areas consistent with the aims of the group are also encouraged to apply.
See the full version for the expected contribution by the successful candidate to the teaching programmes within the School.
Applicants for the Postdoctoral Fellowship will be expected to work with Professor Jung in the area of semantics of databases. To ensure successful collaboration, candidates should have, or be willing to acquire, knowledge of at least one of the following areas: Incomplete information in databases, Complex objects, Query languages for complex objects, Type systems for programming languages. Candidates who have well-defined research programmes of their own that they want to pursue in collaboration with the Theory group are also encouraged to apply.
The closing date for applications is 5th May 1995. It is expected that interviews will be held during May or June. See the full version for further details, such as: starting dates, salary, availability of application forms and of further particulars, equal opportunity policy.
Informal enquiries should be directed to Achim Jung (email A.Jung@cs.bham.ac.uk) or Marta Kwiatkowska (tel +44 (0)121 414 7264; email M.Z.Kwiatkowska@cs.bham.ac.uk).
The particulars are also available by ftp (files theoryposts95.dvi and theoryposts95.ps.Z).
Additional information about the School of Computer Science and the U. of Birmingham is accessible via WWW .
The full version of this announcement is available.
Applications are invited from students with good undergraduate degrees in Computer Science or Mathematics to join the Theoretical Computer Science group of the School of Cognitive and Computing Sciences, to study towards a D.Phil. degree. Two scholarships are available for suitably qualified candidates for the October 1995 entry. These cover tuition fees (up to the level payable by HEC students) and maintenance for three years. The level of the maintenance grant is linked to the standard grant offered by EPSRC which for 1994/95 was set at 4910 pounds per annum.
Scholarship I: This is an Earmarked Studentship awarded by the EPSRC Mathematics Programme. The successful candidate will be expected to work on the project: Algebraic structures for modelling concurrent and functional computation.
The object of this project is to develop the appropriate mathematical framework within which fully abstract denotational models for high-level languages combining functional and distributed computation can be constructed using appropriate domain equations.
Scholarship 2: This is funded directly with by the School of COGS. For this scholarship the research project is open but must complement the current research interests of the faculty in the School working in Theoretical Computer Science.
Further Information
A list of current Computer Science Technical Reports is available by:
More detailed information on the two studentships is available from matthewh@cogs.susx.ac.uk
General information about postgraduate studies is contained in the booklet COGS Postgraduate Research 1995 , available on WWW or a hardcopy may be obtained from lindat@cogs.susx.ac.uk
How to Apply. See the full version of this announcement.
Wellesley College is seeking applicants for a one-year visiting assistant professorship in computer science. Applicants should have a Ph.D. in computer science or be close to its completion. The candidates should be able to teach undergraduate courses in introduction to computer science using pascal, machine organization, and operating systems.
Wellesley College is a private, liberal arts college for women that places heavy emphasis on excellence in teaching as well as research. The college offers both a major and a minor in computer science, and has a cross-registration program with M.I.T. that dramatically increases the resources and curricular options available to its faculty and students.
Wellesley College has a networked campus. Academic computers on the campus-wide network include a 1024-node MasPar, a VAX cluster, SUN, DEC and IBM RISC workstations, and a Macintosh classroom that is dedicated to computer science instruction. In addition, Apple Macintosh and IBM PCs and compatibles are distributed around campus in microcomputer labs, faculty offices and research labs. Wellesley also has a high-speed connection to the Internet.
Located thirteen miles west of Boston near a high concentration of computer research institutions, Wellesley provides a unique combination of access to a major urban center and consulting opportunities while retaining a sense of the country by its 500-acre campus, lake and woodlands.
Candidates interested in this position should submit a curriculum vitae and arrange for three letters of recommendation to be sent by April 30, 1995 to:
P. Takis Metaxas, Chair
Department of Computer Science
Wellesley College
Wellesley, MA 02181
pmetaxas@wellesley.edu, fax: 617-283-3642
Wellesley College is an equal opportunity/affirmative action employer and welcomes applications from women and minority candidates.
The applicant must be registered as a Professional Engineer of Ontario or become registered within three years of his/her appointment.
The applicant will be required to teach general undergraduate courses in the Electrical and Computer Engineering Department as well as teaching graduate courses in his/her speciality.
The successful applicant will be expected to do research on methods and tools for increasing the quality of software. Expertise in communication networks and other real-time software would be especially valuable.
McMaster University has an employment equity programme that encourages applications from all qualified candidates including women, aboriginal people, persons with disabilities and racial minorities. In accordance with Canadian Immigration requirements, priority will be given to Canadian citizens and permanent residents of Canada. These positions are subject to final budget approval.
Applications including a curriculum vitae and the names of three referees should be sent to:
Dr. D.R. Conn, Chair
Department of Electrical and Computer Engineering
McMaster University
1280 Main Street West
Hamilton, Ontario, Canada L8S 4L7
Telephone: 905-525-9140, ext. 24826
Telefax: 905-523-4407
email: conn@ece.eng.mcmaster.ca
Deadline for applications July 31, 1995
Update of information in [SIAN01p1-3] .
The Special Issue of Theoretical Computer Science dedicated to AMAST'93 is now published.
A BibTeX file with the references of the Selected Papers which the Special Issue is comprised of, is available .
A LaTeX version of this page is available.
Contents:
The full version of this announcement is available.
This book, edited by Leonard Bolc (Polish Academy of Science, Warsaw) and Andrzej Szalas (Institute of Informatics, University of Warsaw) is now available.
The book begins with an introduction to the basic ideas of temporal logic. Successive chapters then examine particular aspects of the temporal theoretical computing domain, relating their applications to familiar areas of research, such as stochastic process theory, automata theory, established proof systems, model checking, relational logic and classical predicate logic.
The book provides a synthesis of well established results in temporal logic with the most up-to-date findings. The editors hope that it will meet the needs both of those familiar with the field and new to it.
336pp, Published: March 1995
1-85728-233-7, BP38.00, H
UCL Press
UCL Press, University College London, Gower St., London WC1E 6BT, UK
Fax: +44 (0)171 413 8392 Tel: +44 (0)171 380 7707
e-mail: m.alexander@ucl.ac.uk
For US orders please contact Taylor and Francis Inc.,
1900 Frost Road, Suite 101, Bristol, Pennsylvania, 19007-1598 USA
For Canadian orders, please contact McClelland & Stewart,
380 Esna Park Drive Markham, Ontario L3R 1H5 Canada
See also the full UCL catalogue from the Internet Bookshop.
Subrecursive programming systems are pervasive throughout both theoretical and practical computer science.
This monograph systematically and rigorously develops the theory of subrecursive programming systems and the powerful tools and techniques these systems support. The tools are first applied to provide elegant,insightful, new proofs of known results in structural complexity theory and are then applied to establish major new theorems regarding program-succinctness trade-offs.
1994 Approx.251 pp.
Hardcover $49.50
ISBN 0-8176-3767-2.
Progress in Theoretical Computer Science.
Birkhauser.
To Order: see [AL0204S5] .
Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavors attracted the most gifted among mathematicians. The present small volume arose under quite different circumstances, namely within the context of reworking the mathematical foundations of computer science.
1994 152 pp., 6 Illus.
Hardcover $49.50
ISBN 0-8176-3801-6
Progress in Theoretical Computer Science
Birkhauser.
To Order: see [AL0204S5] .
Below is the abstract of the recently published first article in the electronic journal Theory and Applications of Categories.
If you wish to receive abstracts of future articles in the journal, please subscribe to the journal, if you have not already done so.
You can subscribe by simply sending your full name and postal address in an email with subject `subscription' to tac@mta.ca. Subscription is free.
While the journal is availabe for free and open over the Internet, it is useful to have a base of known subscribers. You may rest assured that the subscription list will not be used externally.
The full paper may be accessed on the Web. Compressed versions of the files are also available. Please report any difficulties to tac@mta.ca
We formulate three slightly different notions of oriented singular chain complexes and show that all three are naturally homotopic to ordinary singular chain complexes.
Theory and Applications of Categories, Vol 1 (1995), 1-9.
Access by FTP is available too; the paper is stored in two forms: DVI and PostScript respectively.
The thesis, Complexity Doctrines (14+121 pages), contains the chapters
It is available by WWW . or by ftp .
The thesis is available from School of Computing, Imperial College, University of London.
In order to obtain a copy by anonymous ftp , get it.
Alternatively, use WWW to. Then look at the `Pre-prints' under `author' Ulidowski.
The author welcomes comments.
To obtain a copy of the report by anonymous ftp , get it. The file has that name because the paper is Technical Report CS-02-95.
Alternatively one may access the COGS WWW page .
We study the Cube of Type Assignment System, obtained from Barendregt's typed lambda-cube via a natural type erasing function E, that erases type information from terms.
In particular, we address the question whether a judgement, derivable in a type assignment system, is always an erasure of a derivable judgement in a corresponding typed system. Such a property is obvious for systems without dependent types, since there exists a simple isomorphism between derivations.
There is no such isomorphism when dependent types are allowed, and we show that the above mentioned property holds only for the systems without polymorphism. On the other hand, the type assignment systems we consider still have the good computational properties like subject reduction and strong normalization.
Moreover, we define two new type assignment cubes that are isomorphic to the typed one.
The paper is available by ftp in two forms, both compressed: DVI and PostScript respectively.
This paper supplies some documentation for the object-logic HOLCF. It is available .
For more information consult Regensburger's doctoral thesis (written in German).
This paper is now available on the WWW.
There are no references to parameterized catamorphisms or catamorphic versions of filter in it (and most of the category theory is in the footnotes ...)
The abstract of the paper with a link to the postscript version is accessible.
We introduce a linear analogue of Läuchli's semantics for intuitionistic logic. In fact, our result is a strengthening of Läuchli's work to the level of proofs, rather than provability. This is obtained by considering continuous actions of the additive group of integers on a category of topological vector spaces. The semantics, based on functorial polymorphism, consists of dinatural transformations which are equivariant with respect to all such actions. Such dinatural transformations are called uniform. To any sequent in Multiplicative Linear Logic (MLL), we associate a vector space of ``diadditive'' uniform transformations. We then show that this space is generated by denotations of cut-free proofs of the sequent in the theory MLL+MIX. Thus we obtain a full completeness theorem in the sense of Abramsky and Jagadeesan, although our result differs from theirs in the use of dinatural transformations.
As corollaries, we show that these dinatural transformations compose, and obtain a conservativity result: diadditive dinatural transformations which are uniform with respect to actions of the additive group of integers are also uniform with respect to the actions of arbitrary cocommutative Hopf algebras. Finally, we discuss several possible extensions of this work to noncommutative logic.
It is well known that the intuitionistic version of Läuchli's semantics is a special case of the theory of logical relations, due to Plotkin and Statman. Thus, our work can also be viewed as a first step towards developing a theory of logical relations for linear logic and concurrency.
The paper is available by anonymous ftp from three sites:
The full version of this announcement is available.
Covariant deep subtyping has been viewed as a way to narrow the range of a component in subtypes. In this paper, however, we see covariant deep subtyping in a new light -- a way to clarify a vague but fixed range of a component in subclasses. We will examine such concepts as class substitution, generic class by BETA/Cluster, and a number of theoretic approaches in relation to covariant deep subtyping.
The full paper is available by sending mail to the author shang@cadsun.corp.mot.com (David Lujun Shang).
The full version of this announcement is available.
In referring to linear logic fragments, let M stand for multiplicatives, A for additives, 2 for second order quantifiers, and I for ïntuitionistic" version of linear logic fragments.
Lincoln, Scedrov, and Shankar showed the undecidability IMLL2 and IMALL2 (to appear in LICS '95). Lafont has subsequently proved the undecidability of MALL2 (to appear in the Journal of Symbolic Logic). It is the case that MLL2 is undecidable.
The paper is now available by anonymous ftp .
The paper is 8 pages long.
Traditionally ``objects'' in high-level languages such as ML and Haskell have been viewed as closures (records of functions). A new model of objects for these languages is presented, and it is shown how its addition significantly increases the expressiveness of these languages. In particular the new model provides first-class objects with polymorphic methods, previously considered impossible in ML-like languages. The type system thus admits first-class polymorphism while retaining the simple stratified polymorphism of ML-like languages. Rather than reducing objects to records of functions, records are reduced to simple objects; the traditional view of objects-as-closures is thus a special (and limited) case in this object model. A type inference algorithm is provided for the resulting calculus; correctness of the algorithm is formulated modulo some global restrictions which obviate the need for constrained type variables. An efficient algorithm for solving subtyping constraints is developed in a separate paper. An operational semantics is provided, and a subject reduction property verified for the semantics. The operational semantics is the basis for a partial equivalence relation model of types. The calculus is shown to be an extension of Harper and Mitchell's XML, the former retaining the stratified polymorphism of the latter. Connections are made with related work on dynamic typing mechanisms for polymorphic languages.
The paper is available on the WWW . The page contains links to these ftp URLs, where it can be retrieved from as file polymorphic-methods.ps.gz (and should then be uncompressed with gunzip):
As mentioned in the abstract, the paper has some relationship to another paper announced in January, "Dynamic Types Have Existential Type." This paper has recently been revised. It is available from the sites listed above, as file dynamic-types.ps.gz .
Comments on either paper are welcome.
This paper will appear in the journal Computer Languages, Volume 20, Number 4, Pages 213-238.
This paper discusses the structuring of a language specification as a language space and provides a unified framework to deal with the properties of all valid constructs of the language. A language space is a finite specification of an infinite language (syntax and semantics) which allows for the computation of information that can be used for automatic generation and recognition of the valid constructs of the language. The concrete syntax is represented by segments of the language space. The semantics is given by derived operations of the algebras where the language constructs are interpreted by the language processing tools, such as translators and interpreters, operating on the language space. The language processing tools discussed in this paper operate on the language space and implement universal algorithms whose correctness is mathematically proven.
The framework for language processing created by the algebraic tools operating on a language space allows us to envision solutions to the problems raised by the limitations of current software technology: it facilitates the algebraic construction of production-quality compilers which inherently support the incremental development of programs; it integrates all components of the compiler and allows the programmer to control the process of compilation and the performance of the target program generated by the compiler; it provides for greater parallelism among the components of the compiler; it shows an automatic mechanism for porting old programs to new languages and machines.
Two papers, `Games for Recursive Types' and `Games and Full
Abstraction for the Lazy Lambda-Calculus' are now available.
We present results concerning the solution of recursive domain equations in the category G of games, previously used to construct a fully abstract model of PCF. Namely, we show how to construct solutions to equations of the form D = F(D,D) for a large class of functors F: G^{op} x G --> G and verify that these solutions satisfy Freyd's minimal invariant property.
New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers.
To appear in proceedings of the Second Workshop of the Theory and Formal Methods Section, Department of Computing, Imperial College.
Available via WWW .
We define a category of games G, and its extensional quotient E. A model of the lazy lambda-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the first purely semantic construction of a fully abstract model for a reflexively-typed sequential language.
To appear in proceedings of 10th annual IEEE symposium on Logic in Computer Science, 1995.
Available via WWW .
These papers will be presented on April 24-25, 1995 in Seattle, during the Workshop on Formal Methods Applications in Software Engineering, held as part of ICSE-17. Details about ICSE17 .
An Algebraic Specification of a Language for Financial Products
We report on the use of formal methods and supporting tools during the development of a language applied in a banking environment. This language, called Risla, is used to define the nature of the interest products offered by a bank. A Risla description fixes the cash flows (amounts of money coming in or going out on particular dates) resulting from a product, and is used to generate COBOL code. The language has been developed with the use of algebraic specification and the role of this is discussed. More information .
Formal Methods: Managing Quality and Development
Computers today often constitute the critical part of life/safety critical systems, where the consequences of deficiencies and failures can be so serious and costly that particular care must be taken during design to prevent flaws from creeping into the system.
Formal methods are considered to be an effective part of the process of developing computer systems and they allow early validation, verification and analysis, thus ensuring high-quality systems.
In the literature numerous reports on formal methods and their potential use in industrial applications suggest that formal methods are usable in industry, resulting in an increase in quality of design and development. A major conclusion of most studies is that formal methods are beginning to be used seriously with success by industry.
During the OOTI Workshop Software Engineering 1994 we used the formal specification tool ExSpect to specify and simulate a complex real-time embedded system: the control softw. of a simplified high-volume copier.
In this paper we will present the formal specification tool ExSpect, some background information on the OOTI Workshop Software Engineering 1994, and some conclusions with respect to the perceived impact of formal methods on the quality of design and development. Paper .
A note on a nice new bright and shiny proof of strong normalisation for system F, is now available. The proof does not use ``reducibility candidates'' or similar sets of terms. Instead we use a translation on terms to directly calculate a normalisation tree, and then use a model to verify the correctness of this.
The note can be obtained or by FTP from directory where the LaTeX, DVI and PostScript versions are available; the files are GNU-compressed, and are resp. called normal.{tex,dvi,ps}.gz
Update of information in [AL0203MH] .
The Conference Proceedings Forum on Parallel Computing Curricula is on the web .
This proceedings is in hypertext form. It is also accessible from the Forum page .
The up-to-date full record of the discussion about this question
in the Linear Forum is available as a plain-text file.
Further related work may be found through the following WWW pages:
- Greg Restall
- Uday S Reddy
I've read with interest the discussion of categorical models of linear logics. I've wrapped my brain around the recent results, and I've enjoyed it immensely. I do have a question about categorical models, however, and I think that this list is as good a place as any to have them answered. My question is this.
What are categorical models of logics good for?Possible answers are as follows.
Are any of these answers correct? If so, which of them? Or are they missing the point? Are categorical models interesting for some other reason? I'd be very interested if there are any results like those foreshadowed in answer `4' actually appear in the literature on linear logic. The most I can find is answers in the ballpark of 1, 2 and maybe 3.
Replies can be sent to the list, or to me. Either is fine.
The up-to-date full record of the discussion about this question
in the Types Forum is available as a plain-text file.
Question:
Consider a typed lambda-calculus with records. Suppose that the record types are ordered by a subtyping relation, and suppose that there is a subsumption rule. The question of type inference is to decide if a given unannotated program is typable. Which papers are published about type inference problems of this form?
Please send replies to me. If there is sufficient interest, I will send a summary to the types list.
The up-to-date full record of the discussion about this question
in the Types Forum is available as a plain-text file.
I would like to find out if there has been any work done on type inference algorithms using a finite set of most general unifiers rather than a single mgu. While I'm sure that I've never seen or heard of any, and that the problem itself seems difficult at best, I would just like to make sure. Thank you.
Information relating to the ESPRIT Basic Research Working Group COMPASS (Comprehensive Algebraic approach to System Specification) is now available on the WWW .
The full version of this announcement is available.
This is an email directory of logicians, algebraists, and programming linguists working primarily on structural problems in mathematics and computer science. It is organized as a Unix aliases file and may be appended directly to the aliases file that normally resides in /usr/lib or /etc. The most recent release of this directory may be obtained at any time by anonymous ftp .
The purpose of this directory is to permit those listed in it to be easily contacted individually by email.
Notice: Please do not use any email address obtained from this directory for other than the purpose stated above without first obtaining the consent of the owner of that address. Such proscribed uses include adding an address obtained from this directory to a mailing list used for broadcast mailings, and noting the fact of inclusion in this directory in a profile of the included individual.
The directory observes a few format conventions, which are described in the full version of this announcement.
Although the directory contains no repeated aliases (column 1 entries), the aliases file to which you append it may already contain aliases that also appear here. You should be aware that the resulting conflicts will not be reported as such, but rather that the mailing programs will select either the last or first repeated alias as the one to use depending respectively on whether or not your mail system preprocesses the aliases file for faster retrieval.
Update of [AL0102S2]
I have updated the home page on logical frameworks. The update consists of 27 new references and 7 new personal home pages, brought to my attention since October 1994.
To see only the new information you may consult . Corrections, ftp addresses of papers, and further additions would be most welcome.
Frank Pfenning
Department of Computer Science, Carnegie Mellon University
Pittsburgh, PA 15213-3891, U.S.A.
Phone: +1 412 268-6343, Fax: +1 412 268-5576 InterNet: fp@cs.cmu.edu
- Web
Update of [SIAN04p4-1]
The popularity and usefulness of the UnCover Reveal Service service earned Reveal the Online Magazine Product of the Year award in 1994.
A new enhancement to the UnCover Reveal service was released on April 3. This feature enables users to store search strategies (e.g. searches by topic or by author name) which will be run weekly against new articles added to the UnCover database. The results of these searches are sent to the Internet e-mail address stored in the user's UnCover Profile.
The UnCover Company will begin charging for the Reveal service, which has been free to individuals for the past year. The charge is $20 per year for each individual profile. This fee will permit users to select up to 50 titles from which to receive tables of contents, and to store up to 25 search strategies. Note: Companies or institutions who wish to route tables of contents internally to employees should contact UnCover about setting up this service.
The $20 annual fee may be paid online by credit card or UnCover Deposit or Billing account. You may also call the UnCover office at 800-787-7979 (outside the US at 303-758-3030) to set up payment over the phone. If you would prefer to mail a check, please include your UnCover Profile Number and Password and send it to:
Reveal Service
The UnCover Company
3801 E. Florida Avenue, Suite 200
Denver, CO 80210
fax: 303-758-5946
If you have any questions about the new Reveal services or the fee, please send e-mail to reveal@carl.org, or phone the Marketing office at 800-787-7979 (outside the US at 303-758-3030).
Call: Toll Free 1-800-777-4643. In NJ please call 201-348-4033.
Write:
Birkhauser
Marketing Dept.
675 Massachusetts Ave.
Cambridge, MA 02139
USA
Payment can be made by check, money order or credit card. Please enclose $3.00 for shipping and handling for the first book ($1.00 for each additional book) and IL, NY, NJ, MA, VT, PA, VA, TX, CA residents, please add sales tax. Canadian residents please add 7% GST.
Prices may change without notice. For price and ordering information outside North America, please contact
Birkhauser Verlag AG
P.O. Box 133
Klosterberg 23
CH-4010 Basel
Switzerland
Fax: + 41 61 271 7666.
<location> := http://www.cs.utwente.nl/data/amast/
<location> := ftp://ftp.cs.utwente.nl/pub/doc/amast/
Date: 23/04/1995
Contents: Index.html, README, amast95/, info/, links/, sigala/,
pstv95/, amast93/, amast91/
full/
Douglas Howe (LICS Newsletters 24, 25) [MA,MF,MG,MH,C9,CB,L4,L5,S5],
Teodor Rus [M1,L1,LH], Anton Nijholt [M2,JC],
Arie van Deursen [M3,LJ], Philippe Codognet [M4],
Wolfgang Maass [M5], Ming Li [M5],
Manfred Warmuth [M5], Horst Reichel [M6],
Michael Johnson [M7], JFPL'95 Organization [M8],
LDPL'95 Organizing Comm. [M9], Roland Backhouse [MB],
Ian Parberry [MC], Eike Best [MD],
Jorma A. Tarhio [ME], Paul Gray [MI],
Tandy Warnow [MJ], Vijaya Chandru [C1],
GD'95 Organizing Comm. [C2], Jose D. P. Rolim [C3],
Maurizio Proietti [C4], Azer Bestavros [C5],
Alan Mycroft [C6], SEGRAGRA'95 Organizing Comm. [C7],
Evangelos Kranakis [C8], Peter J. Angeline [CA],
Kanchana Kanchanasut [CC], Alfredo de Santis [CD],
<kutten@watson.ibm.com> [CE], Ana Cavalli [CF],
Stanislaw Budkowski [CF], Vasco Brattka [CG],
Evangelos Triantaphyllou [J1], Philip Wadler [J2],
Ronnie Brown [J3], Bill McColl [J4],
David Pym [J5], Angela McKay [J6],
Deborah Franzblau [J7], George Cleland [J8],
Jeet Gupta [J9], MRI PhD Committee [JA],
Ernst W. Mayr [JB], Matthew Hennessy [JD,JG],
Eric Bartels [JE], Marta Z. Kwiatkowska [JF],
P. Takis Metaxas [JH,LL], David Lorge Parnas [JI],
Giuseppe Scollo [L1], Jan Rutten [L2],
Andrzej Szalas [L3], Bob Rosebrugh [L6],
Jim Otto [L7], Irek Ulidowski [L8],
William Ferreira [L9], Simonetta Ronchi della Rocca [LA],
Lawrence C. Paulson [LB], Eerke Boiten [LC],
Philip Scott [LD], David Lujun Shang [LE],
Yves Lafont [LF], Andre Scedrov [LF],
Dominic Duggan [LG], Guy McCusker [LI],
Ralph Loader [LK], Greg Restall [P1],
Vaughan Pratt [P1,S2], Uday Reddy [P1],
Roy Crole [P1], Thorsten Altenkirch [P1],
Jens Palsberg [P2], Laurent Dami [P2],
Marcin Benke [P2], Mark A. Sheldon [P2],
Scott Smith [P2], Lalita Jategaonkar Jagadeesan [P2],
Hassan Aït-Kaci [P2], Simon Courtenage [P3],
Mitchell Wand [P3], Martin Odersky [P3],
Zhenyu Qian [S1], Frank Pfenning [S3],
Brenda K. Bailey [S4].
This issue of AMAST Links is available in four forms:
(+) within the AMAST directory of the Twente WWW server, at URLwhere `<pp>' is either `-ToC' (for the ToC-page),or the 2-character page identifier (for one-page files), or empty (whole-issue file).
http://www.cs.utwente.nl/data/amast/links/v02/i04/AL0204<pp>.txt
Note: This issue will also be available, in all of its four forms, by anonymous ftp from the AMAST repository at the University of Twente. File names will be the same as above, but under the ftp directory .