S. Kahrs. Limits of ML-definability. In H. Kuchen and S. D. Swierstra, editors, Proceedings of the 8th Symposium on Programming Language Implementations and Logic Programming, volume 1140 of LNCS, pages 17--31. Springer-Verlag, 1996. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Subject Reduction of Logic Programs as Proof-Theoretic Property - Deransart, Smaus (2002) (Correct)
Non-uniform Recursion: The solution (minimal sorting for fold) - Wehr (2000) (Correct)
Programming in Standard ML '97: A Tutorial Introduction - Gilmore (1997) (2 citations) (Correct)
Reflections on the Design of a Specification Language - Kahrs, Sannella (1998) Self-citation (Kahrs) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC