scientific article; zbMATH DE number 1948391
From MaRDI portal
Publication:4411953
Recommendations
Cited in
(19)- Non-strict independence-based program parallelization using sharing and freeness information
- A bottom-up polymorphic type inference in logic programming
- Type inference in Prolog: A new approach
- Testing your (static analysis) truths
- On types and type consistency in logic programming (Diss., FernUniv. Hagen, 1999)
- A transformational approach to parametric accumulated-cost static profiling
- scientific article; zbMATH DE number 1222409 (Why is no real title available?)
- Type analysis of prolog using type graphs
- Description and optimization of abstract machines in a dialect of Prolog
- Semantic code browsing
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- A three-valued semantics for typed logic programming
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- Optimizing optimal reduction
- scientific article; zbMATH DE number 5198991 (Why is no real title available?)
- Improving precision of type analysis using non-discriminative union
- Data type inference for logic programming
- Abstraction-carrying code: a model for mobile code safety
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411953)