微信服务号

微信订阅号

2025-4-4- 6
Home > Archive>Volume 12, Issue 9, 2001 >1279-1286
PDF HTML XML Export Cite reminder
Operational Semantics for Functional Logic Languages
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [26]
    • |
  • Related [20]
    • |
  • Cited by [1]
    • | |
  • Comments
    Abstract:

    Functional languages and logic languages complement each other in the following sense. Functional programming languages, based on reduction, have properties such as deterministic evaluation and lazy evaluation; however they lack some desirable properties such as existentially quantified variables and partial data structures. On the contrary, logic programming languages, based on Horn clause logic and resolution, allow existentially quantified variables and partial data structures but lack both deterministic evaluation and lazy evaluation. From this point of view it is natural to inegrate functional and logic programming languages into one paradigm.This provides a unified language with more expressive power than both logic and functional languages.This pa-per discusses the proposal for an operational semantics of functional logic languages,and demonstrates tthat the operational semantics is practically visible.

    Reference
    [1] Darlington, J., Guo, Y. Narrowing and unification in functional programming-an evaluation mechanism for absolute set abstraction. LNCS 355, 1989.
    [2] Silbermann, F.S.K., Jayaraman, B. Set abstraction in functional and logic programming. In: Proceedings of the 4th International Conference on Functional Programming and Computer Architecture. 1989.
    [3] Silbermann, F.S.K., Jayaraman, B. A domain-theoretic approach to functional and logic programming. Technical Report TUTR 91-109, Tulane University, 1991.
    [4] Bonnier, S., Maluszynski, J. Towards a clean amalgamation of logic programs with external procedures. In: Proceedings of the 5th Conference on Logic Programming. MIT Press, 1988.
    [5] Hanus, M. The Integration of functions into logic programming: from theory to practice. Journal of Logic Programming, 1994,19-20:583～628.
    [6] Middeldorp, A., Hamoen, E. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 1994,5:213～253.
    [7] Slagle, J.R. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of ACM, 1974,21(4):622～642.
    [8] Bockmayr, A., Krischer, S., Werner, A. Narrowing strategies for arbitrary canonical systems. Fundamenta Informaticae, 1995,24(1,2):125～155.
    [9] Echahed, R. On completeness of narrowing strategies. In: Proceedings of the CAAP'88. LNCS 299, 1988.
    [10] Hullot, J-M. Canonical Forms and Unification. LNCS, 1980,87:318～334.
    [11] Hanus, M. Efficient implementation of narrowing and rewriting. In: Proceedings International Workshop on Processing Declarative Knowledge. LNAI 567, 1991.
    [12] Hlldobler, S. Foundations of Equational Logic Programming. Lecture Notes in Artificial Intelligence, 1989.
    [13] Ida, T., Nakahara, K. Leftmost outside-in narrowing calculi. Journal of Functional Programming, 1997,7(2).
    [14] Snyder, W. A Proof Theory for General Unification. Birkhuser, 1991.
    [15] Hamada, M., Middeldorp, A. Strong completeness of a lazy conditional narrowing calculus. Functional and Logic Programming, Singapore: World Scientific, 1997. 14～32.
    [16] Hamada, M. Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables. ENTCS, 2000,31(1):83～97.
    [17] Hamada, M., Middeldorp, A., Suzuki, T. Completeness results for a lazy conditional narrowing calculus. Combinatorics, Computation and Logic, Springer-Verlag, 1999. 217～231.
    [18] Hamada, M., Ida, T. Deterministic and non-deterministic lazy conditional narrowing and their implementations. Journal of Information Processing Society, 1998,39(3).
    [19] Wolfram, S. The Mathematica Book. Wolfram Media Inc. Champaign, Illinois and Cambridge University Press 1999.
    [20] Baader, F., Nipkow, T. Term Rewriting and All That. Cambridge University Press, 1998.
    [21] Klop, J.W. Term rewriting systems. In: Abramsky, S., et al., eds. Handbook of Logic in Computer Science. Oxford University Press, 1992. 1～116.
    [22] Caprotti, O. Symbolic pattern solving for equational reasoning. In:Proceedings of the International Workshop of First-Order Theorem Proving. Austria, 1997. 53～57.
    [23] Caprotti, O. Symbolic pattern solving in algebraic structures[Ph.D. Thesis]. RISC-Linz, Research Institute for Symbolic Computation, 1997.
    [24] Middeldorp, A., Okui, S. A deterministic lazy narrowing calculus. Journal of Symbolic Computation, 1998,25(6):733～757.
    [25] Middeldorp, A., Okui, S., Ida, T. Lazy narrowing: strong completeness and eager variable elimination. Theoretical Computer Science, 1996,67(1,2):95～130.
    [26] Hanus, M., Kuchen, H. Curry: an Integrated Functional Logic Language. (Draft version) RWTH Aachen, Germany, 1997.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

MOHAMEDHamada.函数式逻辑语言的操作语义.软件学报,2001,12(9):1279-1286

Copy
Share
Article Metrics
  • Abstract:3427
  • PDF: 4500
  • HTML: 0
  • Cited by: 0
History
  • Received:February 05,2001
  • Revised:April 03,2001
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032668Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063