Run time type information in mercury

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

Volumn 1702, Issue , 1999, Pages 224-243

  Dowd, Tyson ^a   Somogyi, Zoltan ^a   Henderson, Fergus ^a   Conway, Thomas ^a   Jeffery, David ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

AUTOMATICALLY GENERATED; ESCAPE MECHANISM; GARBAGE COLLECTORS; INPUT AND OUTPUTS; MEASUREMENTS OF; MERCURY SYSTEM; STATIC TYPE CHECKING; STATIC TYPE SYSTEMS;

PROGRAM DEBUGGING;

EID: 84979020593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704567_14     Document Type: Conference Paper

References (14)

1. M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a stati-cally typed language. ACM Transactions on Programming Languages and Systems, 13(2): 237-268, April 1991. 234.
2. Shail Aditya and Alejandro Caro. Compiler-directed type reconstruction for poly-morphic languages. In Proceedings of the 1993 ACM Conference on Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, June 1993. 241.
3. Shail Aditya, Christine Flood, and James Hicks. Garbage collection for strongly-typed languages using run-time type reconstruction. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pages 12-23, June 1994. 241, 241.
4. C. Beierle, G. Meyer, and H. Semle. Extending the warren abstract machine to polymorphic order-sorted resolution. In Proceedings of the International Logic Programming Symposium, pages 272-286, 1991. 241.
5. Hans Boehm and Mark Weiser. Garbage collection in an uncooperative environ-ment. Software-Practice and Experience, 18: 807-820, 1988. 225.
6. Bart Demoen, Maria Garcia de la Banda, Warwick Harvey, Kim Marriott, and Peter Stuckey. Herbrand constraint solving in HAL. Technical Report 99/18, De-partment of Software Engineering and Computer Science, University of Melbourne, Melbourne, Australia, 1998. 239.
7. Martin Elsman. Polymorphic equality-no tags required. In Second International Workshop on Types in Compilation, volume 1473 of Lecture Notes in Computer Science. Springer Verlag, 1998. 241.
8. Benjamin Goldberg. Tag-free garbage collection for strongly typed programming languages. In Proceedings of the SIGPLAN '91 Conference on Programming Lan-guages Design and Implementation, pages 165-176, Toronto, Ontario, June 1991. 240, 240.
9. D. R. Hanson and M. Raghavachari. A machine-independent debugger. Software-Practice and Experience, 26: 1277-1299, 1996. 240.
10. Fergus Henderson, Thomas Conway, Zoltan Somogyi, and David Jeffery. The Mer-cury language reference manual. Technical Report 96/10, Department of Computer Science, University of Melbourne, Melbourne, Australia, 1996. 226.
11. K. Kwon, G. Nadathur, and D. S. Wilson. Implementing polymorphic typing in a logic programming language. In Computer Languages, volume 20(1), pages 25-42, 1994. 241.
12. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 26(1-3): 17-64, October-December 1996. 238.
13. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: A type-directed optimizing compiler for ML. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implemantation, pages 181-192, New York, May 21-24 1996. 241.
14. Andrew Tolmach. Tag-free garbage collection using explicit type parameters. In Proceedings of the SIGPLAN '94 Conference on Programming Languages Design and Implementation, pages 1-11, Orlando, Florida, June 1994. 241.