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

Authors:
Jan-Georg Smaus;François Fages;Pierre Deransart
Affiliations:
-;-;-
Venue:
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2000

Citing 7
Cited 1

A polymorphic type system for PROLOG.

Artificial Intelligence
Type theory and functional programming

Type theory and functional programming
Types in logic programming

Types in logic programming
The Go¨del programming language

The Go¨del programming language
From logic programming to Prolog

From logic programming to Prolog
A Polymorphic Type System with Subtypes for Prolog

ESOP '88 Proceedings of the 2nd European Symposium on Programming
On the Unification Free Prolog Programs

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science

A type system for CHR

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.