Author： Valentini S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.1, 2003-01, pp. : 189-219
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
Representing inductively defined sets by wellorderings in Martin-Lof's type theory
By Dybjer P.
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :
Access to resources
Recommend
The largest cartesian closed category of stable domains
By Guo-Qiang Z.
Theoretical Computer Science, Vol. 166, Iss. 1, 1996-10 ,pp. :
Constructive domain theory as a branch of intuitionistic pointfree topology
By Sambin G. Valentini S. Virgili P.
Theoretical Computer Science, Vol. 159, Iss. 2, 1996-06 ,pp. :
Effective category and measure in abstract complexity theory
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :