Results 1 to 10 of about 1,138,309 (354)
From Logic to Functional Logic Programs [PDF]
arXiv, 2022 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.
M. Hanus
arxiv +5 more sources
A Proof Theoretic Approach to Failure in Functional Logic Programming [PDF]
Theory and Practice of Logic Programming, vol. 4, no. 1&2, 2004, 2004 How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical framework for functional logic programming, whose ...
Francisco J. López-Fraguas +1 more
arxiv +5 more sources
Evaluation Strategies for Functional Logic Programming
Journal of Symbolic Computation, 2001 AbstractRecent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. Narrowing is a computation similar to rewriting which yields substitutions in addition to normal forms.
Sergio Antoy
semanticscholar +4 more sources
The (Lazy) Functional Side of Logic Programming [PDF]
arXiv, 2000 The possibility of translating logic programs into functional ones has long been a subject of investigation. Common to the many approaches is that the original logic program, in order to be translated, needs to be well-moded and this has led to the common understanding that these programs can be considered to be the ``functional part'' of logic ...
Sandro Etalle, Jon Mountjoy
arxiv +6 more sources
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science, 2005 AbstractIn this paper we propose a new generic scheme CFLP(D), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. As in the case of the well known CLP(D) scheme for Constraint Logic Programming, D is assumed to provide domain specific data values and constraints.
Francisco J. López-Fraguas +2 more
semanticscholar +4 more sources
Functional logic programming [PDF]
Communications of the ACM, 2010 Combining the paradigm features of both logic and functional programming makes for some powerful implementations.
Sergio Antoy, Michael Hanus
openaire +3 more sources
Proceedings 29th and 30th Workshops on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming [PDF]
EPTCS 234, 2017, 2016 The Workshops on (Constraint) Logic Programming (WLP) are the annual meeting of the German Society of Logic Programming (Gesellschaft f\"ur Logische Programmierung e.V., GLP) and bring together researchers interested in logic programming, constraint programming, answer set programming, and related areas like databases and artificial intelligence (not ...
Sibylle Schwarz, Janis Voigtländer
arxiv +3 more sources
Functional Reading of Logic Programs [PDF]
, 2000 JUCS - Journal of Universal Computer Science Volume Nr.
Silvija Seres, Michael Z. Spivey
openalex +4 more sources
Correction of Functional Logic Programs [PDF]
, 2003 We propose a new methodology for synthesizing correct functional logic programs. We aim to create an integrated development environment in which it is possible to debug a program and correct it automatically. We start from a declarative diagnoser that we have developed previously which allows us to identify wrong program rules w.r.t.
Marı́a Alpuente +3 more
openalex +3 more sources
Set functions for functional logic programming [PDF]
Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, 2009 We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the results of a corresponding ordinary operation. A characteristic feature of our approach is the complete separation between a usually-non-deterministic operation and its possibly ...
Michael Hanus, Sergio Antoy
openaire +3 more sources