Article

Free access

Set abstraction in functional and logic programming

Authors:

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

Pages 313 - 326

https://doi.org/10.1145/99370.99398

Published: 01 November 1989 Publication History

PDF eReader

References

[1]

S. Abramsky, "Experiments, PowerdomaJns, and Fully Abstract Models for Applicative Multiprogramming,' In LNCS 158: Foundations of Computation Theory, Springer, Berlin, 1983, pp. 1-13.

Digital Library

Google Scholar

[2]

W.F. Clocksin and C. S. Mellish, Programming in Prolog, Springer-Verlag, New York, 1981.

Digital Library

Google Scholar

[3]

J. Darlington, "Unification of Functional and Logic Programming," internal report, Imperial College, 1983.

Google Scholar

[4]

J. Darlington, A.J. Field, and H. Pull, "Unification of Functional and Logic Languages," In DeGroot and Lindstrom (eds.), Logic Programming, Relations, Functions and Equations, pp. 37-70, Prentice-Hall, 1986.

Google Scholar

[5]

J. Darlington, Y. Guo, "Narrowing and Unification in Functional Programming -- An Evaluation Mechanism for Absolute Set Abstraction," In 3rd International Conference, Rewriting Techniques and Applications, Chapel Hill, NC, April 1989, pp. 92-108.

Digital Library

Google Scholar

[6]

J. Jaffar, J.-L. Lassez, "Constraint Logic Programming," In lJth ACM POPL, pp. 111-119, Munich, 1987.

Digital Library

Google Scholar

[7]

B. Jayaraman and F.S.K. Silbermann, "Equations, Sets, and Reduction Semantics for Functional and Logic Programming," In 1986 A CM Conf. on LISP and Functional Programming, Boston, MA, Aug. 1986, pp. 320-331.

Digital Library

Google Scholar

[8]

P. Hudak, P. Wadler et al, "Report on the Functional Programming Language HaskeU," Yale Research Report DCS/RR-666, December 1988.

Google Scholar

[9]

J. McCarthy, et al, "LISP 1.5 Programmer's Manual," MIT Press, Cambridge, Mass., 1965.

Digital Library

Google Scholar

[10]

L. Naish, "Negation and Control in Prolog," Doctoral Dissertation, University of Melbourne, 1985.

Google Scholar

[11]

G. Plotkin, "The Category of Complete Partial Orders: a Tool for Making Meanings," Postgraduate lecture notes, Computer Science Dept., Univ. of Edinburgh, Edinburgh, 1982.

Google Scholar

[12]

S.L. Peyton Jones, "The Implementation of Functional Programming Languages," Prentice- Hall, 1987.

Digital Library

Google Scholar

[13]

w. Quine, Methods of Logic, Harvard University Press, Cambridge, 1982.

Google Scholar

[14]

U. Reddy, "Narrowing as the Operational Semantics of Functional Languages," In 1985 Syrup. on Logic Programming, Boston, 1985.

Google Scholar

[15]

J.E. Stoy, "Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory," MiT Press, Cambridge, Mass., 1977.

Digital Library

Google Scholar

[16]

D.A. Schmidt, "Denotational Semantics: A Methodology for Language Development," Allyn and Bacon, inc., Newton, Mass., 1986.

Digital Library

Google Scholar

[17]

D.A. Schmidt, personal communication, April 1989.

Google Scholar

[18]

F. Silbermann, "Semantic Foundations for Lazy Higher-Order Functional cum Logic Pro- ~ramming," Doctoral Dissertation, University of North Carolina, (expected) August 1989.

Google Scholar

[19]

D.A. Turner, "Miranda: A non-strict functional language with polymorphic types," in Conf. on Functional Prog. Langs. and Comp. Arch., Nancy, France, Sep. 1985, pp. 1-16.

Digital Library

Google Scholar

[20]

J. VuiUemin, "Correct and Optimal Implementations of Recursion in a Simple Programruing Language," Journal of Computer and System Sciences 9, 1974, 332-354.

Digital Library

Google Scholar

Cited By

View all

Oberoi SNagaraja G(1993)Compiling relative set abstractionsProceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation10.1109/TENCON.1993.320020(435-438)Online publication date: 1993
https://doi.org/10.1109/TENCON.1993.320020
Paterson R(1992)A Tiny Functional Language with Logical FeaturesDeclarative Programming, Sasbachwalden 199110.1007/978-1-4471-3794-8_5(66-79)Online publication date: 1992
https://doi.org/10.1007/978-1-4471-3794-8_5

Index Terms

Set abstraction in functional and logic programming
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Logic
    1. Constraint and logic programming
  2. Semantics and reasoning
    1. Program semantics
      1. Denotational semantics
      2. Operational semantics

Recommendations

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 ...
Probabilistic and Truth-Functional Many-Valued Logic Programming
ISMVL '99: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic

We 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. ...
The completeness of functional logic
Abstract
A new first-order logic, functional logic, was proposed recently by Staples, Robinson and Hazel. The logic provides a formal means of describing and reasoning about dependence on an implicit parameter, a prime motivation being the unification of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

November 1989

395 pages

ISBN:0897913280

DOI:10.1145/99370

Chairman:
Joseph E. Stoy

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA89

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA89: The International Conference on Functional Programming Languages & Computer Architectures

September 11 - 13, 1989

Imperial College, London, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
330
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)3

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Oberoi SNagaraja G(1993)Compiling relative set abstractionsProceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation10.1109/TENCON.1993.320020(435-438)Online publication date: 1993
https://doi.org/10.1109/TENCON.1993.320020
Paterson R(1992)A Tiny Functional Language with Logical FeaturesDeclarative Programming, Sasbachwalden 199110.1007/978-1-4471-3794-8_5(66-79)Online publication date: 1992
https://doi.org/10.1007/978-1-4471-3794-8_5

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

From answer set logic programming to circumscription via logic of GK

Probabilistic and Truth-Functional Many-Valued Logic Programming

The completeness of functional logic