Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/158511.158689acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
Article
Free access

Differential logic programming

Published: 01 March 1993 Publication History

Abstract

In this paper we define a compositional semantics for a generalized composition operator on logic programs. Static and dynamic inheritance as well as composition by union of clauses can all be obtained by specializing the general operator. The semantics is based on the notion of differential programs, logic programs annotated with declarations that establish the programs' external interfaces.

References

[1]
K. R. Apt and D. Pedreschi. Proving Termination of General Prolog Programs. in T. Ito and A.R. Meyer, editors, Proc. of Int. Conf. on Theoretzcal Aspects of Computer Software, volume 526 of Lecl.ure Notes zn Computer Science, pages 265-289, Sendal, Japan, 1991.]]
[2]
A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. Contributions to the Semantics of Open Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, pages 570-580, 1992.]]
[3]
A. Bossi and M. Menegus. Una Semantica Composizionale per Programmi Logici Aperti. In P. Asirelli, editor, Proc. Sixth Italian Conference on Logic Programming, pages 95-109, 1991.]]
[4]
A. Brogi, E. Lamina, and P. Mello. Structuring Logic Programs: A Unifying Framework and its Declarative and Operational Semantics. Technical Report 4/1, Progetto Finalizzato C.N.R. Sistemi Informatici e Calcolo Parallelo, 1990.]]
[5]
A. Brogi, E. Lamma, and P. Mello. Objects in a Logic Programming Framework. In Second Russian Conference on Logic Programming, 1991.]]
[6]
M. Bugliesi. A Declarative View of Inheritance in Logic Programming. In K. Apt, editor, Proc. Joint Int'l Conf. and Symposium on Logic Programm~ng. The MIT Press, Cambridge, Mass., 1992.]]
[7]
W. Cook and J. Palsberg. A Denotational Semantics of Inheritance and its Correctness. In Proceed~ngs of OOPSLA'89, pages 433-443. ACM, 1989.]]
[8]
F. Denis and J.-P. Delahaye. Unfolding, Procedural and Fixpoint Semantics of Logic Programs. In C. Choffrut and M. Jantzen, editors, STACS 91, volume 480 of Lecture Notes in Computer Science, pages 511-522. Springer-Verlag, Berlin, 1991.]]
[9]
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A new Declarative Semantics for Logic Languages. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fzfth Int'l Conf. on Logic Programmzng, pages 993-1005. The MIT Press, Cambridge, Mass., 1988.]]
[10]
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretzcal Computer Science, 69(3):289-318, 1989.]]
[11]
M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programm~ng~ 18th International Colloquium, volume 510 of Lecture Notes ~n Computer Science, pages 1-19. Springer- Verlag, Berlin, 1991.]]
[12]
H. Gaifman and E. Shapiro. Fully Abstract Compositional Semantics for Logic Programs. In Proc. of A CM Conf. on Principle of Programming Languages, 1989.]]
[13]
L. Giordano and A. Martelli. A Modal Reconstruction of Blocks and Modules in Logic Programming. In V. Saraswat and K. Ueda, editors, Proc. 1991 Int'l Symposium on Logic Programming, pages 239-253, 1991.]]
[14]
L. Giordano, A. Martetli, and F. Rossi. Local definitions with static scope rules in Logic Languages. In Proc. of the FGCS Int. Conf., 1988.]]
[15]
A. Goldberg and D. Robson. Smalltalk-80: The Language and i~s Implemenlalion. Addison- Wesley, 1983.]]
[16]
R. Kowalsky. Logic for Problem S. Elsevier North-Holland, 1979.]]
[17]
J.-L. Lassez and M. J. Maher. Closures and Fairness in the Semantics of Programming Logic. Theoretical Computer Science, 29:167-184, 1984.]]
[18]
G. Levi. Models, Unfolding Rules and Fixpoint Semantics. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Progranruing, pages 1649-1665. The MIT Press, Ca.mbridge, Mass., 1988.]]
[19]
G. Levi and P. Mancarella. The Unfolding Semantics of Logic Programs. Technical Report TR- 13/88, Dipartimento di Informatica, Universit~ di Pisa, 1988.]]
[20]
J. W. Lloyd. Foundations of Logic ProgrammzT~g. Springer-Verlag, Berlin, 1987. Second edition.]]
[21]
J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217-242, 1991.]]
[22]
P. Mancarella and D. Pedreschi. An Algebra of Logic Programs. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 1006-1023. The MIT Press, Cambridge, Mass., 1988.]]
[23]
D. Miller. A Logical Analysis of Modules in Logic Programming. Journal of Logic Programm,ng, 6(2):79-108, 1989.]]
[24]
L. Monteiro and A. Porto. Contextual logic programming. In G. Levi and M. Martelli, editors, Proc. Sixth In~'l Conf. on Logic Programruing, pages 284-302. The MIT Press, Cambridge~ Mass., 1989.]]
[25]
L. Monteiro and A. Porto. A Transformational View of Inheritance in Logic Programming. In Proc. 7th Int. Conf. on Logic Programming, 1990.]]
[26]
L. Monteiro and A. Porto. Syntactic and Semantic Inheritance in Logic Programming. In J. Darlington and R. Dietrich, editors, Proc. PHOENIX Seminar and Workshop on Declarative Programm~ng, 1991.]]
[27]
U. Reddy. Objects as Closures: Abstarct Semantics of Object Oriented Languages. In Proc. of the Inf. Conf. on L~sp and Functional Programming, pages 289-297. ACM, 1988.]]
[28]
D. T. Sannella and L. A. Wallen. A Calculus for the Construction of Modular Polog Programs. Journal of Logic Programming, 6(12):144- 177, 1992.]]
[29]
M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the A CM, 23(4):733-742, 1976.]]
[30]
P. Wegner. Dimensions of Object-Based Language Design. In Proc. of the OOPSLA '87, 1987.]]
[31]
C. Zaniolo. Deductive Databases- Theory meets Practice. In Proc. 2nd In~. Conf. on Ex~ended Database Technology, 1990.]]

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
March 1993
510 pages
ISBN:0897915607
DOI:10.1145/158511
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 March 1993

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

POPL93

Acceptance Rates

POPL '93 Paper Acceptance Rate 39 of 199 submissions, 20%;
Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)26
  • Downloads (Last 6 weeks)4
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media