Efficient run-time type checking of typed logic programs

DOI10.1016/0743-1066(92)90046-6zbMath0754.68027OpenAlexW1976733411MaRDI QIDQ4015951

Philip W. Dart, Justin Zobel

Publication date: 10 November 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(92)90046-6

zbMATH Keywords

type inferenceregular typessemantics of typescomparison of regular typesemptiness of regular typesintersection of regular typesparametric type rulestype check eliminationtype dependenciesunification of type terms

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (9)

Computing Abstract Distances in Logic Programs ⋮ Data type inference for logic programming ⋮ Typed SLD-resolution: dynamic typing for logic programming ⋮ Unnamed Item ⋮ Abstraction-carrying code: a model for mobile code safety ⋮ Checking Emptiness of Non-Deterministic Regular Types with Set Operators ⋮ A polymorphic type dependency analysis for logic programs ⋮ Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses ⋮ Improving precision of type analysis using non-discriminative union

This page was built for publication: Efficient run-time type checking of typed logic programs