Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

Details Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

2000-10-20

arxiv.org/abs/cs/0010029v2

Computer Science

Logic in Computer Science

27 pages; Research Report of INRIA Rocquencourt, long version of paper in FSTTCS 2000 conference, New Delhi

Scientific paper

We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of subject reduction expresses the consistency of the type system w.r.t. the execution model: if a program is "well-typed", then all derivations starting in a "well-typed" goal are again "well-typed". It is well-established that without subtyping, this property is readily obtained for logic programs w.r.t. their standard (untyped) execution model. Here we give syntactic conditions that ensure subject reduction also in the presence of general subtyping relations between type constructors. The idea is to consider logic programs with a fixed dataflow, given by modes.

Affiliated with

Also associated with

No associations

Rating

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667082