**Paczkowski, Pawel**-
**Proving total correctness of concurrent programs without using auxiliary variables**

P. Paczkowski

*LFCS report ECS-LFCS-89-100*

**Annotated Transition Systems for Verifying Concurrent Programs**

P. Paczkowski

*LFCS report ECS-LFCS-91-150 (also published as CST-78-91)*

**Parrow, Joachim**-
**Verifying a CSMA/CD-protocol with CCS**

J. Parrow

*LFCS report ECS-LFCS-86-18*

**Submodule Construction as Equation Solving in CCS**

J. Parrow

*LFCS report ECS-LFCS-87-26*

**Synchronisation Flow Algebra**

J Parrow

*LFCS report ECS-LFCS-87-35*

**The Concurrency Workbench: A Semantics-based Verification Tool for Finite-State Systems**

R. Cleaveland, J. Parrow and B. Steffen

*LFCS report ECS-LFCS-89-83*

**A Calculus of Mobile Processes Pt.1**

Milner, Parrow and Walker

*LFCS report ECS-LFCS-89-85*

**A Calculus of Mobile Processes Pt.2**

Milner, Parrow and Walker

*LFCS report ECS-LFCS-89-86*

**Modal Logics for Mobile Processes**

R. Milner, J. Parrow and D. Walker

*LFCS report ECS-LFCS-91-136*

**Algebraic Theories for Name-Passing Calculi**

Joachim Parrow and Davide Sangiorgi

*LFCS report ECS-LFCS-93-262*

**Phoa, Wesley**-
**Domain Theory in Realizability Toposes**

Wesley Phoa

*LFCS report ECS-LFCS-91-171 (also published as CST-82-91)*

**An introduction to fibrations, topos theory, the effective topos and modest sets**

Wesley Phoa

*LFCS report ECS-LFCS-92-208*

**A proposed categorical semantics for Pure ML**

Wesley Phoa and Michael Fourman

*LFCS report ECS-LFCS-92-213*

**From term models to domains**

Wesley Phoa

*LFCS report ECS-LFCS-92-214*

**Building domains from graph models**

Wesley Phoa

*LFCS report ECS-LFCS-92-215*

**Pierce, Benjamin C**-
**Intersection Types and Bounded Polymorphism**

Benjamin Pierce

*LFCS report ECS-LFCS-92-200*

**Object-Oriented Programming Without Recursive Types**

Benjamin C Pierce and David N Turner

*LFCS report ECS-LFCS-92-225*

**An Abstract View of Objects and Subtyping**

Martin Hofmann and Benjamin C Pierce

*LFCS report ECS-LFCS-92-226*

**Statically Types Friendly Functions via Partially Abstract Types**

B C Pierce and D N Turner

*LFCS report ECS-LFCS-93-256*

**Multiple Inheritance via Intersection Types**

Adriana B Compagnoni and Benjamin C Pierce

*LFCS report ECS-LFCS-93-275*

**Higher-Order Subtyping**

Martin Steffen and Benjamin Pierce

*LFCS report ECS-LFCS-94-280*

**Positive Subtyping**

Martin Hofmann and Benjamin Pierce

*LFCS report ECS-LFCS-94-303*

**Plotkin, Gordon D**-
**A Framework for Defining Logics**

R.Harper, F.Honsell and G.Plotkin

*LFCS report ECS-LFCS-87-23*

**Workshop on General Logic - Edinburgh 1987**

Avron, Harper, Honsell, Mason and Plotkin

*LFCS report ECS-LFCS-88-52*

**On Functors Expressible in the Polymorphic Typed Lambda Calculus**

J. Reynolds and G. Plotkin

*LFCS report ECS-LFCS-88-53*

**A Framework for Defining Logics**

Robert Harper, Furio Honsell and Gordon Plotkin

*LFCS report ECS-LFCS-91-162*

**A Semantics for Static Type Inference**

Gordon Plotkin

*LFCS report ECS-LFCS-92-245*

**Logical Full Abstraction and PCF**

John Longley and Gordon Plotkin

*LFCS report ECS-LFCS-97-353*

**Pollack, Randy A**-
**LEGO Proof Development System: User's Manual**

Zhaohui Luo and R Pollack

*LFCS report ECS-LFCS-92-211*

**The Theory of LEGO**

Robert Pollack

*LFCS report ECS-LFCS-95-323*

**Some Lambda Calculus and Type Theory Formalized**

James McKinna and Robert Pollack

*LFCS report ECS-LFCS-97-359*

**Power, A John**-
**An n-Categorical Pasting Theorem**

J Power

*LFCS report ECS-LFCS-91-190*

**Enrichment Through Variation**

R. Gordon and A. J. Power

*LFCS report ECS-LFCS-93-254*

**Why tricategories?**

A J Power

*LFCS report ECS-LFCS-94-289*

**Lax naturality through enrichment**

Yoshiki Kinoshita and John Power

*LFCS report ECS-LFCS-95-330*

**Algebraic Structure for Bicategory Enriched Categories**

R Gordon and A J Power

*LFCS report ECS-LFCS-96-342*

**Prasad, K V S**-
**Combinators and Bisimulation Proofs for Restartable Systems**

K V S Prasad

*LFCS report ECS-LFCS-91-149 (also published as CST-77-91)*

**Pritchard, Paul**-
**An Old Sub-Quadratic Algorithm for Finding Extremal Sets**

Paul Pritchard

*LFCS report ECS-LFCS-94-301*

**On Computing the Subset Graph of a Collection of Sets**

Paul Pritchard

*LFCS report ECS-LFCS-94-309*

**Pym, David J**-
**Investigations into proof-search in a system of first-order dependent function types**

D. Pym and L. Wallen

*LFCS report ECS-LFCS-90-111*

**The Uniform Proof-Theoretic Foundation of Linear Logic Programming**

James Harland and David Pym

*LFCS report ECS-LFCS-90-124*

**Proofs, Search and Computation in General Logic**

David Pym

*LFCS report ECS-LFCS-90-125 (also published as CST-69-90)*

**Proof Search in the lambda-Pi-calculus**

David Pym and L Wallen

*LFCS report ECS-LFCS-91-146*

**The Uniform Proof-theoretic Foundation of Linear Logic Programming (Extended Abstract)**

J Harland and D Pym

*LFCS report ECS-LFCS-91-168*

**On Resolution in Fragments of Classical Linear Logic (Extended Abstract)**

J Harland and D J Pym

*LFCS report ECS-LFCS-92-212*

**A Unification Algorithm for the lambda-Pi-Calculus**

David Pym

*LFCS report ECS-LFCS-92-229*

**Logic Programming via Proof-Valued Computations**

David J Pym and Lincoln A Wallen

*LFCS report ECS-LFCS-92-246*

**A Synopsis on the Identification of Linear Logic Programming Languages**

James Harland and David Pym

*LFCS report ECS-LFCS-92-248*

**Errata and Remarks**

David J Pym

*LFCS report ECS-LFCS-93-265*