Abstract
We prove that neat and natural fragments of the higher order programming language, PCF, capture complexity classes defined by imposing resource bounds on Turing machines. Moreover, we survey some related research on on Godel’s T, and discuss the relationship between fragments of Godel’s T and fragments of PCF. Our proofs are based on denotational semantics and domain theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
