A polymorphic type dependency analysis for logic programs
From MaRDI portal
Publication:1758668
DOI10.1007/s00354-009-0117-5zbMath1251.68065OpenAlexW1986950325MaRDI QIDQ1758668
Publication date: 16 November 2012
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00354-009-0117-5
logic programstype inferenceabstract interpretationnon-deterministic type definitionspolymorphic type dependency
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bottom-up polymorphic type inference in logic programming
- Type dependencies for logic programs using ACI-unification
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- On the interaction between sharing and linearity
- Abstract interpretation and application to logic programs
- Efficient run-time type checking of typed logic programs
- Abstract interpretation based on oldt resolution
- Polymorphic type analysis in logic programs by abstract interpretation
- The s-semantics approach: Theory and applications
- Generalizing Def and Pos to Type Analysis
- Improving precision of type analysis using non-discriminative union
- A type system for logic programs
- Static Analysis
This page was built for publication: A polymorphic type dependency analysis for logic programs