• People
• Events
• Research

LFCS reports by Author: H

Hagino, T

• A Categorical Programming Language
  T. Hagino
  LFCS report ECS-LFCS-87-38 (also published as CST-47-87)
  
• A Typed Lambda Calculus with Categorical Type Constructors
  T Hagino
  LFCS report ECS-LFCS-88-44
  

Hancock, Peter

• Ordinals and Interactive Programs
  Peter Hancock
  

Hannay, Jo Erskine

• Relative Equational Specification and Semantics
  Jo Erskine Hannay
  LFCS report ECS-LFCS-97-366
  
• Referential Opacity in Equational Reasoning
  Jo Erskine Hannay
  LFCS report ECS-LFCS-98-398
  
• Abstraction Barriers and Refinement in the Polymorphic Lambda Calculus
  Jo Erskine Hannay
  
  

Harland, James

• The Uniform Proof-Theoretic Foundation of Linear Logic Programming
  James Harland and David Pym
  LFCS report ECS-LFCS-90-124
  
• The Uniform Proof-theoretic Foundation of Linear Logic Programming (Extended Abstract)
  J Harland and D Pym
  LFCS report ECS-LFCS-91-168
  
• On Hereditary Harrop Formulae as a Basis for Logic Programming
  J Harland
  LFCS report ECS-LFCS-91-170 (also published as CST-81-91)
  
• On Resolution in Fragments of Classical Linear Logic (Extended Abstract)
  J Harland and D J Pym
  LFCS report ECS-LFCS-92-212
  
• A Synopsis on the Identification of Linear Logic Programming Languages
  James Harland and David Pym
  LFCS report ECS-LFCS-92-248
  

Harper, Robert

• Standard ML
  Harper, MacQueen and Milner
  LFCS report ECS-LFCS-86-2
  
• Modules and Persistence in Standard ML
  R.Harper
  LFCS report ECS-LFCS-86-11
  
• Introduction to Standard ML
  R.Harper
  LFCS report ECS-LFCS-86-14
  
• A Framework for Defining Logics
  R.Harper, F.Honsell and G.Plotkin
  LFCS report ECS-LFCS-87-23
  
• A Type Discipline for Program Modules
  R.Harper, R.Milner and M.Tofte
  LFCS report ECS-LFCS-87-28
  
• The Semantics of Standard ML - Version 1
  Harper, Milner, Tofte
  LFCS report ECS-LFCS-87-36
  
• The Essence of ML
  R. Harper and J. Mitchell
  LFCS report ECS-LFCS-87-42
  
• Workshop on General Logic - Edinburgh 1987
  Avron, Harper, Honsell, Mason and Plotkin
  LFCS report ECS-LFCS-88-52
  
• Constructing Type Systems over an Operational Semantics
  R. Harper
  LFCS report ECS-LFCS-88-59
  
• The Definition of Standard ML - Version 2
  R Harper, R Milner and M Tofte
  LFCS report ECS-LFCS-88-62
  
• An Equational Formulation of LF
  R. Harper
  LFCS report ECS-LFCS-88-67
  
• Structure and Representation in LF
  Harper, Sannella and Tarlecki
  LFCS report ECS-LFCS-89-75
  
• The Definition of Standard ML - Version 3
  Harper, Milner and Tofte
  LFCS report ECS-LFCS-89-81
  
• Higher-Order Modules and the Phase Distinction
  Harper, Moggi and Mitchell
  LFCS report ECS-LFCS-90-112
  
• A Framework for Defining Logics
  Robert Harper, Furio Honsell and Gordon Plotkin
  LFCS report ECS-LFCS-91-162
  

Hasegawa, Masahito

• Models of Sharing Graphs: A Categorical Semantics of let and letrec
  Masahito Hasegawa
  LFCS report ECS-LFCS-97-360
  

Hermida, Claudio Alberto

• Fibrations, Logical Predicates and Indeterminates
  Claudio Alberto Hermida
  LFCS report ECS-LFCS-93-277 (also published as CST-103-93)
  

Hillston, Jane

• Using Markovian Process Algebra to Specify Interactions in Queueing Systems
  Nigel Thomas and Jane Hillston
  LFCS report ECS-LFCS-97-373
  
• Elementary structural analysis for PEPA
  Stephen Gilmore, Jane Hillston and Laura Recalde
  LFCS report ECS-LFCS-97-377
  
• A Class of PEPA Models Exhibiting Product Form Solution over Submodels
  Jane Hillston
  LFCS report ECS-LFCS-98-382
  

Hirshfeld, Yoram

• Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes
  S Christensen, Y Hirshfield and F Moller
  LFCS report ECS-LFCS-92-244
  
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
  Yoram Hirshfeld, Mark Jerrum and Faron Moller
  LFCS report ECS-LFCS-94-286
  
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
  Yoram Hirshfeld, Mark Jerrum and Faron Moller
  LFCS report ECS-LFCS-94-288
  
• Congruences in Commutative Semigroups
  Yoram Hirshfeld
  LFCS report ECS-LFCS-94-291
  
• Deciding equivalences in simple Process Algebras
  Yoram Hirshfeld
  LFCS report ECS-LFCS-94-294
  
• Bisimulation equivalence is decidable for normed Process Algebra
  Yoram Hirshfeld and Mark Jerrum
  LFCS report ECS-LFCS-98-386
  

Hodas, Joshua

• Logic Programming in a Fragment of Intuitionistic Linear Logic; Extended Abstract
  D Miller and J Hodas
  LFCS report ECS-LFCS-91-158
  

Hofmann, Martin

• An Abstract View of Objects and Subtyping
  Martin Hofmann and Benjamin C Pierce
  LFCS report ECS-LFCS-92-226
  
• Formal Development of Functional Programs in Type Theory - A Case Study
  Martin Hofmann
  LFCS report ECS-LFCS-92-228
  
• Positive Subtyping
  Martin Hofmann and Benjamin Pierce
  LFCS report ECS-LFCS-94-303
  
• On behavioural abstraction and behavioural satisfaction in higher-order logic
  Martin Hofmann and Donald Sannella
  LFCS report ECS-LFCS-95-318
  
• Extensional concepts in intensional type theory
  Martin Hofmann
  LFCS report ECS-LFCS-95-327
  
• Type Systems For Polynomial-time Computation
  Martin Hofmann
  LFCS report ECS-LFCS-99-406
  

Honsell, Furio

• A Framework for Defining Logics
  R.Harper, F.Honsell and G.Plotkin
  LFCS report ECS-LFCS-87-23
  
• Using Typed Lambda Calculus to Implement Formal Systems on a Machine
  Avron, Honsell and Mason
  LFCS report ECS-LFCS-87-31
  
• Models of Self-Descriptive Set Theories
  F Honsell
  LFCS report ECS-LFCS-88-47
  
• Workshop on General Logic - Edinburgh 1987
  Avron, Harper, Honsell, Mason and Plotkin
  LFCS report ECS-LFCS-88-52
  
• A Natural Deduction treatment of Operational Semantics
  R Burstall and F. Honsell
  LFCS report ECS-LFCS-88-69
  
• A Framework for Defining Logics
  Robert Harper, Furio Honsell and Gordon Plotkin
  LFCS report ECS-LFCS-91-162
  
• Pre-logical Relations
  Furio Honsell and Donald Sannella
  LFCS report ECS-LFCS-99-405
  

Huimin, Lin

• Relative Completeness in Algebraic Specification
  Lin Huimin
  LFCS report ECS-LFCS-87-43
  

Hüttel, Hans

• Actions speak louder than words: Proving Bisimilarity for Context-free Processes
  H Huttel and C Stirling
  LFCS report ECS-LFCS-91-145
  
• Undecidable Equivalences for Basic Process Algebra
  J F Groote and H Huttel
  LFCS report ECS-LFCS-91-169
  
• Silence is Golden: Branching Bisimilarity is Decidable for Context-free Processes
  Hans Huttel
  LFCS report ECS-LFCS-91-173
  
• Decidability, Behavioural Equivalences and Infinite Transition Graphs
  Hans Hüttel
  LFCS report ECS-LFCS-91-191 (also published as CST-86-91)
  
• Bisimulation Equivalence is Decidable for all Context-Free Processes
  Soren Christensen, Hans Hüttel, Colin Stirling
  LFCS report ECS-LFCS-92-218
  
• Undecidable Equivalences for Basic Parallel Processes
  Hans Hüttel
  LFCS report ECS-LFCS-93-276