From Logic to Functional Logic Programs

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