P. Deransart and J. Maluszynski. Towards soft typing for CLP. In F. Fages, editor, JICSLP'98 Post-Conference Workshop on Types for Constraint Logic Programming. Ecole Normale Superieure, 1998. Available at http://discipl.inria.fr/TCLP98/. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Expressive Type Systems for Logic Programming Languages - Jeffery (2002) (1 citation) (Correct)
.... have been de ned for higher order programming with parametric polymorphism [9, 10, 28, 35, 73] Extending parametric polymorphism with subtyping in the context of logic programming was considered in [23, 65, 89, 94, 95, 110] Soft type systems for logic programming have been investigated in [15]. Recent work on types for logic programming have concentrated on implementation techniques for eciently inferring or checking polymorphic types by integrating polymorphic type checking into an abstract interpretation framework [57] or by applying constraint solving techniques [13] Most ....
Pierre Deransart and Jan Maluszynski. Towards soft typing for CLP. In F. Fages, editor, Proceedings of JICSLP '98 post conference workshop on Types for Constraint Logic Programming, June 1998.
Verifying Termination and Error-Freedom of Logic Programs with.. - Smaus, al. (2001) (2 citations) (Correct)
....; Tn ) where T 1 ; Tn are types. The type of a program P is a set of such atoms, one for each predicate de ned in P . An atom is correctly typed in a position if the term lling this position has the type that is associated with this position. A term t is type consistent with respect to T (Deransart Ma luszy nski, 1998) if there is a substitution such that t : T . A term t occurring in an atom in some position is type consistent if it is type consistent with respect to the type of that position. 2.4 block Declarations A block declaration (SICStus, 1998) for a predicate p=n is a (possibly empty) set of atoms ....
Deransart, P., & Ma luszynski, J. (1998). Towards soft typing for CLP. Fages, Francois (ed), Jicslp'98 post-conference workshop on types for constraint logic programming. Ecole Normale Superieure. Available at http://discipl.inria.fr/TCLP98/.
Subject Reduction of Logic Programs as Proof-Theoretic Propert - Deransart, Smaus (2002) Self-citation (Deransart) (Correct)
No context found.
P. Deransart and J. Maluszynski. Towards soft typing for CLP. In F. Fages, editor, JICSLP'98 Post-Conference Workshop on Types for Constraint Logic Programming. Ecole Normale Superieure, 1998. Available at http://discipl.inria.fr/TCLP98/.
Subject Reduction of Logic Programs as Proof-Theoretic Property - Deransart, Smaus (2002) Self-citation (Deransart) (Correct)
....which our approach seems to be able to justify and even generalise. The approach may help in combining prescriptive and descriptive approaches to typing. The latter are usually based on partial correctness properties. Descriptive type systems satisfy certain type correctness criteria [DM98] but subject reduction is di#cult to consider in such systems. Our approach is a step towards potential combinations of di#erent approaches. We have presented a condition for strong type unifiability which refines the head condition (Thm. 4.13) Several observations arise from this: Def. ....
P. Deransart and J. Ma#luszynski. Towards soft typing for CLP. In F. Fages, editor, JICSLP'98 Post-Conference Workshop on Types for Constraint Logic Programming. Ecole Normale Superieure, 1998. Available at http://discipl.inria.fr/TCLP98/.
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