Linear time hierarchies for a functional language machine model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1058, Issue , 1996, Pages 311-325

  Rose, Eva ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

CAM; Complexity hierarchy; Functional languages; Linear time; Operational semantics; Selective update; Structured data

Indexed keywords

CAMS; COMPUTABILITY AND DECIDABILITY; FORESTRY; FUNCTIONS; SEMANTICS;

COMPLEXITY HIERARCHIES; FUNCTIONAL LANGUAGES; LINEAR TIME; OPERATIONAL SEMANTICS; SELECTIVE UPDATES; STRUCTURED DATA;

TREES (MATHEMATICS);

EID: 0002617989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_45     Document Type: Conference Paper

References (19)

1. A.M. Ben-Amram. Pointer machines and pointer algorithms: an annotated bibliography. Diku-rapport 95/21, DIKU (Department of Computer Science), University of Copenhagen, September 1995.
2. A.M. Ben-Amram and N.D. Jones. Complexity-theoretic advantages of structured programs and structured data. Personal communication, October 1995.
3. H.P. Barendregt, M.C.D.J. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, PARLE '87-Parallel Architectures and Languages Europe vol. II, number 256 in LNCS, pages 141-158, Eindhoven, The Netherlands, June 1987. Springer-Verlag.
4. G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8:173-202, 1987
5. 4 Report on the Algorithmic Language Scheme, November 1991.
6. P.-L. Curien. An abstract framework for environment machines. Theoretical Computer Science, 82(2):389-402, 1990.
7. C. Dahl and M. Hessellund. Determining the constant coefficients in a time hierarchy. Student report 94-2-2, DIKU (University of Copenhagen), Department of Computer Science, Universitetsparken 1, DK-2100 Copenhagen Ø, Denmark, February 1994.
8. Y. Gurevich and S. Shelah. Nearly linear time. In Logic at Botik, volume 363 of LNCS, pages 108-118. Springer-Verlag, 1985.
9. J. Hannan. Making abstract machines less abstract. In Functional Programming Languages and Computer Architecture, number 523 in LNCS, pages 618-635. Springer-Verlag, August 1991.
10. N.D. Jones. Constant time factors do matter. In Steven Homer, editor, STOC '93. Symposium on Theory of Computing, pages 602-611. ACM Press, 1993.
11. N.D. Jones. Program speedups in theory and practice. In B. Pehrson and I. Simon, editors, 13th World Computer Congress 94, volume 1. IFIP, Elsevier Science B.V. (North-Holland), 1994.
12. G. Kahn. Natural semantics. Rapport de Recherche 601, INRIA, Sophia-Antipolis, France, February 1987.
13. A.R. Meyer et al. Algorithm and Complexity, volume A of Handbook of Theoretical Computer Science. Elsevier Science Publishers B.V., 1990.
14. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
15. R. Paige and F. Henglein. Mechanical translation of set theoretic problem specifications into efficient ram code-a case study. In Lisp and Symbolic Computation, volume 4, pages 207-232. North-Holland, August 1987.
16. G.D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, DAIMI, Aarhus University, Aarhus, Denmark, 1981.
17. K. Regan. Linear speed-up, information vicinity, and finite-state machines. In IFIP proceedings. North-Holland, 94.
18. E. Rose. Linear time hierarchies for a functional language machine model. Student report, DIKU, Department of Computer Science, Universitetsparken 1, 2100 Copenhagen Ø, Denmark, 1996.
19. P. Weis et al. The CAML Reference Manual. INRIA-ENS, version 2. 5 edition, December 1987.