A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Strong Complete Schema for Inductive Functional Logic Programming
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A new IFLP schema is presented as a general framework for the induction of functional logic programs (FLP). ...
We outline some possible restrictions in order to improve the tractability of the schema. We also show that inverse narrowing is just a special case of our IFLP schema. ...
It is logical then to base the induction of functional logic programs on an inversion of these deductive operators. ...
doi:10.1007/3-540-48751-4_12
fatcat:sgm6yfwfive4jcw6ngv42fxzf4
Incremental Learning of Functional Logic Programs
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we consider the extension of the Inductive Functional Logic Programming (IFLP) framework in order to learn functions in an incremental way. ...
We have performed this extension in the FLIP system, an implementation of the IFLP framework. Several examples of programs which have been induced indicate that our extension pays off in practice. ...
In this paper we present an incremental algorithm for the induction of functional logic programs. ...
doi:10.1007/3-540-44716-4_15
fatcat:6d5dorwvynavlerrff3yhin6t4
Correction of Functional Logic Programs
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), approach for the automatic correction of functional logic programs which is driven by a set of evidence examples ...
We propose a new methodology for synthesizing correct functional logic programs. ...
Now, applying generalization and inverse narrowing operators, starting from the positive examples, we try to reconstruct the missing part of the code, that is, we synthesize a functional logic program ...
doi:10.1007/3-540-36575-3_5
fatcat:ek3tubfmszf7dpvlhjbd4om4hm
Specialization of inductively sequential functional logic programs
1999
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming - ICFP '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we define a partial evaluator for inductively sequential functional logic programs. ...
Inductively sequential programs admit the definition of optimal computation strategies and are the basis of several recent (lazy) functional logic languages. ...
Acknowledgements We wish to thank Elvira Albert and Santiago Escobar for many helpful remarks and for their valuable contribution to the implementation and testing work. ...
doi:10.1145/317636.317910
dblp:conf/icfp/AlpuenteHLV99
fatcat:ms64h4f6cjhp7me4a2vzrwd4hu
Specialization of inductively sequential functional logic programs
1999
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we define a partial evaluator for inductively sequential functional logic programs. ...
Inductively sequential programs admit the definition of optimal computation strategies and are the basis of several recent (lazy) functional logic languages. ...
Acknowledgements We wish to thank Elvira Albert and Santiago Escobar for many helpful remarks and for their valuable contribution to the implementation and testing work. ...
doi:10.1145/317765.317910
fatcat:4wudshh6off27d2wugucpnj37m
Evaluation strategies for functional logic programming
2005
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In functional logic programming, the classes of rewrite systems to which narrowing is applied are, for the most part, subclasses of the constructor-based, possibly conditional, rewrite systems. ...
Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. ...
Acknowledgements I would like to thank Bernhard Gramlich and Salvador Lucas Alba for inviting me to write a preliminary version of this paper for the International Workshop on Reduction Strategies in Rewriting ...
doi:10.1016/j.jsc.2004.12.007
fatcat:swjeqk5wgfaf3nai5v5ufuws7q
Evaluation Strategies for Functional Logic Programming
2001
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In functional logic programming, the classes of rewrite systems to which narrowing is applied are, for the most part, subclasses of the constructor-based, possibly conditional, rewrite systems. ...
Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. ...
Acknowledgements I would like to thank Bernhard Gramlich and Salvador Lucas Alba for inviting me to write a preliminary version of this paper for the International Workshop on Reduction Strategies in Rewriting ...
doi:10.1016/s1571-0661(04)00265-8
fatcat:zpcju56vxba7dlr5uq4cyr7gma
From Logic to Functional Logic Programs
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
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 ...
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 ...
This kind of inlining is the inverse of the normalisation of functional programs presented by Launchbury (1993) to specify a natural semantics for lazy evaluation. ...
arXiv:2205.06841v1
fatcat:du6oucg3zrfptfxrlxhkky55ue
Specialization of Functional Logic Programs Based on Needed Narrowing
[article]
2004
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolution principle of logic languages ...
Needed narrowing is an optimal evaluation strategy which constitutes the basis of modern (narrowing-based) lazy functional logic languages. ...
Efficient demand-driven functional computations are amalgamated with the flexible use of logical variables providing for function inversion and search for solutions. ...
arXiv:cs/0403011v1
fatcat:xrdmm5652fdlzfstopsv4s2f5y
Specialization of functional logic programs based on needed narrowing
2005
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we define a partial evaluator for functional logic programs based on needed narrowing. ...
Needed narrowing is an optimal narrowing strategy and the basis of several recent functional logic languages. ...
Acknowledgements We wish to thank Elvira Albert and Santiago Escobar for many helpful remarks and for their valuable contribution to the implementation and testing work. ...
doi:10.1017/s1471068404002303
fatcat:5e4v4ertwvhdxpoqhpxjahunie
Typed Higher-Order Narrowing without Higher-Order Strategies
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. ...
Our translation is an adaptation to narrowing of Warren's translation, but unlike similar previous work, we preserve static type information, which has a dramatic effect on the size of the narrowing space ...
Acknowledgments The authors are grateful to J. C. González Moreno and M. Hanus for discussions and suggestions on the topics of this paper. ...
doi:10.1007/10705424_22
fatcat:5dszg4x7jjhknp54oq4saswvay
An Implementation of Bubbling
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Non-determinism is of great importance in functional logic programming. It provides expressiveness and efficiency to functional logic computations. ...
In this paper we describe an implementation of the multi-paradigm functional logic language Curry. ...
Logic programming provides reasoning with partial data and missing information, non-determinism, logical variables, and function inversion. ...
arXiv:1112.3789v1
fatcat:q6bduregvzaxdaeqt3zvbmujti
Analysing Definitional Trees: Looking for Determinism
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
As a result of this analysis, we define some generic algorithms that allow us to compile a functional logic program into a set of Prolog clauses which increases determinism and incorporates some refinements ...
that are obtained by ad hoc artifices in other similar implementations of functional logic languages. ...
Acknowledgements We gratefully acknowledge Sergio Antoy for clarifying us some aspects of the theoretical/practical dimension of the failing derivations problem. ...
doi:10.1007/978-3-540-24754-8_6
fatcat:bonnkyefrbcfvluu466i4l67di
Book announcements
1991
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Chapter 7:
Matrix notation for simultaneous
equations.
Determinants.
Inverse of a matrix. Formal evaluation
of
the inverse of a matrix. Geometrical
transformations. ...
The design of an abstract machine for efficient implementation
of contexts in logic programming
(E. Lamma, P. Mello and A. Natali). ...
doi:10.1016/0166-218x(91)90051-w
fatcat:oqpbdxzpljcihecb5tgyinpmva
Partial evaluation of functional logic programs
1998
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge, this is the first generic algorithm for the specialization of functional logic programs. ...
The method is formalized within the theoretical framework established by Lloyd and Shepherdson for the partial deduction of logic programs, which we have generalized for dealing with functional computations ...
Part of this research was done while the third author was visiting the University of Padova and of Udine with a fellowship from the HCM project Console. ...
doi:10.1145/291891.291896
fatcat:hvkxhjv4kre57bzksoxu2vu4le
« Previous
Showing results 1 — 15 out of 13,300 results