Author： Jeffrey A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.228, Iss.1, 1999-10, pp. : 105-150
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
Soundness of data refinement for a higher-order imperative language
By Naumann D.A.
Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. :
Access to resources
Recommend
Primitive recursion for higher-order abstract syntax
By Schurmann
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
A fully abstract denotational semantics for the -calculus
By Hennessy M.
Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. :
Fully abstract compositional semantics for an algebra of logic programs
Theoretical Computer Science, Vol. 149, Iss. 2, 1995-10 ,pp. :
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :