Selected papers that cite this one
- Krzysztof R. Apt and Dino Pedreschi. Reasoning about termination of pure prolog programs. Information and Computation, 106(1):109-157, September 1993.
- Masami Hagiya. A typed lambda-calculus for proving-by-example and bottom-up generalization procedure. Theoretical Computer Science, 137(1):3-23, 9 January 1995.
- Hongwei Xi and Frank Pfenning. Eliminating array bound checking through dependent types. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation (PLDI), pages 249-257, Montreal, Canada, 17-19 June 1998. SIGPLAN Notices 33(5), May 1998.