X-Comment1: ############################################################# X-Comment2: # # X-Comment3: # uk.ac.glasgow.cs has changed to uk.ac.glasgow.dcs # X-Comment4: # # X-Comment5: ############################################################# Grothendieck topologies in computer science =========================================== In my thesis I use Grothendiek fibrations as a means of expressing the decomposition of Scott domains into dependent sums of fibres. The application area is Partial Evaluation. Domain projections are used to provide a description of what portion of a function's argument will be known during partial evaluation, and the fibres of the projection describe the possible freedom of the complete argument. This information is used to construct the run-time argument of the specialised version of the original function. The practical benefit of using fibrations is that certain previously ad hoc optimisations in Partial Evaluation arise directly from the theory. References to this work are: Projection Factorisations in Partial Evaluation, J.Launchbury, Ph.D. Thesis, Glasgow University, Nov 89. Distinguished Dissertations in Comp. Sci., Vol 1, C.U.P., due May 1991. Dependent Sums Express Separation of Binding Times, J.Launchbury, proc. Functional Programming, Glasgow, 1989, K.Davis and J.Hughes eds., Workshops in Computing, Springer-Verlag, 1990.