Typed higher-order narrowing without higher-order strategies

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

Volumn 1722, Issue , 1999, Pages 335-352

  Antoy, Sergio ^a   Tolmach, Andrew ^a  

^a Portland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING;

FIRST ORDER; FUNCTIONAL LOGIC PROGRAMMING; HIGHER-ORDER; NEW APPROACHES; REWRITE SYSTEMS; TYPE INFORMATION;

LOGIC PROGRAMMING;

EID: 84957684338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_22     Document Type: Conference Paper

References (15)

1. S. Antoy. Optimal non-deterministic functional logic computations. In Proc, of the 6th Int. Conference on Algebraic and Logic Programming (ALF'97), pages 16-30, Southampton, UK, Sept. 1997. Springer LNCS 1298. 337, 349
2. S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of the 14th Int. Conference on Logic Programming (ICLF'97), pages 138-152, Leuven, Belgium, July 1997. MIT Press. 349
3. J. M. Bell, F. Bellegarde, and J. Hook. Type-driven defunctionalization. In Proc. 2nd International Conference on Functional Frogramming, pages 25-37, June 1997. 337
4. Curry: An integrated functional logic language. M. Hanus (ed.), Draft Jan. 13, 1999. 335, 337, 350
5. J.C. Gonzalez-Moreno. A correctness proof for Warren's HO into FO translation. In Proc. GULF' 93, pages 569-585, Gizzeria Lido, IT, Oct. 1993. 336, 336, 337, 337, 342, 343, 348, 348, 348, 348, 348
6. M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. In Proc. 7th International Conference on Rewriting Techniques and Applications (RTA '96), pages 138-152. Springer LNCS 1103, 1996. 337, 337, 339, 349, 350, 350, 350, 350, 350, 350, 350
7. Michael Hanus. Polymorphic higher-order programming in prolog. In Proc. 6th International Conference on Logic Frogramming, pages 382-397. MIT Press, June 1989. 336, 346
8. Michael Hanus. A functional and logic language with polymorphic types. In Proc. International Symposium on Design and Implementation of Symbolic Computation Systems, pages 215-224. Springer LNCS 429, 1990. 336, 346
9. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991. 337, 350
10. K. Nakahara, A. Middeldorp, and T. Ida. A complete narrowing calculus for higher-order functional logic programming. In Proc. 7th International Symposium on Frogramming Languages, Implementations, Logics and Frograms (FLILF'95), pages 97-114. Springer LNCS 982, 1995. 336, 337, 339, 341, 349, 349, 350, 350
11. J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM National Conference, pages 717-740. ACM, 1972. 336, 337
12. A. Tolmach and D. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Frogramming, 8(4):367-412, July 1998. 337, 337, 346
13. D.H.D. Warren. Higher-order extensions to PROLOG: are they needed? In Machine Intelligence 10, pages 441-454, 1982. 336, 336, 337, 342
14. Proc. Workshop on Types in Compilation (TIC97), June 1997. Boston College Computer Science Technical Report BCCS-97-03. 336
15. Proc. Second Workshop on Types in Compilation (TIC98). Springer LNCS 1473, March 1998. 336