LFCS reports 1997
- Decidability of Bisimulation Equivalence for Normed Pushdown
Processes
Colin Stirling
LFCS report ECS-LFCS-97-352
- Logical Full Abstraction and PCF
John Longley and Gordon Plotkin
LFCS report ECS-LFCS-97-353
- A Type-Theoretic Analysis of Modular Specifications
Savitri Maharaj
LFCS report ECS-LFCS-97-354
- Model Checking the Full Modal Mu-Calculus for Infinite
Sequential Processes
Olaf Burkart and Bernhard Steffen
LFCS report ECS-LFCS-97-355
- Using Automata to Characterise Fixed Point Temporal
Logics
Roope Kaivola
LFCS report ECS-LFCS-97-356
- 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
- Some Lambda Calculus and Type Theory Formalized
James McKinna and Robert Pollack
LFCS report ECS-LFCS-97-359
- Models of Sharing Graphs: A Categorical Semantics of let and
letrec
Masahito Hasegawa
LFCS report ECS-LFCS-97-360
- Typed Operational Semantics for Higher Order
Subtyping
Adriana Compagnoni and Healfdene Goguen
LFCS report ECS-LFCS-97-361
- The C-LEMMA Memory Interface on the Cray T3D
Christopher D. Walton and Bruce J. McAdam
LFCS report ECS-LFCS-97-362
- Subject Reduction and Minimal Types for Higher Order
Subtyping
Adriana Compagnoni
LFCS report ECS-LFCS-97-363
- Programming in Standard ML '97: A Tutorial
Introduction
Stephen Gilmore
LFCS report ECS-LFCS-97-364
- Decidable Higher Order Subtyping
Adriana Compagnoni
LFCS report ECS-LFCS-97-365
- Relative Equational Specification and Semantics
Jo Erskine Hannay
LFCS report ECS-LFCS-97-366
- The modal mu-calculus alternation hierarchy is
strict
J.C. Bradfield
LFCS report ECS-LFCS-97-367
- Implementing Proof by Pointing without a Structure
Editor
Yves Bertot, Thomas Kleymann-Schreiber and Dilip Sequeira
LFCS report ECS-LFCS-97-368
- The Verification of Asynchronous Circuits using CCS
Graham Clark and George Taylor
LFCS report ECS-LFCS-97-369
- Subtyping Dependent Types
David Aspinall and Adriana Compagnoni
LFCS report ECS-LFCS-97-370
- Linear Type Theories, Semantics and Action Calculi
Andrew Barber
LFCS report ECS-LFCS-97-371
- Lecture Notes on Formal Program Development
Stefan Kahrs
LFCS report ECS-LFCS-97-372
- Using Markovian Process Algebra to Specify Interactions in
Queueing Systems
Nigel Thomas and Jane Hillston
LFCS report ECS-LFCS-97-373
- PCF extended with real numbers: a domain-theoretic approach
to higher-order exact real number computation
Martín Hötzel Escardó
LFCS report ECS-LFCS-97-374
- That About Wraps it Up: Using FIX to Handle Errors Without
Exceptions, and Other Programming Tricks
Bruce J. McAdam
LFCS report ECS-LFCS-97-375
- Categorical Structure of Continuation Passing Style
Hayo Thielecke
LFCS report ECS-LFCS-97-376
- 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
- Machine Assisted Proofs for Generic Semantics to Compiler
Transformation Correctness Theorems
Saif Ullah Kahn
LFCS report ECS-LFCS-97-379