Cited By
View all- Baker H(1993)Equal rights for functional objects or, the more things change, the more they are the sameACM SIGPLAN OOPS Messenger10.1145/165593.1655964:4(2-27)Online publication date: 1-Oct-1993
Nondeterminism and unification in LogScheme: integrating logic and functional programming
Authors: 
Erik Ruf, Daniel WeiseAuthors Info & Claims
Pages 327 - 339
References
[1]
H. Abelson and G. J. Sussman, with J. Sussman. Structure and Interpretation o/ Computer Programs. MIT Press, 1985.
[2]
R. G. Bandes. "Constraining-Unification and the Programming Language Unicorn~. In {7}, pp. 397-410.
[3]
P. Bothner, Efficiently Combining Logical Constraints With Functions. Ph.D. dissertation, Department of Computer Science, Stanford University, 1988.
[4]
M. Bruynooghe. "The Memory Management of PRO- LOG Implementations~. In Logic Programming, K. L. Clark and S. A. T~rnlund (Eds), pp. 83-98. Academic, 1982.
[5]
S. Cohen. "The Applog Language'. In {7}, pp. 239-276.
[6]
S. H. Danforth. "Logical Variables for a Functional Language". MCC Technical Report Number PP-120- 85, 1985.
[7]
D. DeGroot and G. Lindstrom, editors. Logic Programming: Functions, Relations, and Equations. Prentice- Hall, 1986.
[8]
M. Felleisen. Transliterating Prolog into Scheme. Indiana University Computer Science Department Technical Report No. 182, October 1985.
[9]
D. P. Friedman. Applications of Continuations. Tutorial at ACM Symposium on Principles of Programming Languages, 1988.
[10]
R. E. Griswold. The ICON Programming Language. Prentice-Hall, 1983.
[11]
R. H. Halstead, Jr. "Multilisp: A language for concurrent symbolic computation". A CM Transactions on Programming Languages and Systems. 4(4):501-538, October 1985.
[12]
C. T. Haynes. ~Logic Continuations". The Journal of Logic Programming, 4(2):157-176, June 1987.
[13]
C. T. Haynes and D. P Friedman. "Embedding Continuations in Procedural Objects". A CM Transactions on Programming Languages and Systems. 9(4):582-598, October 1987.
[14]
J. Jaffar and J. Lassez. "Methodology and Implementation of a CLP System~. Logic Programming '87. Springer-Verlag, 1988.
[15]
K. M. Kahn. "Uniform: A Language Based upon Unification which Unifies (much of) Lisp, Prolog, and Act 1". In {7}, pp. 411-438.
[16]
J. McCarthy. "A basis for a mathematical theory of computation~. Computer Programming and Formal Systems, P. Bratford and D. Hirschberg (Eds.). North- Holland, 1963.
[17]
J. Miller. Multischeme: A Parallel Processing System Based on MIT Scheme. MIT Laboratory for Computer Science Technical Report No. 402, September 1987.
[18]
U. S. Reddy. "On the relationship between logic and functional languages~. In {7}, pp. 3-36.
[19]
J. Rees and W. Clinger, et. al. ~Revised~ Report on the Algorithmic Language Scheme~. A CM SIGPLAN Notices, 21(12):37-79, December 1986.
[20]
J. A. Robinson and E. E. Sibert. "LOGLISP: Motiration, Design, and implementation". Logic Program. ruing, K. L. Clark and S. A. Tarnlund (Eds), pp. 299- 314. Academic, 1982.
[21]
M. Sato and T. Sakurai. "Qute: a functional language based on unification". In {7}, pp. 1:~1-155.
[22]
A. Srivastava, D. Oxley, and A. Srivastava. "An(other) Integration of Logic and Functional Programming". In Proceedings of the 1985 IEEE Symposium on Logic Pro. gramming. IEEE Press, 1985.
[23]
L. Sterling and E. Shapiro. The Art of Prolog. MiT Press, 1986.
[24]
M. Wand and D. P. Friedman. "The Mystery of the Tower Revealed: ~ Non-Reflective Description of the Reflective Tower". Lisp and Symbolic Computation, I(5), Kluwer Academic Publishers, June 1988.
[25]
R. Zabih. Dependency. Directed Backtracking in Non- Deterministic Scheme. MiT Artificial Intelligence L~boratory Technical Report No. 956, 1988.
Index Terms
- Nondeterminism and unification in LogScheme: integrating logic and functional programming
Recommendations
Probabilistic and Truth-Functional Many-Valued Logic Programming
ISMVL '99: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued LogicWe introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. ...
Narrowing Failure in Functional Logic Programming
FLOPS '02: Proceedings of the 6th International Symposium on Functional and Logic ProgrammingNegation as failure is an important language feature within the logic programming paradigm. The natural notion generalizing negation as failure in a functional logic setting is that of finite failure of reduction. In previous works we have shown the ...
From answer set logic programming to circumscription via logic of GK
We first embed Pearce's equilibrium logic and Ferraris's propositional general logic programs in Lin and Shoham's logic of GK, a nonmonotonic modal logic that has been shown to include as special cases both Reiter's default logic in the propositional ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1989 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1989
Check for updates
Qualifiers
- Article
Conference
FPCA89: The International Conference on Functional Programming Languages & Computer Architectures
September 11 - 13, 1989
Imperial College, London, United Kingdom
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 339Total Downloads
- Downloads (Last 12 months)51
- Downloads (Last 6 weeks)6
Reflects downloads up to 17 Dec 2024
Other Metrics
Citations
Cited By
View all- Baker H(1993)Equal rights for functional objects or, the more things change, the more they are the sameACM SIGPLAN OOPS Messenger10.1145/165593.1655964:4(2-27)Online publication date: 1-Oct-1993
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in