Full
Abstraction
Factory		 Alan Jeffrey | Julian Rathke
 

Introduction

Papers

  

Papers from the Full Abstraction Factory

  1. Full Abstraction for Polymorphic Pi-Calculus. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. 2007. To appear. Available on-line. Extended abstract in Proc. Foundations of Software Science and Computation Structures. Springer-Verlag. 2005. pp. 266-281. Available on-line.

  2. A Fully Abstract May Testing Semantics for Concurrent Objects. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. vol. 338. 2005. pp. 17-63. Available on-line.

  3. Contextual Equivalence for Higher-Order Pi-Calculus Revisited. A. S. A. Jeffrey and J. Rathke. In Logical Methods in Computer Science. 1 (1:4). 2005. pp. 1-22. Available on-line. Extended abstract in Proc. Mathematical Foundations of Programming Semantics. Elsevier. 2003. Available on-line.

  4. Java Jr.: Fully Abstract Trace Semantics for a Core Java Language. A. S. A. Jeffrey and J. Rathke. In Proc. European Symposium on Programming. Springer-Verlag. 2005. pp. 423-438. Available on-line.

  5. A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. vol. 323. 2004. pp. 1-48. Available on-line. Extended abstract in Proc. IEEE Logic in Computer Science. IEEE Press. 2000. pp. 311-321. Available on-line.

  6. Towards a Theory of Bisimulation for Local Names. A. S. A. Jeffrey and J. Rathke. In Proc. IEEE Logic in Computer Science. IEEE Press. 1999. pp. 56--66. Available on-line.

  7. A Fully Abstract Semantics for a Nondeterministic Functional Language with Monadic Types. A. S. A. Jeffrey. In Theoretical Computer Science. vol. 228. 1999. pp. 105-150. Available on-line. Extended abstract in Proc. Mathematical Foundations of Programming Semantics. Elsevier. 1995. Available on-line.

  8. Semantics for Core Concurrent ML Using Computation Types. A. S. A. Jeffrey. In Proc. Higher Order Operational Techniques in Semantics. Cambridge University Press. 1997. pp. 55-89. Available on-line.

  9. A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types. A. S. A. Jeffrey. In Proc. IEEE Logic in Computer Science. IEEE Press. 1995. pp. 255--264. Available on-line.

  10. A Fully Abstract Semantics for Concurrent Graph Reduction. A. S. A. Jeffrey. In Proc. IEEE Logic in Computer Science. IEEE Press. 1994. pp. 82-91. Available on-line.

Danger, Will Robinson.

This material is partly based upon work supported by the National Science Foundation under Grant No. 0430175,
by the Engineering and Physical Sciences Research Council grants
Foundations for the Integration of Concurrent, Distributed and Functional Computation and Linear Type Systems for Concurrent Systems,
and by the Nuffield Foundation grant A Semantic Study of Behavioural Properties for Systems of Distributed Objects.
Copyright © 1994-2005 Alan Jeffrey and Julian Rathke. Edited 26 February 2007