Type analysis of prolog using type graphs

DOI10.1016/0743-1066(94)00021-WMaRDI QIDQ4327427zbMATH OpenFDO

Authors Pascal Van Hentenryck, Agostino Cortesi, Baudouin Le Charlier

Publication date 6 April 1995

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

Full work available at URL https://doi.org/10.1016/0743-1066(94)00021-W

zbMATH Keywords

compilerstype analysis of prolog

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1948391
• Type inference in Prolog: A new approach
• scientific article; zbMATH DE number 4060764
• A polymorphic type system for Prolog
• Towards Typed Prolog

Cited in

(16)

• Type inference in Prolog: A new approach
• Widening and narrowing operators for abstract interpretation
• Quantitative static analysis of communication protocols using abstract Markov chains
• Compositional analysis for verification of parameterized systems
• Type inference for mobile ambients in Prolog
• scientific article; zbMATH DE number 4092733 (Why is no real title available?)
• scientific article; zbMATH DE number 1322825 (Why is no real title available?)
• scientific article; zbMATH DE number 517008 (Why is no real title available?)
• scientific article; zbMATH DE number 1948391 (Why is no real title available?)
• scientific article; zbMATH DE number 1406237 (Why is no real title available?)
• Extending constructive logic negation with types
• Analysis of the equality relations for the program terms
• The applicability of logic program analysis and transformation to theorem proving
• Improving precision of type analysis using non-discriminative union
• Abstract subtyping for asynchronous multiparty sessions
• Finite-tree analysis for constraint logic-based languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327427)