@inproceedings{809529692f834c618c58c86799160660,
title = "Using modes to ensure subject reduction for typed logic programs with subtyping",
abstract = "We consider a general prescriptive type system with parametricp olymorphism 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 logicp rograms 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.",
author = "Smaus, \{Jan Georg\} and Fran{\c c}ois Fages and Pierre Deransart",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 20th Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000 ; Conference date: 13-12-2000 Through 15-12-2000",
year = "2000",
month = jan,
day = "1",
doi = "10.1007/3-540-44450-5\_17",
language = "English",
isbn = "3540414134",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "214--226",
editor = "Sanjiv Kapoor and Sanjiva Prasad",
booktitle = "FST TCS 2000",
}