Functional logic languages part I

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

Volumn 279 LNCS, Issue , 1987, Pages 401-425

  Reddy, Uday S ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; SEMANTICS;

EXISTENTIAL QUANTIFICATIONS; FUNCTIONAL LANGUAGES; FUNCTIONAL LOGIC LANGUAGES; LAMBDA CALCULUS; OPERATIONAL SEMANTICS;

COMPUTER CIRCUITS;

EID: 85032866986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18420-1_68     Document Type: Conference Paper

References (20)

1. R. M. Burstall, D. B. MacQueen, and D. T. Sanella. Hope: an experimental applicative language. In ACM LISP Conference, pages 136-143, 1980.
2. A. Colmerauer, H. Kanouri, R. Pasero, and P. Roussel. Un Syateme de Communication Homme-machine en Francais. Research Report, Groupe Intelligence Artificielle, Universite Aix-Marseille II, 1973.
3. W. F. Clocksin and C. S. Mellish. Programming in Prolog. Springer-Verlag, 1981.
4. J. Darlington, A. J. Field, and H. Pull. The unification of functional and logic languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 37-70, Prentice-Hall, 1986.
5. M. Fay. First-order unification in an equational theory. In Fourth Workshop on Automated Deduction, pages 161-167, Austin, Texas, 1979.
6. J-M. Hullot. Canonical forms and unification. In Conference on Automated Deduction, pages 318-334, 1980.
7. R. A. Kowalski. Logic for Problem Solving. North-Holland, 1979.
8. R. Kowalski. Logic programming. In R. E. A. Mason, editor, Information Processing, pages 133-145, North-Holland, 1983.
9. G. Lindstrom. Functional programming and the logical variable. In ACM Symposium on Principles of Programming Languages, 1985.
10. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
11. R Milner. A proposal for Standard ML. In ACM Symposium on LISP and Functional Programming, pages 184-197, 1984.
12. R.S. Nikhil, K. Pingali, and Arvind. Id Nouveau. Technical Report CSG 265, MIT, 1986.
13. U. S. Reddy. Narrowing as the operational semantics of functional languages. In Symposium on Logic Programming, IEEE, Boston, 1985.
14. U. S. Reddy. On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 3-36, Prentice-Hall, 1986.
15. U.S. Reddy. Logic Languages based on Functions: Semantics and Implementation. Technical Report UIUCDCS-R-86-1305, University of Illinois at Urbana-Champaign, 1986. Ph.D. thesis done at University of Utah.
16. J. R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM, 21(4):622-642, 1974.
17. G. Smolka. Fresh: a higher-order language based on unification. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 469-524, Prentice-Hall, 1986.
18. M. Sato and T. Sakurai, Qute: a functional language based on unification. In Intl. Conf. Fifth Generation Computer Systems, pages 157-165, ICQT. 1984.
19. D.A Turner. The semantic elegance of applicative languages. In Proceedings of the 1981 conference on Functional Programming Languages and Computer Architecture, pages 85-92, ACM, 1981.
20. D.A. Turner. Miranda: a non-strict functional language with polymorphic types. In JP. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 1-16, Springer-Verlag, 1985.