Denotational abstract interpretation of functional logic programs

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

Volumn 1302 LNCS, Issue , 1997, Pages 141-156

  Zartmann, Frank ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; LOGIC PROGRAMMING; MODEL CHECKING; SEMANTICS; STATIC ANALYSIS;

ABSTRACT INTERPRETATIONS; CONTROL INFORMATION; DENOTATIONAL SEMANTICS; FUNCTIONAL LANGUAGES; FUNCTIONAL LOGIC LANGUAGES; FUNCTIONAL LOGIC PROGRAMS; MODEL-THEORETIC SEMANTICS; RESOLUTION PRINCIPLE;

COMPUTER CIRCUITS;

EID: 85028657252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032739     Document Type: Conference Paper

References (15)

1. S. Antoy. Definitional trees. In ALP, volume 632 of LNCS, pages 143-157. Springer, 1992.
2. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Symposium on Principles of Programming Languages (POPL’94), volume 21, pages 268-279. ACM, 1994.
3. G.L. Burn. Evaluation transformer- a model for the parallel evaluation of functional languages (extended abstract). In Proc. of the 3th Conference on Functional Languages and Computer Architecture, volume 274 of LNCS, pages 446-470. Springer, 1987.
4. G.L. Bum. Lazy Functional Languges: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing. MIT Press, 1991.
5. P. Cousot and R. Cousot. A unified lattice model for static analysis of programs by construction of approximation of fixpoints. In Proc. of the 4th ACM Symposium on Principles of Programming Languages (POPL), pages 238-252, 1977.
6. N. Dershowitz and J. Jouannaud. Rewrite systems. In J. Van Leeuwen, editor, Handbook of theoretical Computer Science, volume B, chapter 6, pages 243-320. Elsevier, 1990.
7. W. Hans, J. Marino-Carballo, J. J. Moreno-Navarro, H. Kuchen, and S. Winkler. Efficient lazy narrowing using demandedness analysis. In PLILP, volume 714 of LNCS, pages 167-183. Springer, 1993.
8. M. Hanus. The integration of functions into logic programming: Prom theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
9. M. Hanus. A unified computation model for functional logic programming. In Symposium on Principles of Programming Languages (POPL’97), volume 24, pages 80-93. ACM, 1997.
10. M. Hanus and S. Lucas. Definition and analysis of a denotational semantics for needed narrowing. Technical Report DSIC II/2/96, Universidad Politecnia de Valencia, 1996.
11. M. Kurihara and A. Ohuchi. Modularity in noncopying term rewriting. Theoretical Computer Science, 152:139-69, 1995.
12. K. Marriott, H. Sondergaard, and N. D. Jones. Denotational abstract interpretation of logic programs. ACM Transactions on Programming Languages, 16(3):607-648, May 1994.
13. A. Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Proc. of the 4th International Symposium on Programming Languages, volume 83 of LNCS, pages 269-281. Springer, 1980.
14. C. Palamidessi. Algebraic properties of idempotent substitutions. In M.S. Pater-son, editor, Proc. of 17th Int’l Colloquium on Automata, Languages and Programming, volume 443 of LNCS, pages 386-399. Springer, 1990.
15. R. Sekar and I. V. Ramakrishnan. Fast strictness analysis based on demand propagation. ACM Transactions on Programming Languages and Systems, 17(6):896-937, 1995.