A subtyping extension of the type system lambdaP is proved to have decidable type-checking and subtyping problems. Includes full proofs.David Aspinall and Adriana Compagnoni.
This also appears as the technical report ECS-LFCS-97-370 . (The version here may supersede the technical report version).
Click here to return to my papers page.
David R. Aspinall, email david.aspinall@ed.ac.uk.