Improving precision of type analysis using non-discriminative union
From MaRDI portal
Publication:5437649
Recommendations
Cites work
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- A bottom-up polymorphic type inference in logic programming
- A polymorphic type system for Prolog
- A practical framework for theabstract interpretation of logic programs
- A type system for logic programs
- Abstract interpretation and application to logic programs
- Abstract interpretation based on oldt resolution
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Efficient run-time type checking of typed logic programs
- Generalizing Def and Pos to Type Analysis
- Path dependent analysis of logic programs
- Polymorphic type analysis in logic programs by abstract interpretation
- Properties of substitutions and unifications
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Type analysis of prolog using type graphs
- Type dependencies for logic programs using ACI-unification
- Typing constraint logic programs
Cited in
(4)
This page was built for publication: Improving precision of type analysis using non-discriminative union
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437649)