Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site utcsrgv.UUCP
Path: utzoo!utcsrgv!phyllis
From: phyllis@utcsrgv.UUCP (Phyllis Eve Bregman)
Newsgroups: ont.events
Subject: UofT DCS Seminar schedule
Message-ID: <1568@utcsrgv.UUCP>
Date: Mon, 20-Jun-83 16:47:58 EDT
Article-I.D.: utcsrgv.1568
Posted: Mon Jun 20 16:47:58 1983
Date-Received: Mon, 20-Jun-83 17:32:00 EDT
Organization: CSRG, University of Toronto
Lines: 49


	UofT Department of Computer Science Seminar Schedule for
		     the week of June 20th, 1983


Thursday, June 23rd, 2:00 P.M., SF1105:  Bruce Char, Department of Computer
  Science, University of Waterloo:  "Maple, a computer algebra system".

				ABSTRACT

	Maple is an interactive system for symbolic mathematics being
	developed at Waterloo.  It builds upon the experience of the
	past ten years' effort on systems such as Macsyma, Reduce and
	MuMath.  Maple provides facilities for algebraic calculations:
	arithmetic with rational numbers and functions, and the basic
	operations of symbolic differentiation, and Taylor series.
	There are also library packages, written in the user-level
	programming language provided with the system, which provide
	facilities for simplification of rational expressions (g.c.d.s.
	and polynomial factorization), solving systems of linear
	equations, arbitrary precision floating point arithmetic,
	symbolic integration, etc.  Maple (version 3.0) is currently
	operational on Honeywell GCOS-8, Berkeley Vax/Unix and a
	Spectrix Xenix/68000 system.

	In addition to presenting examples of Maple usage, we will
	discuss the original design goals of the Maple project, and
	briefly describe some of the implementation details of the
	system, including data structures, the use of hashing for
	efficient data access, and the approach to portability.

Thursday, June 23rd, 4:00 P.M., SF1105:  Professor R. Nigel Horspool,
  School of Computer Science, McGill University:  "Automatic selection
  of optimal code templates".

				ABSTRACT

	The development of general, machine-independent, code
	generation techniques in compilers has received much
	attention in recent years.  This talk will promote a
	code generation philosophy that is a generalization of
	the old notion of code templates.  With our proposed
	approach, the code generation problem is effectively
	reduced to choosing minimum cost labellings of expression
	trees.  A practical algorithm to search for these labellings
	will be described.  Our approach is superior, in some
	respects, to competing methods because more general code
	structures can be created.  Some experience with this
	technique in a Pascal compiler will be discussed.