Data Type Inference for Logic Programming

Barbosa, João; Florido, Mário; Costa, Vítor Santos

doi:10.1007/978-3-030-98869-2_2

Cited by 4 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although this works fine for smaller programs, it could be improved by using type information. For instance, CIAO-Prolog (Hermenegildo et al 2012) supports the definition of regular and Hindley-Milner types, which could be translated into algebraic data types, or Barbosa et al (2021) describe a tool to infer similar types from logic programs. Although there is some interest toward adding types to Prolog programs (Schrijvers et al 2008), there is no general agreement about its syntax and structure.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

From Logic to Functional Logic Programs

Hanus¹

2022

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework. Since amalgamated functional logic languages offer flexible as well as efficient evaluation strategies, we propose an opposite approach in this paper. By mapping logic programs into functional logic programs with a transformation based on inferring functional dependencies, we develop a fully automatic transformation which keeps the flexibility of logic programming but can improve computations by reducing infinite search spaces to finite ones.

show abstract

Section: Methodsmentioning

confidence: 99%

“…2012) supports the definition of regular and Hindley-Milner types, which could be translated into algebraic data types, or Barbosa et al . (2021) describe a tool to infer similar types from logic programs. Although there is some interest toward adding types to Prolog programs (Schrijvers et al .…”

Section: Methodsmentioning

confidence: 99%

From Logic to Functional Logic Programs

Hanus¹

2022

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…The SSA form is easier to use than the pre‐ and post‐condition style of process specification, but they are semantically equivalent. The data type of the result tempt _ i of each expression can be obtained through type inference [47].…”

Section: Automatic Code Generationmentioning

confidence: 99%

Requirements‐related fault prevention during the transformation from formal specifications to programs

Liu

2023

IET Software

View full text Add to dashboard Cite

Software faults are costly to find and remove from programs. It is better to avoid inserting the faults in the first place. The authors identify requirements‐related faults that can arise during the transformation of formal specifications into programs, analyse each to discover its causes, and propose corresponding fault prevention methods. The approach works by analysing a specification, decomposing it into specification fragments with different levels like components, determining the correct implementation order among the components, and enabling automated code generation for the components and other low‐level specification fragments. The approach seeks to reduce the faults in programs significantly by guiding programmers to work effectively and productively. The authors evaluate the approach's performance experimentally and compare it to the performance of a fault‐prevention method with industry applications.

show abstract

Typed SLD-Resolution: Dynamic Typing for Logic Programming

Barbosa

Florido²,

Costa³

2022

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

The semantic foundations for logic programming are usually separated into two different approaches. The operational semantics, which uses SLD-resolution, the proof method that computes answers in logic programming, and the declarative semantics, which sees logic programs as formulas and its semantics as models. Here, we define a new operational semantics called TSLD-resolution, which stands for Typed SLD-resolution, where we include a value "wrong", that corresponds to the detection of a type error at run-time. For this we define a new typed unification algorithm. Finally we prove the correctness of TSLD-resolution with respect to a typed declarative semantics.

show abstract

Data Type Inference for Logic Programming

Cited by 4 publications

References 18 publications

From Logic to Functional Logic Programs

From Logic to Functional Logic Programs

Requirements‐related fault prevention during the transformation from formal specifications to programs

Typed SLD-Resolution: Dynamic Typing for Logic Programming

Contact Info

Product

Resources

About