SYDNEY CATEGORIES COMBINATORICS and COMPUTER SCIENCE CCC Material Available by Anonymous FTP from maths.su.oz.au 129.78.68.2 ======================================================================== This file is README in the sydcat directory of maths.su.oz.au, 129.78.68.2, accessible by anonymous ftp. The sydcat directory is for FTP distribution of recent publications, programs, seminar listings and other material of the Sydney Category Theory, Combinatorics, and Computer Science Group. ======================================================================== This group consists of staff and students at the University of Sydney Macquarie University University of New South Wales University of Technology Sydney Sydney, Australia, including the following: Murray Adelman murray@macadam.mpce.mq.edu.au Brian Day Lee Flax flax@macadam.mpce.mq.edu.au Robbie Gates gates_r@maths.su.oz.au Amitavo Islam islam_a@maths.su.oz.au Barry Jay cbj@socs.uts.edu.au Mike Johnson mike@macadam.mpce.mq.edu.au Giulio Katis katis_p@maths.su.oz.au Max Kelly kelly_m@maths.su.oz.au Mark Leeming leeming_m@maths.su.oz.au Stephen Ma ma_s@maths.su.oz.au Wafaa Khalil khalil_w@maths.su.oz.au Wesley Phoa wes@cs.unsw.oz.au Usha Sridhar sridhar_u@maths.su.oz.au Ross Street street@macadam.mpce.mq.edu.au Sun Shu-Hao sun_s@maths.su.oz.au Dominic Verity domv@macadam.mpce.mq.edu.au Henry Weld weld_h@maths.su.oz.au Bob Walters walters_b@maths.su.oz.au Karl Wehrhahn wehrhahn_k@maths.su.oz.au =======================Available material=============================== The following files and directories are available: ADDRESS lists are in sydcat/addresses BIBLIOGRAPHY files are in sydcat/bibliography BOOK descriptions are in sydcat/books PAPERS:dvi files of papers of author are in sydcat/papers/author CONFERENCE details are in sydcat/conference SEMINARS - some details are in sydcat/seminars SOFTWARE - programs are in sydcat/software Here is the current list of contents: addresses/catcurrent The Category Theory address list maintained by Max Kelly and Michael Johnson Updated regularly addresses/structdir Vaughan Pratt's email address list Updated October 1993 Release 3.0 Master copy: Boole.Stanford.EDU:~ftp/pub/struct.dir Maintainer: Vaughan Pratt, pratt@cs.stanford.edu bibliography A directory for bibliographies: contains some Bibtex files of sydcat publications bibliography/reports List of Research Reports of the Pure Mathematics Department, University of Sydney, Australia Updated regularly. books/hibi Contents and bibliographic details of Takayuki Hibi "Algebraic combinatorics on convex polytopes" Carslaw Publications PO Box 615 Glebe, NSW 2037 Australia books/walters Information about, corrections to, and bibliographic details of R.F.C. Walters "Categories and Computer Science" published by Carslaw Press in Australia and by Cambridge University Press elsewhere Contents and bibliographic details of RFC Walters "Number theory an introduction" Carslaw Publications PO Box 615 Glebe, NSW 2037 Australia books/wehrhahn Contents and bibliographic details of KH Wehrhahn "Combinatorics: an introduction" Carslaw Publications PO Box 615 Glebe, NSW 2037 Australia conferences Details of conferences papers/jay A directory containing papers of Barry Jay Title: Compositional Characterization of Observable Program Properties Authors: B. Steffen,C. Barry Jay, M. Mendler Process: Aarhus TR and accepted by Journal Title: Coherence in Category Theory and the Church-Rosser Property Author:CBJ Process: published in Studia Logica Title: Modelling reduction in confluent categories Author: CBJ Process: Published in the Durham Proceedings Title: Fixpoint and Loop Constructions as Colimits Author: CBJ Process: Como Proceedings Title:Long $\beta\eta$ normal forms and confluence (revised) Author: CBJ Process: static cf virtues.tex Title: Extending properties to categories of partial maps Author: CBJ Process : static Title: Partial Functions, Ordered Categories, Limits and Cartesian Closure Author: CBJ Process: proceedings of the HOW Title: Tail recursion through universal invariants Author: CBJ Process: to appear in TCS papers/johnson M.S.Johnson Linear term rewriting systems are higher dimensional string rewriting systems, {\em Proc of the Institute for Mathematics and its Applications\/} (1991), 101--110. M.S.Johnson (with G.P.~Monro and C.N.G.~Dampney) A mathematical foundation for ERA, {\em Proc of the Institute for Mathematics and its Applications\/} (1991), 77--84. M.S.Johnson (with R.F.C.~Walters) Category theoretic modelling of digital circuits and systems, {\em Proc of the Pan-Commonwealth Conference on Mathematical Modelling} {\em in Circuit Design}, Commonwealth Science Council (1992), 199--213. M.S.Johnson (with R.F.C.~Walters) Algebra objects and algebra families for finite limit theories, {\em Journal of Pure and Applied Algebra} {\bf 83} (1992) 283--293. M.S.Johnson (with S.-H. Sun) Remarks on representations of universal algebras by sheaves of quotient algebras, M.S.Johnson {\em Proceedings of the Canadian Mathematical Society\/} {\bf 13} (1992) 299--307. M.S.Johnson (with C.N.G.~Dampney and P.~Deuble) Taming large complex information systems, M.S.Johnson {\em Proceedings of Complex Systems} '92, IOS Press, Amsterdam, 210--222. M.S.Johnson (with R.~Buckland) An application of logic programming in pure mathematics, to appear in {\em Proceedings of ACSC}, 1993. M.S.Johnson (with C.N.G.~Dampney) Category theory and information systems engineering, {\em Proceedings of AMAST93}, Unviersity of Twente, Holland, 95--103. M.S.Johnson On the value of commutative diagrams in information modelling, to appear in {\em Springer Workshops in Computing}, 16 pages. papers/kelly G.M. Kelly, Stephen Lack: Finite-product-preserving functor, Kan extensions, and strongly-finitary 2-monads G.M. Kelly, Stephen Lack, R.F.C. Walters, Coinverters in categories with structure galaus.dvi G.Janelidze and G.M.Kelly, Galois theory and a general notion of central extension. (A4 version) galam.dvi G.Janelidze and G.M.Kelly, Galois theory and a general notion of central extension. (American quarto version) janmark.dvi G.Janelidze and L.Ma'rki, Radicals of ringa and pullbacks. papers/phoa Wesley Phoa bohm.ps "From term models to domains" --describes a category of `synthetic domains' for the closed term model in which terms with the same Bohm tree are identified Wesley Phoa graph.ps "Building domains from graph models" --describes a category of `synthetic domains' in the realizability topos arising from the r.e. graph model of the lambda-calculus Wesley Phoa pcf.ps "A note on PCF and the untyped lambda-calculus" --proof of computational adequacy of an untyped translation of call-by-name PCF Wesley Phoa poly.ps "A simple categorical semantics for first-order polymorphism" --describes how any cartesian closed category can be used to model ML polymorphism, using the notion of `polynomial category' M.P. Fourman and Wesley Phoa sml.ps "A proposed categorical semantics for Pure ML" (with M. P. Fourman, LFCS) --sketch of a semantics for SML using synthetic domain theory; focuses on the Modules system Wesley Phoa subtypes.ps "Using fibrations to understand subtypes" --informal account of categorical models for subtyping and bounded quantification Wesley Phoa synth.ps "Effective domains and intrinsic structure" --describes a category of `synthetic domains' in the effective topos Wesley Phoa tech.ps Replacing fibs.ps, topoi.ps, eff.ps, these notes provide an introduction to (some aspects of) a) fibrations and polymorphic lambda calculus b) constructive logic, categorical logic and topos theory c) Kleene realizability; PERs and omega-sets d) the effective topos; modest sets and how they model polymorphism They assume some basic knowledge of category theory, logic and typed lambda calculus. No familiarity with indexed categories or with categorical logic or topos theory is required. The notes do not attempt to be comprehensive, but simply try to give a reasonably relaxed account of the material. They are about 150pp including the index and appendixes. There are plenty of exercises. papers/sun Shu-Hao Sun, RFC Walters, Representations of modules and cauchy completeness Shu-Hao Sun, Adjunction of the associated sheaf functor of non-commutative rings Shu-Hao Sun, Non-commutative Deligne formula Shu-Hao Sun, Biregular rings and their duality Shu-Hao Sun, Non-commutative quasi-coherent sheaves Shu-Hao Sun, Equivalence of algebraic and geometric local cohmology Shu-Hao Sun, Structure sheaves for non-commutative rings Shu-Hao Sun, Duality on compact prime ringed spaces Shu-Hao, Generalized Grothendieck topologies papers/walters Aurelio Carboni, Stephen Lack, R. F. C. Walters, An introduction to extensive and distributive categories, Jun92. S. Carmody, R.F.C. Walters, The Todd-Coxeter Procedure and Left Kan Extension, Mar91 S. Carmody, R.F.C. Walters, Computing quotients of actions of a free category, Mar91. M. S. Johnson, R.F.C. Walters, Algebra Families, Apr92 P. Katis, N. Sabadini, RFC Walters, On discrete dynamical systems and concurrency, Dec93 G.M. Kelly, Stephen Lack, R.F.C. Walters, Coinverters in categories with structure, Jun92 Wafaa Khalil, R.F.C. Walters, An imperative language based on distributive categories II Apr92 Wafaa Khalil, R.F.C. Walters, Functional processors and operations on them in extensive categories, May93 Wafaa Khalil, Eric Wagner, R.F.C. Walters, Fix-point semantics for programs in distributive categories, May93 Mark Leeming, R.F.C. Walters, Computing left kan extensions using the Todd-Coxeter procedure N. Sabadini, S. Vigna, RFC Walters An automata-theoretic approach to concurrency through distributive categories: on morphisms, Jan93 N. Sabadini, R.F.C. Walters On functions and processors: an automata-theoretic approach to concurrency through distributive categories, Nov92 N. Sabadini, H. Weld, R.F.C. Walters, Distributive automata and asynchronous circuits, May93 N. Sabadini, S. Vigna, RFC Walters A notion of refinement for automata, Jan93 Shu-Hao Sun, RFC Walters, Representations of modules and cauchy completeness, Mar93 R.F.C. Walters, An imperative language based on distributive categories, 91 seminars/sydcat sydcat.tex is a listing of seminars given at the Sydney Category Seminar Not being currently maintained. seminars/cics cics.tex is a listing of seminars given at the Sydney Categories in Computer Science Seminar. software/kan_1.0 kan (vers 1.0) (Sean Carmody, Craig Reilly, Bob Walters) An implementation of the algorithm developed in 1990 by Carmody & Walters to compute (finite) left Kan extensions is now operational (programmed by Reilly and Carmody). There are also some sample input files as well as a file called KAN.info which gives further details of the program and one called README which describes the sample input files. If you experiment with the program, we would be very interested to hear any comments or suggestions (especially with regards any bugs which you -- hopefully won't -- find). Future versions of the program will include a more standardised i/o format, and will renumber the elements of the output sets will be of the form {1,2,..,n} (a set which may currently be given as {1,3,7} would become {1,2,3}). Sean Carmody. email: carmody_s@maths.su.oz.au 21 May 1991 software/kan_2.0 A later version of kan, but Sean left Sydney for Cambridge before it was properly documented. software/buckland Representing pasting schemes in Prolog A program written by Richard Buckland, with Michael Johnson. For details see programs/buckland/readme Further details email t-richbu@microsoft.com mike@macadam.mpce.mq.edu.au -- Bob Walters Department of Pure Mathematics, University of Sydney, NSW 2006, Australia Internet: walters_b@maths.su.oz.au Phone: +61 2 692 2966 FAX: +61 2 692 4534 ==========================Instructions====================================== FTP LOGIN. Give the following commands. ftp maths.su.oz.au Login: anonymous (if you don't have an account on maths) Paswd: yoursurname (though any string will work) bin (if you are retrieving a .dvi file) prompt off (if you want no ? prompts from mget) cd sydcat (change directory to _public/sydcat ls -lt (see what's there, most recent first) mget filename-1 ... filename-n (e.g. mget catcurrent.Z) quit (exit from FTP) DVI. If you wish to print paper, calg say, retrieve calg.dvi and associated .eps and .sty files from the subdirectory calg (cd calg first). You must first give the bin command to ftp since .dvi files are not text files. You will then need a dvi to postscript converter which will include the .eps files. Print the resulting postscript file on your host. PROBLEMS. If you have problems in either retrieving or compiling papers, please contact Bob Walters. NOTE. Please note that the IP satellite link between Australia and the rest of the world is saturated most of the time. Large file transfers to non-Australian sites should be spaced out, and should preferably take place between the hours 2300 and 0800 local Eastern Australian time (the local time appears in the ftpd banner at connection). ============================================================================ ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++