S. J. Gay and C. L. Hankin. Gamma and the logic of transition traces. In A. Edalat, S. Jourdan, and G. McCusker, editors, Advances in Theory and Formal Methods of Computing. Imperial College Press, 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Case for Support: Novel type systems for concurrent programming.. - Gay Self-citation (Gay) (Correct)
....concerned the parallel programming language Gamma [7] we applied Abramsky s domain theory in logical form [3] to develop program logics for the language. The result was two program logics: one based on a resumption semantics for Gamma [12] and the other based on a transition trace semantics [13]. The connection with types for concurrency is via the view of types as speci cations or program properties, which is a theme of domain theory in logical form. Indeed, a broadening of the scope of type theoretic techniques has always been an aim of interaction categories research. Another strand ....
S. J. Gay and C. L. Hankin. Gamma and the logic of transition traces. In A. Edalat, S. Jourdan, and G. McCusker, editors, Advances in Theory and Formal Methods of Computing. Imperial College Press, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC