[next] [prev] [up] Date: Wed, 29 Feb 84 23:08:00 -0500 (EST)
[next] [prev] [up] From: Alan Bawden <ALAN@MIT-MC >
~~~ ~~~ [up] Subject: [CL.BOYER: A Programming Language for Group Theory (Dept. of Math)]

Some of the group theory hackers amoung us might be interested in this
abstract. Of course the talk has already happened, but perhaps one of you
knows more about this?

Date: Sun 26 Feb 84 17:06:23-CST
From: Bob Boyer <CL.BOYER at UTEXAS-20.ARPA>
To: AIList
Re: A Programming Language for Group Theory (Dept. of Math)

[Forwarded from the UTexas-20 bboard by Laws@SRI-AI.]

A Programming Language for Group Theory
John Cannon
University of Sydney and Rutgers University
Monday, February 27, 4pm

The past 25 years has seen the emergence of a small but vigorous branch of
group theory which is concerned with the discovery and implementation of
algorithms for computing structural information about both finite and infinite
groups. These techniques have now reached the stage where they are finding
increasing use both in group theory research and in its applications. In order
to make these techniques more generally available, I have undertaken the
development of what in effect is an expert system for group theory.

Major components of the system include a high-level user language (having
a Pascal-like syntax) and an extensive library of group theory algorithms. The
system breaks new ground in that it permits efficient computation with a range
of different types of algebraic structures, sets, sequences, and mappings.
Although the system has only recently been released, already it has been
applied to problems in topology, algebraic number theory, geometry, graphs
theory, mathematical crystalography, solid state physics, numerical analysis
and computational complexity as well as to problems in group theory itself.

[next] [prev] [up] [top] [help]