Type analysis of prolog using type graphs

DOI10.1016/0743-1066(94)00021-WzbMath0830.68029MaRDI QIDQ4327427

Baudouin Le Charlier, Agostino Cortesi, Pascal Van Hentenryck

Publication date: 6 April 1995

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

zbMATH Keywords

compilerstype analysis of prolog

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items (8)

Compositional analysis for verification of parameterized systems ⋮ Improving precision of type analysis using non-discriminative union ⋮ Widening and narrowing operators for abstract interpretation ⋮ The applicability of logic program analysis and transformation to theorem proving ⋮ Extending Constructive Logic Negation with Types ⋮ Quantitative static analysis of communication protocols using abstract Markov chains ⋮ Analysis of the equality relations for the program terms ⋮ Finite-tree analysis for constraint logic-based languages

This page was built for publication: Type analysis of prolog using type graphs