BCTCS 12

British Colloquium for Theoretical Computer Science

1-4 April 1996

Contributed Talks

• Andrew A Adams Machine-Assisted Meta-Theoretic Proof
• Dhiya Al-Jumeily Implementing Rewriting as a Base for Building Intelligent Tutorial System
• Martyn Amos A New Model of DNA Computation
• Chris Angus Mathematical Programming with Functional Languages
• Anthony Bailey Extending the syntax of a type theory with a system of implicit coercions to ease the development of formal mathematics
• Judith Barnard A refinement process for Communicating X-machines
• Richard Botting Iterative construction of data modelling language semantics.
• Jeremy Bryans A Denotational Semantics for Real-Time LOTOS
• Russ Bubley Approximating the volume of convex bodies: a new approach.
• Richard Cartwright The complexity and feasibility of a purely definition-based programming paradigm
• Matthew Caswell Modelling Encapsulation Using Action Semantics
• Athina Christodoulou Modelling Discrete Distributions in WSCCS
• Graham Collins Supporting Reasoning about Functional Programs : An Operational Approach
• Solange Coupet Proving and synthesizing a comparator in type theory
• Paul E. Dunne Average Case Complexity Measures for Boolean Functions
• Jason Emmett The complexity of algorithms for content-addressable memory
• Matt Fairtlough An intensional completeness theorem that connects ternary simulation with timing analysis
• Donal Fellows Towards a Hardware Description Framework for Asynchronous Micropipeline Design
• Clive Galley On Minimising Automata and Congruence Closure in Parallel
• Tim Glover A Verification of Parallel Associative Combinator Evaluation using Pi Calculus.
• Leslie Goldberg Learning Foraging Thresholds for Lizards
• Martin Hesketh Synthesising synchronisation in the Petri Box Calculus.
• Jonathan Hogg Partial evaluation of parametrised circuits for dynamic hardware
• Mike Holcombe Hybrid Systems
• Chris Holt An Operational View of Visual Languages
• Alan Hutchinson Existence and Intuitionistic All-Elimination
• Ole H. Jensen An Action Calculus for Functional Programming
• Mark Jerrum A quasi-polynomial-time algorithm for sampling words
• Alex Jones Using type theory for the formalisation of mathematics on computers
• Nikos Mylonakis Adequate encodings of proof systems in UTT.
• Rashmi Pandya Two concepts of possible worlds in probabilistic reasoning
• Mike Paterson Structure from String-Folding
• Justin Pearson Timed Interaction Categories
• Anna Philippou On Transformations of Concurrent Object Programs
• Ida Pu Matricial Space Economy with Constant Access Time
• Vincent Schmitt Event structures, domains and automata
• Simon Shiu An Application of Type Theory to Semantic Networks.
• L. J. Steggles Formal Software and Hardware Design using Algebraic Methods
• Yong Sun SOFL: A Formal Engineering Methodology for Industrial Applications
• Alastair Telford Formal Methods for Accident Analysis
• Alastair Telford Abstract Interpretation of Type Theory
• Rick Thomas Finite Presentability of Semigroups
• Chris Tofts Efficiently Composing Distributions for Performance Modelling
• Colm Toomey Animating Specifications via Model Generation
• Willem Visser Using OBDD encodings for Space Efficient State Storage during On-the-fly Model Checking

Back