Author： Abramsky S. McCusker G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.227, Iss.1, 1999-09, pp. : 3-42
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Full abstraction for the second order subset of an Algol-like language
By Sieber K.
Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. :
Access to resources
Recommend
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
Full abstraction and recursion
Theoretical Computer Science, Vol. 151, Iss. 1, 1995-11 ,pp. :
Full Abstraction for Strongly Fair Communicating Processes
Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,pp. :
Full abstraction for strongly fair communicating processes
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :