Skip to main content
SpringerLink
Log in

Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language

  • Higher-Order Methods
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1997, HOA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1298))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, L. Cardelli, PA. Curien, and J-J.. Lévy. Explicit Substitutions. Technical Report 54, Digital Systems Research Center, February 1990.

    Google Scholar 

  2. S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc. of 21st ACM Symposium on Principles of Programming Languages, pages 268–279, Portland, 1994.

    Google Scholar 

  3. P.H. Barendregt. The Lambda Calculus (revised edition). North-Holland, 1984.

    Google Scholar 

  4. Z.E.A. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. λν A Calculus of Explicit Substitutions Which Preserves Strong Normalization. Technical Report 2477, INRIA, Lorraine, January 1995.

    Google Scholar 

  5. A. Bockmayr, S. Krischer, and A. Werner. Narrowing Strategies for Arbitrary Canonical Systems. Fundamenta Informaticae, 24(1,2):125–155, 1995.

    Google Scholar 

  6. E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel-LEAF: A logic plus functional language. Journal of Computer and System Sciences, 42(2):139–185, 1991.

    Google Scholar 

  7. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19,20:583–628, 1994.

    Google Scholar 

  8. M. Hanus, H. Kuchen, and J. J. Moreno-Navarro. Curry: A Truly Functional Logic Language. In Proc. of ILPS'95 Workshop on Visions for the Future of Logic Programming, pages 95–107, 1995.

    Google Scholar 

  9. M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. In Proceedings of Seventh International Conference on Rewrite Techniques and Applications, Lecture Notes in Computer Science 1103, pages 138–152, 1996.

    Google Scholar 

  10. T. Ida and K. Nakahara. Leftmost Outside-In Narrowing Calculi. Journal of Functional Programming, 7(2), 1997. To appear.

    Google Scholar 

  11. T. Ida and S. Okui. Outside-In Conditional Narrowing. IEICE Transactions on Information and Systems, E77-D(6):631–641, 1994.

    Google Scholar 

  12. J. W. Klop. Combinatory Reduction Systems. Mathematical Centre Tracts Nr. 127, CWI, Amsterdam, 1980. PhD Thesis.

    Google Scholar 

  13. H. Kuchen. Higher Order BABEL. In S. Breitinger, H. Kröger, and R. Loogen, editors, Proc. of 5th International Workshop on Functional and Logic Programming, page XII, 1996.

    Google Scholar 

  14. J. Liu and Z. Qian. Using First-Order Narrowing to Solve Goals of Higher-Order Patterns. In Proc. of Fuji International Workshop on Functional and Logic Programming, pages 92–105, July 1995.

    Google Scholar 

  15. A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:213–253, 1994.

    Google Scholar 

  16. A. Middeldorp and S. Okui. A Deterministic Lazy Narrowing Calculus. In Fuji International Workshop on Functional and Logic Programming, pages 104–118. World Scientific, 1995.

    Google Scholar 

  17. A. Middeldorp, S. Okui, and T. Ida. Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theoretical Computer Science, 167:95–130, 1996.

    Google Scholar 

  18. J. J. Moreno-Navarro and M.Rodriguez-Artalejo. Logic Programming with Functions and Predicates: The Language BABEL. Journal of Logic Programming, 12:191–223, 1992.

    Google Scholar 

  19. F. Müller. Confluence of the lambda calculus with left-linear algebraic rewriting. Information Processing Letters, 41:293–299, 1992.

    Google Scholar 

  20. K. Nakahara, A. Middeldorp, and T. Ida. A Complete Narrowing Calculus for Higher-Order Functional Logic Programming. In Proc. of the 7th Programming Languages Implementation and Logic Programming, Lecture Notes in Computer Sciences 982, pages 99–114, 1995.

    Google Scholar 

  21. T. Nipkow. Higher-order critical pairs. In Proc. Sixth Annual IEEE Symposium on Logic in Computer Science, pages 342–349, 1991.

    Google Scholar 

  22. C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. PhD thesis, Technischen Universität München, 1995.

    Google Scholar 

  23. Z. Qian. Linear Unification of Higher-Order Patterns. In Proc. of Theory and Practice of Software Development, Lecture Notes in Computer Sciences 668, pages 391–405. Springer Verlag, 1993.

    Google Scholar 

  24. T. Suzuki. Standardization theorem revisited. In Proceedings of Fifth International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science 1139, pages 122–134, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Sciences and Electronics, University of Tsukuba, Japan

    Taro Suzuki, Koji Nakagawa & Tetsuo Ida

Authors
  1. Taro Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koji Nakagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tetsuo Ida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Jan Heering Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suzuki, T., Nakagawa, K., Ida, T. (1997). Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language. In: Hanus, M., Heering, J., Meinke, K. (eds) Algebraic and Logic Programming. ALP HOA 1997 1997. Lecture Notes in Computer Science, vol 1298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027005

Download citation

  • DOI: https://doi.org/10.1007/BFb0027005

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63459-1

  • Online ISBN: 978-3-540-69555-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation