J.-G. Smaus, F. Fages, and P. Deransart. Using modes to ensure subject reduction for typed logic programs with subtyping. In S. Kapoor and S. Prasad, editors, Proceedings of the 20th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1974 of LNCS, pages 214-226. Springer-Verlag, 2000. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Expressive Type Systems for Logic Programming Languages - Jeffery (2002) (1 citation) (Correct)
Subject Reduction of Logic Programs as Proof-Theoretic Propert - Deransart, Smaus (2002) Self-citation (Smaus Deransart) (Correct)
Subject Reduction of Logic Programs as Proof-Theoretic Property - Deransart, Smaus (2002) Self-citation (Smaus Deransart) (Correct)
Using Modes to Ensure Subject Reduction for Typed Logic.. - Smaus, Fages, Deransart (2000) (1 citation) Self-citation (Smaus Fages Deransart) (Correct)
Typed Constraint Logic Programs: checking domain coercions.. - Coquery, Fages Self-citation (Fages) (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