Theory and Formal Methods 1993: Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Isle of Thorns Conference Centre, Chelwood Gate, Sussex, UK, 29–31 March 1993
Geoffrey Burn, Simon Gay, Mark Ryan
Springer London, Sep 24, 1993 - Mathematics - 329 pages
This volume contains the proceedings of the fIrst workshop held by the Theory and Formal Methods Section ofthe Imperial College Department of Computing. It contains papers from almost every member of the Section, from our long-term academic visitors, and from those who have recently left us. The papers fall into four broad areas: • semantics • concurrency • logic • specification with some papers spanning a number of disciplines. The subject material varies from work on mathematical foundations to practical applications of this theory, expressing the Section's commitment to both the foundations of computer science, and the application of theory to real computing problems. In preparing the workshop and these proceedings, care was taken to ensure that there were papers overviewing a field, as well as ones whose primary aim was to present new scientifIc results. This had a dual purpose: to bring our Section members up to speed in some of the areas being worked on by the Section; and to provide the reader of the proceedings not only with a good introduction to many of the specifIc areas being investigated by the Section, but also with details of some of our latest results. All the papers presented at the workshop were revised following comments made by the workshop participants, and all were subsequently reviewed by at least two people before producing the fInal versions contained in this volume.
What people are saying - Write a review
We haven't found any reviews in the usual places.
The Abstract Interpretation of Functional Languages
Graph Rewriting Systems and Abstract Interpretation
Interaction Categories Extended Abstract
15 other sections not shown
Other editions - View all
Abramsky abstract interpretation action algebraic attractor autonomous category axioms basic behaviour bisimulation calculus category theory cf(P closure coequaliser colimits compact Computer Science concurrency consider construction context cps-translation dcpo defined definition denotes Department of Computing divergence dynamical systems endofunctor equations equivalence equivalence relation example expression finite fixed point formal formula framework Functional Programming functor geometric Giraud frame given homomorphism implementation induced Intuitionistic IP-category labelled language least fixed point Lecture Notes Lemma Linear Logic maximal elements multiset natural transformation node normal form notion objects operational semantics pair paper partial order power domain predicate preorder process calculus proof properties Proposition recursive relation result rules satisfies Section sequence signature morphism specification Springer-Verlag SProc strict structure subset syntax temporal terminal Theorem topological toposes transition relation transition system transition traces translation type theory values variables Workshop