|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
M. Bruynooghe. Adding redundancy to obtain more l eliable and more readable Prolog programs. In Proceed~ngs of the first Internatzonal Logzc Programming Conference, pages 129-133, Marseille, France, 1982.
|
| |
3
|
|
| |
4
|
M. Bruynooghe, G. Janssens, A. Callebaut, alld }3. Dcmoen. Abstract interpretation: towaMs the glol)al oplimisation of Prolog programs. In Pro( ecd, tTgs of the l :)87 Symposium on Logic Programt,t~tg, pages 192-204. Tl,e IEEE Society Press, 1987.
|
 |
5
|
|
| |
6
|
M. Codish, D. Dams, and Yardeni E. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In K. Furukawa, editor, Proceedings of the Eighth International Confere.nce on Logic Programming, pages 79-93, Paris, France, 1991. The MIT Press.
|
| |
7
|
|
| |
8
|
M. Codish , A. Mulkers , M. Bruynooghe , M. García de la Banda , M. Hermenegildo, Improving abstract interpretations by combining domains, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.194-205, June 14-16, 1993, Copenhagen, Denmark
[doi> 10.1145/154630.154650]
|
| |
9
|
|
| |
10
|
P.W. Dart and J. Zobel. A regular type language for logic programs. In Frank Pfel~ning, editor, Types in Log'~c Programming. MIT Press, Cambridge,Massachusetts, 1992. ISBN 0-262-16131-1.
|
| |
11
|
T.W. Friiehwirth. Using meta-interpreters for polymorphic type checking. In M. Bruynooghe, editor, Proceed- ,rigs of the Second Workshop on Meta-programmin9 ~n Logic, pages 339-351, Leaven, Belgium, April ,t-6 1990.
|
| |
12
|
|
| |
13
|
N. Heintze and J. Jaffar. Semantic t yl)es tot logic programs. In Frank Pfenning, editor, Types ,n Logic Programming. MIT Press, Cambridge,Massachusetts. 1992. ISBN 0-262-16131-1.
|
| |
14
|
|
| |
15
|
|
| |
16
|
|
| |
17
|
N.D. Jones and tt. S0ndergarrd. A semantics-based fia~nework for abstract interpretation of Prolog. In S. Abramsky a~td C. tIankin, editors, Abstract interpretatzon of declarative languages, pages 123-142. Ellis Horwood Limited, 1987.
|
| |
18
|
|
| |
19
|
T. Kanamori aim K. Horiuchi. Type inference in Prolog and its application. In Proceedings of the ninth International Joint Conference on Artificial Intelligence, pages 70,1-707, 1985.
|
| |
20
|
|
| |
21
|
|
| |
22
|
L. Lu. Abstract interpretation, bug detection and bug diagnosis in normal logic programs. PhD thesis, University of Birlningham, 1994.
|
| |
23
|
|
| |
24
|
C. ~Icllish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract interpretat~on of declarative languages, pages 181-198. Ellis Ilorwood Li~nited, 1987.
|
| |
25
|
P. Mish~a. Towards a theory of types in Prolog. In Proceedi~,gs of the IEEE international Symposium on Logtc Programming, pages 289-298. IEEE, 1984.
|
| |
26
|
|
| |
27
|
|
| |
28
|
|
| |
29
|
T. Sato and H. Tamaki. Enumeration of success patterns in logic programs. Theoretical Computer Science, 34(1)'227-240, 1984.
|
| |
30
|
|
| |
31
|
|
| |
32
|
J. Xu and D.S. Warren. A type inferellce systcln foi Prolog. In R.A. Kowalski altd K.A. Bowea, editors, Proceedings of the fifth Inter~zat,ol~al Co,ference cttzd Symposium on Logic Programmzng, pages 604-619. Tile MIT Press, 1988.
|
| |
33
|
|
| |
34
|
J. Zobel. Derivation of polymorphic types for Prolog programs. In J.-L. Lassez, editor, Logic Programruing: Proceedings of the fourth inte.rnatzo~al conference, pages 817-838, Australia, 1987.
|
CITED BY 4
|
|
|
|
|
|
|
|
Pawel S. Pietrzak , Jesús Correas Fernández , Germán Puebla , Manuel V. Hermenegildo, A practical type analysis for verification of modular prolog programs, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 07-08, 2008, San Francisco, California, USA
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.3