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
Summary Related Articles Check |
This paper is cited in the following contexts:
Expressive Type Systems for Logic Programming Languages - Jeffery (2002) (1 citation) (Correct)
....[50] was also used to prove soundness of the Mycroft O Keefe type system. Several type systems 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 ....
Jan-Georg Smaus, Francois Fages, and Pierre Deransart. Using modes to ensure subject reduction for typed logic programs with subtyping. In S. Kapoor and S. Prasad, editors, Proceedings of FST and TCS '00, pages 214-226. Springer-Verlag, December 2000.
Subject Reduction of Logic Programs as Proof-Theoretic Propert - Deransart, Smaus (2002) Self-citation (Smaus Deransart) (Correct)
No context found.
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.
Subject Reduction of Logic Programs as Proof-Theoretic Property - Deransart, Smaus (2002) Self-citation (Smaus Deransart) (Correct)
....contains at least an NSTO condition, one could also benefit from the refinements proposed for the NSTO check [DM93] Such further refined conditions should, in particular, be fulfilled by all solutions of Ex. 4.9. We have also studied operational subject reduction for type systems with subtyping [SFD00]. As future work, we want to integrate that work with the proof theoretic view of subject reduction of this article. Also, we want to design more refined tests for strong type unifiability, and we want to study the relationship between the head condition and polymorphic recursion. ....
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
Using Modes to Ensure Subject Reduction for Typed Logic.. - Smaus, Fages, Deransart (2000) (1 citation) Self-citation (Smaus Fages Deransart) (Correct)
....of general subtyping relations between type constructors. The idea is to consider logic programs with a xed data ow, given by modes. Key words: typed logic programs, modes, type systems, subtyping, subject reduction This paper is the complete version of a paper presented at FST TCS 2000 [18]. It contains all proofs omitted there for space reasons. jan.smaus cwi.nl, CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands. y francois.fages inria.fr z pierre.deransart inria.fr Utilisation des modes pour garantir la proprit de subject reduction pour les programmes logiques ....
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, LNCS. Springer-Verlag, 2000. To appear.
Typed Constraint Logic Programs: checking domain coercions.. - Coquery, Fages Self-citation (Fages) (Correct)
....in a typed program, where the syntactical details are insigni cant for our results. 1 The assumption made here, that the arities of the type constructors decrease when we move up in the subtype hierarchy, is mandatory for the subject reduction theorem for moded logic programs presented in [17], but not for the subject reduction presented here for constraint logic programs. That assumption can be replaced by a condition stating that if K K 0 K 00 then the parameters mapped between K and K 00 are mapped consistently in K 0 [15] This more general form is supported by the ....
.... . It is well known however that the diagram of both reductions commutes: 6 Q 1 # # CSLD CSLD Q n # Q 2 # # . # Q CSLD CSLD . CSLD . The subject reduction property above thus expresses the consistency of types w.r.t. horizontal reduction steps. In [17] the result is generalized to both reductions in the context of moded logic programs. It is worth noting also that theorem 1 would not hold without the de nitional genericity condition (expressed in rule Head) For example with two constants a : a and b : b , and one predicate p : bool de ....
[Article contains additional citation context not shown here]
Jan-Georg Smaus, Francois Fages, and Pierre Deransart. Using modes to ensure subject reduction for typed logic programs with subtyping. In Proceedings of FSTTCS '2000, number 1974 in LNCS. Springer-Verlag, 2000.
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