Author： Loader R.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.266, Iss.1, 2001-09, pp. : 341-364
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
By Loader R.
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
PCF extended with real numbers
By Escardo M.H.
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :
Self-assembly of decidable sets
Natural Computing, Vol. 10, Iss. 2, 2011-06 ,pp. :
A class of decidable information logics
By Demri S.
Theoretical Computer Science, Vol. 195, Iss. 1, 1998-03 ,pp. :
Decidability of behavioural equivalence in unary PCF
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :