LFCS reports 1993

• Enrichment Through Variation
  R. Gordon and A. J. Power
  LFCS report ECS-LFCS-93-254
  
• A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification
  Michael Mendler
  LFCS report ECS-LFCS-93-255 (also published as CST-97-93)
  
• Statically Types Friendly Functions via Partially Abstract Types
  B C Pierce and D N Turner
  LFCS report ECS-LFCS-93-256
  
• Mistakes and Ambiguities in the Definition of Standard ML
  Stefan Kahrs
  LFCS report ECS-LFCS-93-257
  
• PAC-Learning Geometrical Figures
  Paul W Goldberg
  LFCS report ECS-LFCS-93-258 (also published as CST-98-93)
  
• Approximately Counting Hamilton Cycles in Dense Graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-93-259
  
• Simulated Annealing for Graph Bisection
  Mark Jerrum and Gregory Sorkin
  LFCS report ECS-LFCS-93-260
  
• Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems
  Petr Jancar
  LFCS report ECS-LFCS-93-261
  
• Algebraic Theories for Name-Passing Calculi
  Joachim Parrow and Davide Sangiorgi
  LFCS report ECS-LFCS-93-262
  
• Literate Programming: A Review
  Angus Duggan
  LFCS report ECS-LFCS-93-263
  
• Action Structures for the pi-Calculus
  Robin Milner
  LFCS report ECS-LFCS-93-264
  
• Errata and Remarks
  David J Pym
  LFCS report ECS-LFCS-93-265
  
• Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms
  Davide Sangiorgi
  LFCS report ECS-LFCS-93-266 (also published as CST-99-93)
  
• Correctness of Data Representations in Algol-like Languages
  R D Tennent
  LFCS report ECS-LFCS-93-267
  
• Embedding Hardware Description Languages in Proof Systems
  Kees G W Goossens
  LFCS report ECS-LFCS-93-268 (also published as CST-100-93)
  
• The Formalisation of a Hardware Description Language in a Proof System: Motivation and Applications
  Kees G W Goossens
  LFCS report ECS-LFCS-93-269
  
• A Theory of Bisimulation for the pi-calculus
  Davide Sangiorgi
  LFCS report ECS-LFCS-93-270
  
• Timed Processes: Models, Axioms and Decidability
  Liang Chen
  LFCS report ECS-LFCS-93-271 (also published as CST-101-93)
  
• Uniform sampling modulo a group of symmetries using Markov chain simulation
  Mark Jerrum
  LFCS report ECS-LFCS-93-272
  
• Structure and Behaviour in Hardware Verification
  K G W Goossens
  LFCS report ECS-LFCS-93-273
  
• On the decidability of model checking for several mu-calculi and Petri Nets
  Javier Esparza
  LFCS report ECS-LFCS-93-274
  
• Multiple Inheritance via Intersection Types
  Adriana B Compagnoni and Benjamin C Pierce
  LFCS report ECS-LFCS-93-275
  
• Undecidable Equivalences for Basic Parallel Processes
  Hans Hüttel
  LFCS report ECS-LFCS-93-276
  
• Fibrations, Logical Predicates and Indeterminates
  Claudio Alberto Hermida
  LFCS report ECS-LFCS-93-277 (also published as CST-103-93)
  
• Decidability and Decomposition in Process Algebras
  Soren Christensen
  LFCS report ECS-LFCS-93-278 (also published as CST-105-93)
  
• Constructions, Inductive Types and Strong Normalization
  Thorsten Altenkirch
  LFCS report ECS-LFCS-93-279 (also published as CST-106-93)