Data type inference for logic programming

DOI10.1007/978-3-030-98869-2_2MaRDI QIDQ6102248zbMATH OpenOpenAlexFDO

Authors

Publication date 8 May 2023

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.06562

zbMATH Keywords

logic programmingtype inferencetypes

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: In this paper we present a new static data type inference algorithm for logic programming. Without the need of declaring types for predicates, our algorithm is able to automatically assign types to predicates which, in most cases, correspond to the data types processed by their intended meaning. The algorithm is also able to infer types given data type definitions similar to data definitions in Haskell and, in this case, the inferred types are more informative in general. We present the type inference algorithm, prove some properties and finally, we evaluate our approach on example programs that deal with different data structures.

Recommendations

• Type inference in Prolog: A new approach
• A bottom-up polymorphic type inference in logic programming
• Type inference for Datalog with complex type hierarchies
• scientific article; zbMATH DE number 2043546
• A type system for logic programs

Cites work

• A bottom-up polymorphic type inference in logic programming
• A polymorphic type system for Prolog
• A three-valued semantics for typed logic programming
• Efficient run-time type checking of typed logic programs
• From Monomorphic to Polymorphic Well-Typings and Beyond
• Functional Logic Programming: From Theory to Curry
• scientific article; zbMATH DE number 1222409 (Why is no real title available?)
• scientific article; zbMATH DE number 1948391 (Why is no real title available?)
• scientific article; zbMATH DE number 788038 (Why is no real title available?)
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Towards Typed Prolog
• Using parametric set constraints for locating errors in CLP programs

Cited in

(12)

• Inductive data types for predicate transformers
• Type inference in Prolog: A new approach
• ptype: probabilistic type inference
• Minimal type inference for linked data consumers
• A review of type inference methods based on machine learning
• scientific article; zbMATH DE number 4092733 (Why is no real title available?)
• Circumscription in Data Logic for Data Type Specification
• From Logic to Functional Logic Programs
• A type system for interactive JSON schema inference (extended abstract)
• Type inference for Datalog with complex type hierarchies
• Static type inference for the Q language using constraint logic programming
• Typed SLD-resolution: dynamic typing for logic programming

This page was built for publication: Data type inference for logic programming

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