Abstract
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well as for an extension of that language based on graph-structured data (Fsu).We consider the Categorical Abstract Machine (CAM), a canonical machine model for implementing higher order functional languages. We show the existence of such a hierarchy for the CAM based on tree-structured data (without selective updating facilities), as well as in the case of graphstructured data (with selective updating). In conclusion we establish two local robustness results where first-order functional programs and higher order functional programs define the same class of linear-time decidable problems.Keywordslinear timecomplexity hierarchyCAMoperational semanticsfunctional languagesselective updatestructured data
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.
