Cited By
View all- Abreu SDiaz D(2003)Objective: In Minimum ContextLogic Programming10.1007/978-3-540-24599-5_10(128-147)Online publication date: 2003
Optimizing modular logic languages
Pages 10 - es
References
[1]
BossI, A., BUGLIESI, M., GABBRIELLI, M., LEVI, G., AND MEO, M.C. 1993. Differential Logic Programs. In Proc. 20th Annual A CM Symp. on Principles o} Programming Languages (1993), pp. 359-370. ACM Press.
[2]
BROGI, n., LAMMA, E., AND MELLO, P. 1990. Hypothetical Reasoning in Logic Programming: A Semantics Approach. In}ormation Processing Letters 36, 285-291.
[3]
BROGI, n., LAMMA, E., AND MELLO, P. 1992. Compositional Model-theoretic Semantics for Logic Programs. New Generation Computing 11, 1, 1-21.
[4]
BUGLIESI, M. 1992. A Declarative View of Inheritance in Logic Programming. In K. APT Ed., Proc. Joint Int. Con}erence and Symposium on Logic Programming (1992), pp. 113130. The MIT Press.
[5]
BUGLIESI, M., LAMMA, E., AND MELLO, P. 1993. Partial Deduction for Structured Logic Programming. Journal o} Logic Programming 16, 89-122.
[6]
BUGLIESI, M., LAMMA, E., AND MELLO, P. 1994. Modularity in Logic Programming. Jourhal of Logic Programming 19-20, 443-502.
[7]
BUGLIESI, M. AND NARDIELLO, C. 1994. SelfLog: Language and Implementation. In G. SuccI AND E. TICK Eds., Implementations of Logic Programming Systems (1994), pp. 1-15. Kluwer.
[8]
CIAMPOLINI, A., LAMMA, E., AND MELLO, P. 1995. Improving the efficiency of dynamic modular logic languages. Information Processing Letters 58, 163-170.
[9]
CIAMPOLINI, A., LAMMA, E., AND MELLO, P. 1997. An optimized implementation of a dynamic modular logic language. Software, Concepts and Tools 17, 148-162.
[10]
COUSOT, P. AND COUSOT, a. 1992. Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming 13, 103-180.
[11]
GAIFMAN, H. AND SHAPIRO, E. 1989. Fully abstract compositional semantics for logic programs. In Proc. 16th Annual A CM Syrup. on Principles of Programming Languages (1989), pp. 134-142. ACM Press.
[12]
GIORDANO, L., MARTELLI, A., AND RossI, G. 1988. Local definitions with static scope rules in logic languages. In Proc. FGCS'88 Int. Conference (1988), pp. 389-396.
[13]
GIORDANO, L., MARTELLI, A., AND RossI, G. 1994. Structured Prolog: A language for structured logic programming. Software-Concepts and Tools 15, 125-145.
[14]
HODAS, J. 1994. Logic Programming in Intuitionistic Linear Logic. Ph. D. thesis, University of Pennsylvania, Department of Computer and Information Science.
[15]
JAYARAMAN, B. AND NADATHUR, G. 1991. Implementation techniques for scoping constructs in logic programming. In K. FURUKAWA Ed., Proc. 8th Int. Conference on Logic Programming (1991), pp. 871-886. The MIT Press.
[16]
KOMOROWSKI, H.J. 1981. A specification of an abstract Prolog machine and its application to Partial Evaluation. Technical Report Dissertation, Linkoping University.
[17]
LAMMA, E., MELLO, P., AND NATALI, A. 1992. An Extended Warren Abstract Machine for the Execution of Structured Logic Programs. Journal of Logic Programming 14, 187-222.
[18]
LLOYD, J. AND SHEPHERDSON, J. 1991. Partial evaluation in logic programming. Journal of Logic Programming 11, 217-242.
[19]
MANCARELLA, P. AND PEDRESCHI, D. 1988. An algebra of logic programs. In R. A. KOWALSKI AND K. A. BOWEN Eds., Proc. 5th Int. Con}erence on Logic Programming (1988), pp. 1006-1023. The MIT Press.
[20]
MCCABE, F. 1992. Logic and Objects. Prentice Hall International, London.
[21]
MILLER, D. 1989. A logical analysis of modules in logic programming. Journal o} Logic Programming 6, 79-108.
[22]
MONTEIRO, L. AND PORTO, n. 1989. Contextual logic programming. In G. LEvi AND M. MARTELLI Eds., Proc. 6th Int. Con}erence on Logic Programming (1989), pp. 284-302. The MIT Press.
[23]
O'KEEFE, R. 1985. Towards an algebra for constructing logic programs. In J. COHEN AND J. CONERY Eds., Proceedings o} IEEE Symposium on Logic Programming (1985), pp. 152160. IEEE Computer Society Press.
[24]
WARREN, D. 1983. An abstract Prolog instruction set. Technical Report TR 309, SRI International.
Index Terms
- Optimizing modular logic languages
Recommendations
Modular extensions for modular (logic) languages
LOPSTR'11: Proceedings of the 21st international conference on Logic-Based Program Synthesis and TransformationWe address the problem of developing mechanisms for easily implementing modular extensions to modular (logic) languages. By (language) extensions we refer to different groups of syntactic definitions and translation rules that extend a language. Our use ...
Modular logic programming
Modularity is a key issue in the design of modern programming languages. When designing modular features for declarative languages in general, and for logic programming languages in particular, the challenge lies in avoiding the superimposition of a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sept. 1998
141 pages
Copyright © 1998 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]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 September 1998
Published in CSUR Volume 30, Issue 3es
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 420Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)7
Reflects downloads up to 24 Nov 2024
Other Metrics
Citations
Cited By
View all- Abreu SDiaz D(2003)Objective: In Minimum ContextLogic Programming10.1007/978-3-540-24599-5_10(128-147)Online publication date: 2003
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