Directional types and the annotation method

Journal of Logic Programming

Volumn 33, Issue 3, 1997, Pages 179-220

  Boye, Johan ^a   Małuszyński, Jan ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; ERROR CORRECTION; PROGRAM DEBUGGING; PROGRAMMING THEORY; PROLOG (PROGRAMMING LANGUAGE);

ANNOTATION METHOD;

LOGIC PROGRAMMING;

EID: 0031539255     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00144-6     Document Type: Article

References (44)

1. Aiken, A. and Lakshman, T. K., Directional Type Checking of Logic Programs in: Le Charlier (ed.), Static Analysis - Proceedings of the First International Static Analysis Symposium (SAS'94), LNCS 864, Springer-Verlag, 1994, pp. 43-60.
2. Aït-Kaci, H. and Podelski, A., Towards a Meaning of LIFE, Journal of Logic Programming 16:195-234 (1993).
3. Aït-Kaci, H., Lincoln, P., and Nasr, R., LeFun: Logic, Equations and FUNctions, in: Proceedings of the 4th IEEE International Symposium on Logic Programming, San Francisco, IEEE Computer Society Press, 1987, pp. 17-23.
4. Apt, K. (ed.), Logic Programming - Proceedings of the Joint International Symposium and Conference, Washington, DC, MIT Press, 1992.
5. Apt, K., Declarative Programming in Prolog, in: Proceedings of the International Symposium on Logic Programming, Vancouver (Canada), MIT Press, 1993, pp. 12-35.
6. Apt, K. and Etalle, S., On the Unification-Free Prolog Programs, in: Proceedings of the Conference on Mathematical Foundations of Computer Science, Berlin, Springer-Verlag, 1993, pp. 1-19.
7. Apt, K. and Marchiori, E., Reasoning about Prolog Programs: From Modes through Types to Assertions, Formal Aspects of Computing 3:743-765 (1994).
8. Apt, K. and Pellegrini, A., Why the Occur-Check Is Not a Problem, in: Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, Leuven (Belgium), LNCS 631, Springer-Verlag, 1992, pp. 69-86.
9. Bossi, A. and Cocco, N., Verifying Correctness of Logic Programs, in: Proceedings of TAP-SOFT'89, LNCS 352, Springer-Verlag, 1989, pp. 96-110.
10. Boye, J., S-SLD-Resolution - An Operational Semantics for Logic Programs with External Procedures, in: [32], pp. 383-393.
11. Boye, J., Avoiding Dynamic Delays in Functional Logic Programs, in: Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming, LNCS 714, Springer-Verlag, 1993, pp. 12-27.
12. Boye, J., Directional Types in Logic Programming, Ph.D. Thesis No. 437, Linköping Studies in Science and Technology, 1996.
13. Boye, J. and Małuszyński, J., Two Aspects of Directional Types, in: L. Sterling (ed.), Logic Programming - Proceedings of the 12th International Conference, MIT Press, 1995, pp. 747-761.
14. Bronsard, F., Lakshman, T. K., and Reddy, U., A Framework of Directionality for Proving Termination of Logic Programs, in: [4], pp. 321-335.
15. Carlsson, M., Widén, J., Andersson, J., Andersson, S., Boortz, K., and Sjöland, T., SICStus Prolog User's Manual, SICS, Box 1263, S-164 28 Kista, Sweden.
16. Clark, K., Predicate Logic as a Computational Formalism, Technical Report 79/59, Imperial College, London, 1979.
17. Colussi, L. and Marchiori, E., Proving Correctness of Logic Programs Using Axiomatic Semantics, in: K. Furokawa (ed.), Logic Programming - Proceedings of the 8th International Conference, MIT Press, 1991, pp. 629-642.
18. Courcelle, D. and Deransart, P., Proofs of Partial Correctness for Attribute Grammars with Application to Recursive Procedures and Logic Programming, Information and Computation 2 (1988).
19. Dembiński, P. and Małuszyński, J., AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs, in: Proceedings of the 1985 IEEE Symposium on Logic Programming, Boston, IEEE Computer Society Press, 1985, pp. 29-38.
20. Deransart, P., Logical Attribute Grammars, in: Proceedings of IFIP 83, North-Holland, 1983, pp. 463-469.
21. Deransart, P., Proof Methods of Declarative Properties of Definite Programs, Theoretical Computer Science 118:99-166 (1993).
22. Deransart, P., Jourdan, M., and Lorho, B., Attribute Grammars Definitions, Systems and Bibliography, LNCS 323, Springer-Verlag, 1988.
23. Deransart, P. and Małuszyński, J., A Grammatical View on Logic Programming, MIT Press, 1993.
24. Dijkstra, E., A Discipline of Programming, Englewood Cliffs, NJ, Prentice-Hall, 1976.
25. Drabent, W., On Completeness of the Inductive Assertion Method for Logic Programs, Unpublished note, 1988. Can be obtained from wdr@ida.liu.se.
26. Drabent, W. and Małuszyński, J., Induction Assertion Method for Logic Programs, Theoretical Computer Science 59:133-155 (1988).
27. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C., Declarative Modelling of the Operational Behaviour of Logic Languages, Theoretical Computer Science 69(3):289-318 (1989).
28. Jazayeri, M., Ogden, W., and Rounds, W., The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars, Journal of the ACM 18:679-706 (1975).
29. Knuth, D., Semantics of Context-Free Languages, Mathematical Systems Theory 2:127-145 (1968). Correction in ibid. 5:95-96 (1971).
30. Lloyd, J. W., Foundations of Logic Programming, 2nd ed., Springer Verlag, Berlin, 1987.
31. Małuszyński, J., Bonnier, S., Boye, J., Kågedal, A., Kluźniak, F., and Nilsson, U., Logic Programs with External Procedures, in: Logic Programming Languages, Constraints, Functions, and Objects, MIT Press, 1993, pp. 21-48.
32. Małuszyński, J. and Wirsing, M. (eds.), Programming Language Implementation and Logic Programming - Proceedings of the 3rd International Symposium, Passau (Germany), LNCS 528, Springer-Verlag, 1991.
33. Naish, L., Adding Equations to NU-Prolog, in: [32], pp. 15-26.
34. Naish, L., Coroutining and the Construction of Terminating Logic Programs, Report 92/5, Department of Computer Science, University of Melbourne, 1992.
35. Naish, L., A Declarative View of Modes, Report 96/7, Department of Computer Science, University of Melbourne, 1996.
36. Nixon, L., A Directional Type Checker for Prolog, Master's Thesis LiTH-IDA-Ex-9602, Linköping University, 1996.
37. Paakki, J., Multi-Pass Execution of Functional Logic Programs, in: Conference Record of the 21st ACM Symposium on Principles of Programming Languages (POPL), Portland, ACM Press, 1994, pp. 361-374.
38. Plümer, L., Termination Proofs for Logic Programs, LNAI 446, Springer Verlag, Berlin, 1990.
39. Reddy, U. S., A Typed Foundation for Directional Logic Programming, in: E. Lamma and P. Mello (eds.), Extensions of Logic Programming, LNAI 660, Springer Verlag, Berlin, 1992, pp. 282-318.
40. Rouzaud, Y. and Nguyen-Phoung, L., Integrating Modes and Types into a Prolog Type Checker, in: [4], pp. 85-97.
41. Saraswat, V. A., Concurrent Constraint Programming Languages, MIT Press, 1990.
42. Somogyi, Z., Henderson, F., and Conway, T., The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language, Journal of Logic Programming 29:17-64 (1996).
43. Sterling, L. and Shapiro, E., The Art of Prolog, MIT Press, 1986.
44. Vétillard, E., Utilisation de Déclarations en Programmation Logique avec Contraintes, Ph.D. Thesis, Universite D'Aix-Marseille II, Faculte de Sciences de Luminy, 1994.