Theoretical Aspects of Computer Software

- Full Abstraction for PCF (extended abstract)

- Fully abstract semantics for concurrent ?-calculus

- An operational approach to combining classical set theory and functional programming languages

- ML typing, explicit polymorphism and qualified types

- Extensions to type systems can preserve operational equivalences

- Constraint programming and database query languages

- Intuitionistic resolution for a logic programming language with scoping constructs

- Proof by pointing

- A computer-checked verification of Milner's scheduler

- A purely functional language with encapsulated assignment

- Simple termination of hierarchical combinations of term rewriting systems

- Separate abstract interpretation for control-flow analysis

- Extensible denotational language specifications

- A normalizing calculus with overloading and subtyping

- A theory of primitive objects

- Programming objects with ML-ART an extension to ML with abstract and record types

- A type system for a lambda calculus with assignments

- Theory and practice of Concurrent Object-Oriented Computing

- The family relation in Interaction Systems

- On syntactic and semantic action refinement

- Locality and true-concurrency in calculi for mobile processes

- Term rewriting properties of SOS axiomatisations

- The tyft/tyxt format reduces to tree rules

- Undecidable equivalences for basic parallel processes

- Normal proofs and their grammar

- A symmetric lambda calculus for "classical" program extraction

- The ? ?-calculus

- Syntactic definitions of undefined: On defining the undefined

- Discovering needed reductions using type theory

- Nontraditional applications of automata theory

- Abstract pre-orders

- Categorical models of relational databases I: Fibrational formulation, schema integration

- Petri nets, Horn programs, Linear Logic, and vector games

- A complete type inference system for subtyped recursive types

-