LFCS reports 1998

• Process Abstraction in the Verification of Temporal Properties
  Glenn R. Bruns
  LFCS report ECS-LFCS-98-380
  
• Notes on Simply Typed Lambda Calculus
  Ralph Loader
  LFCS report ECS-LFCS-98-381
  
• A Class of PEPA Models Exhibiting Product Form Solution over Submodels
  Jane Hillston
  LFCS report ECS-LFCS-98-382
  
• Injective spaces and the filter monad
  Martín Hötzel Escardó
  LFCS report ECS-LFCS-98-383
  
• On the Unification of Substitutions in Type-Inference
  Bruce J. McAdam
  LFCS report ECS-LFCS-98-384
  
• Simplifying the modal mu-calculus alternation hierarchy
  Julian C. Bradfield
  LFCS report ECS-LFCS-98-385
  
• Bisimulation equivalence is decidable for normed Process Algebra
  Yoram Hirshfeld and Mark Jerrum
  LFCS report ECS-LFCS-98-386
  
• The ``Burnside process'' converges slowly
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-98-387
  
• A Manufacturing Production Line with Service Interruptions
  Nigel Thomas and Isi Mitrani
  LFCS report ECS-LFCS-98-388
  
• Types For Modules
  Claudio V. Russo
  LFCS report ECS-LFCS-98-389
  
• Applicative Notions in ML-like Programs
  Budi Halim Ling
  LFCS report ECS-LFCS-98-390
  
• On counting independent sets in sparse graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-98-391
  
• Hoare Logic and VDM: Machine-Checked Soundness and Completeness Proofs
  Thomas Kleymann
  LFCS report ECS-LFCS-98-392
  
• Metatheory of Verification Calculi in LEGO: To What Extent Does Syntax Matter?
  Thomas Kleymann
  LFCS report ECS-LFCS-98-393
  
• Learning Function Free Horn Expressions
  Roni Khardon
  LFCS report ECS-LFCS-98-394
  
• Learning Range Restricted Horn Expressions
  Roni Khardon
  LFCS report ECS-LFCS-98-395
  
• Categorical Term Rewriting: Monads and Modularity
  Christoph Lüth
  LFCS report ECS-LFCS-98-396
  
• Equivalence semantics for concurrency: comparison and application
  Vashti Christina Galpin
  LFCS report ECS-LFCS-98-397
  
• Referential Opacity in Equational Reasoning
  Jo Erskine Hannay
  LFCS report ECS-LFCS-98-398
  
• Hoare Logic and Auxiliary Variables
  Thomas Kleymann
  LFCS report ECS-LFCS-98-399
  
• Direct models for the computational lambda-calculus
  Carsten Führmann
  LFCS report ECS-LFCS-98-400
  
• Nested Sketches
  Horst Reichel
  LFCS report ECS-LFCS-98-401
  
• The sequentially realizable functionals
  John Longley
  LFCS report ECS-LFCS-98-402
  
• Type Inference with Bounded Quantification
  Dilip Sequeira
  LFCS report ECS-LFCS-98-403