Abstract
In STOC 1993, Jones showed the existence of a hierarchy within problems decidable in linear time by a canonical first-order functional language based on tree-structured data (F), as well as for an extension of that language based on graph-structured data maintained through selective updating (F su). In this paper, we prove the existence of a linear-time hierarchy for an authentic and realistic intermediate “machine” language featuring higher order constructs: the Categorical Abstract Machine. We show the existence of such a hierarchy for the Categorical Abstract Machine based on tree-structured data (CAM) as well as on graph-structured data (CAM su). The existence is shown by constructing mutually efficient interpreters between CAM and F, and CAM su and F su, two robustness results establishing that first-order functional programs written in F, and in F su, define the same class of linear-time decidable problems as the higher-order functional programs run in CAM, and in CAM su, respectively.
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.
