LFCS reports by Author: G

Galpin, Vashti Christina

• Equivalence semantics for concurrency: comparison and application
  Vashti Christina Galpin
  LFCS report ECS-LFCS-98-397
  

Gardner, Philippa

• Representing Logics in Type Theory
  Philippa Gardner
  LFCS report ECS-LFCS-92-227 (also published as CST-93-92)
  
• An Algorithm for Constructing beta-eta-long normal forms
  Philippa Gardner
  LFCS report ECS-LFCS-92-250 (UNAVAILABLE)
  
• Equivalences between Logics and their Representing Type Theories
  Philippa Gardner
  LFCS report ECS-LFCS-92-251
  

Ghani, Neil

• The Virtues of Eta-expansion
  C Barry Jay and Neil Ghani
  LFCS report ECS-LFCS-92-243
  
• Adjoint rewriting
  Neil Ghani
  LFCS report ECS-LFCS-95-339
  

Gilmore, Stephen

• Correctness-Oriented Approaches to Software Development
  Stephen Gilmore
  LFCS report ECS-LFCS-91-147 (also published as CST-76-91)
  
• Supporting Formal Reasoning about Standard ML
  Graham Collins and Stephen Gilmore
  LFCS report ECS-LFCS-94-310
  
• Programming in Standard ML '97: A Tutorial Introduction
  Stephen Gilmore
  LFCS report ECS-LFCS-97-364
  
• Elementary structural analysis for PEPA
  Stephen Gilmore, Jane Hillston and Laura Recalde
  LFCS report ECS-LFCS-97-377
  
• Dynamic ML without Dynamic Types
  Stephen Gilmore, Dilsun Kirli and Christopher Walton
  LFCS report ECS-LFCS-97-378
  

Goguen, Healfdene

• Inductive Data Types: Well-ordering Types Revisited
  H. Goguen and Zhaohui Luo
  LFCS report ECS-LFCS-92-209
  
• A Typed Operational Semantics for Type Theory
  Healfdene Goguen
  LFCS report ECS-LFCS-94-304
  
• Sequent Combinators: A Hilbert System for the Lambda Calculus
  Healfdene Goguen
  LFCS report ECS-LFCS-97-357
  
• Candidates for Substitution
  Healfdene Goguen and James McKinna
  LFCS report ECS-LFCS-97-358
  
• Typed Operational Semantics for Higher Order Subtyping
  Adriana Compagnoni and Healfdene Goguen
  LFCS report ECS-LFCS-97-361
  

Goguen, Joseph A

• A Study in the Foundations of Programming Methodology: Specifications, Institutions, Charters and Parchments
  R.Burstall and J.Goguen
  LFCS report ECS-LFCS-86-10
  
• Some Fundamental Algebraic Tools for the Semantics of Computation - Part III: Indexed Categories
  A Tarlecki, R M Burstall and J A Goguen
  LFCS report ECS-LFCS-88-60
  
• Some Fundamental Algebraic Tools for the Semantics of Computation. Part 3. Indexed Categories
  R. Burstall, J. Goguen and A. Tarlecki
  LFCS report ECS-LFCS-89-90
  
• INSTITUTIONS: Abstract Model Theory for Specification and Programming
  R. Burstall and J. Goguen
  LFCS report ECS-LFCS-90-106
  

Goldberg, Leslie Ann

• Efficient Algorithms for Listing Combinatorial Structures
  Leslie Ann Goldberg
  LFCS report ECS-LFCS-92-198 (also published as CST-89-92)
  
• Listing Graphs that Satisfy First Order Sentences
  L A Goldberg
  LFCS report ECS-LFCS-92-210
  
• A Sub-logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-92-234
  
• The ``Burnside process'' converges slowly
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-98-387
  
• Counting unlabelled subtrees of a tree is #P-complete
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-99-417
  

Goldberg, Paul W

• PAC-Learning Geometrical Figures
  Paul W Goldberg
  LFCS report ECS-LFCS-93-258 (also published as CST-98-93)
  

Goossens, Kees G W

• Embedding a CHDDL in a Proof System
  K. Goossens
  LFCS report ECS-LFCS-91-155
  
• Opeerational Semantics Based Formal Symbolic Simulation
  K G W Goossens
  LFCS report ECS-LFCS-92-231
  
• 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
  
• Structure and Behaviour in Hardware Verification
  K G W Goossens
  LFCS report ECS-LFCS-93-273
  

Gordon, Andrew

• How to Breed Compiler/Interpreters
  A. Gordon
  LFCS report ECS-LFCS-88-50
  

Gordon, Robert

• Enrichment Through Variation
  R. Gordon and A. J. Power
  LFCS report ECS-LFCS-93-254
  
• Algebraic Structure for Bicategory Enriched Categories
  R Gordon and A J Power
  LFCS report ECS-LFCS-96-342
  

Gore, Vivek

• A quasi-polynomial-time algorithm for sampling words from a context-free language
  Vivek Gore and Mark Jerrum
  LFCS report ECS-LFCS-95-326
  
• The Swendsen-Wang process does not always mix rapidly
  Vivek Gore and Mark Jerrum
  LFCS report ECS-LFCS-96-349
  

Griffin, T G

• An Environment for Formal Systems
  T G Griffin
  LFCS report ECS-LFCS-87-34
  

Groote, Jan Frisco

• Undecidable Equivalences for Basic Process Algebra
  J F Groote and H Huttel
  LFCS report ECS-LFCS-91-169
  
• Verification of Parallel Systems via Decomposition
  J F Groote and F Moller
  LFCS report ECS-LFCS-92-193
  

Gurr, Douglas

• Semantic Frameworks for Complexity
  Douglas Gurr
  LFCS report ECS-LFCS-91-130 (also published as CST-72-91)