Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Conclusion
References
All Topics
Computer Science
Software

Observing Functional Logic Computations

Profile image of Frank HuchFrank Huch

2004, Springer eBooks

Abstract

The version in the Kent Academic Repository may differ from the final published version. Users are advised to check for the status of the paper. Users should always cite the published version of record.

Related papers

Analysis and Synthesis of Logics
Marcelo Coniglio

Applied Logic Series, 2008

View PDFchevron_right
Operational Semantics for Functional Logic Languages
Javier Oliver

Electronic Notes in Theoretical Computer Science, 2002

In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential, for instance, to have appropriate language definitions in order to reason about programs and check the correctness of implementations. First, we define a "big-step" semantics in natural style to relate expressions and their evaluated results. Since this semantics is not sufficient to reason about the operational aspects of programs, we also define a "small-step" operational semantics covering the main features of functional logic languages. Finally, we demonstrate the equivalence of the "small-step" semantics and the natural semantics.

View PDFchevron_right
Graph-based Implementation of a Functional Logic Langugage
Mario Rodriguez

1990

We present in this paper a graph-narrowing abstract machine which has been designed to support a sequential eager implementation of a functional logic language. Our approach has been to extend a purely functional, (programmed) graph reduction machine by mechanisms capable of performing unification and backtracking. We describe the structure of the machine and explain the compilation scheme which generates machine code from a given source program. Both the machine and the compilation scheme have been formally specified. A prototype emulator of the machine has been implemented in Occam on a transputer system. Future work is planned for incorporating lazy evaluation and parallelism to the machine.

View PDFchevron_right
Derivation of logic programs by functional methods
Lex Bijlsma

Information Processing Letters

In this note we present a method for the calculational derivation of logic programs, employing techniques recently developed for the derivation of functional programs. It has been proposed (10) that the process of synthesizing logic programs should begin with a specification that is itself a (possibly inecient) logic program; subsequently transformations might be applied to obtain from this a logic program with more desirable properties. The diculty with this point of view is that some problem descriptions that one might like to consider are not trivially equivalent to logic programs. In these cases, important design decisions are involved in their reformulation; hence, this phase should be considered part of the programming process. Moreover, if the initial specification were required to be a logic program itself, it would in many cases be less than clear whether the specification really describes the problem we are interested in. Finally, such a requirement tends to load the dice ...

View PDFchevron_right
Graph-based implementation of a functional logic language
Mario Rodriguez

We present in this paper a graph-narrowing abstract machine which has been designed to support a sequential eager implementation of a functional logic language. Our approach has been to extend a purely functional, (programmed) graph reduction machine by mechanisms capable of performing unification and backtracking. We describe the structure of the machine and explain the compilation scheme which generates machine code from a given source program. Both the machine and the compilation scheme have been formally specified. A prototype emulator of the machine has been implemented in Occam on a transputer system. Future work is planned for incorporating lazy evaluation and parallelism to the machine.

View PDFchevron_right
ROSE: A Practical Higher-Order Functional/Logic
Zeki Bayram

cis.uab.edu

We present a higher-order functional/logic language, ROSE. The programs of ROSE are made up of conditional constructor based term rewriting systems. The conditions in the rules can optionally be committing. The operational semantics of the language is conditional narrowing, augmented to deal with committing conditions. The major innovation of the language is the use of committing guards and backtracking to make possible very practical, operationally oriented programs. We show many practical examples, one of which is the definition of the extra logical function not, which implements the negation-as-finite-failure rule in the context of functional/logic programming.

View PDFchevron_right
Recovering Sequentiality in Functional-Logic Programs
Julio Mariño

APPIA-GULP-PRODE, 1998

E cient code generation in implementations of functional logic languages relies on the sequentiality of the program rules | existence of an optimal evaluation order for arguments. Parallel evaluation of arguments in the presence of free variables is out of the question due to the possibility of backtracking and sharing of these variables among di erent arguments. In this paper we show that the lack of sequentiality is often syntactic rather than semantic and that a clever use of type information and strictness analysis can enable a compiler to generate sequential code from most programs.

View PDFchevron_right
A deterministic operational semantics for functional logic programs
Frank Huch

2002

This paper introduces a deterministic operational semantics for functional logic programs including notions like laziness, sharing, concurrency, non-deterministic functions, etc. Our semantic description is important not only to provide appropriate language definitions to reason about programs and check the correctness of implementations but it is also a basis to develop language-specific tools, like program tracers, profilers, optimizers, etc. Starting from a "big-step" semantics in natural style which relates expressions and their evaluated results-but it is not sufficient to cover concurrency, search strategies, or to reason about costs associated to particular computations-, we define a "small-step" operational semantics which actually covers the advanced features of modern functional logic languages.

View PDFchevron_right
Towards a Parallel Virtual Machine for Functional Logic Programming}
Abdulla Alqaddoumi

Technical Communications of …

Functional logic programming is a multi-paradigm programming that combines the best features of functional programming and logic programming. Functional programming provides mechanisms for demand-driven evaluation, higher order functions and polymorphic typing. Logic programming deals with non-determinism, partial information and constraints. Both programming paradigms fall under the umbrella of declarative programming. For the most part, the current implementations of functional logic languages belong to one of two categories: (1) Implementations that include the logic programming features in a functional language.

View PDFchevron_right
Special Issue on the 31Th Italian Conference on Computational Logic: CILC 2016
Alberto Pettorossi

2018

The event was the thirty-first edition of the annual meeting of the Italian Association for Logic Programming (GULP, Gruppo Ricercatori e Utenti di Logic Programming). Since its first edition, the annual conference organized by GULP is the main occasion of meeting and exchanging ideas and experiences among Italian researchers who work in the field of Computational Logic. During the years, this meeting has extended its horizons from the area of Logic Programming to the area of Computational Logic in general, including aspects of Artificial Intelligence and Deductive Databases. The program of CILC 2016 included 21 technical papers accepted for presentation and a few demos. Paper selection was made by peer reviewing.

View PDFchevron_right

References (19)

  1. Simon P. Booth and Simon B. Jones. Walk backwards to happiness -debugging by time travel. In Automated and Algorithmic Debugging, pages 171-183, 1997.
  2. R. Caballero, F.J. López-Fraguas, and M. Rodríguez-Artalejo. Theoretical foun- dations for the declarative debugging of lazy functional logic programs. In FLOPS 2001, pages 170-184. Springer LNCS 2024, 2001.
  3. O. Chitil, C. Runciman, and M. Wallace. Freja, Hat and Hood -a comparative evaluation of three systems for tracing and debugging lazy functional programs. In IFL 2000, pp. 176-193. Springer LNCS 2011, 2001.
  4. W. Drabent, S. Nadjm-Tehrani, and J. Maluszynski. The use of assertions in algorithmic debugging. In Proc. FGCS'88, pages 573-581, 1988.
  5. Andy Gill. Debugging Haskell by observing intermediate data structures. In Gra- ham Hutton, editor, ENTCS, volume 41. Elsevier, 2001.
  6. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
  7. M. Hanus. A unified computation model for functional and logic programming. In POPL '97, pages 80-93, 1997.
  8. M. Hanus. High-level server side web scripting in Curry. In PADL'01, pages 76-92. Springer LNCS 1990, 2001.
  9. M. Hanus, S. Antoy, M. Engelke, K. Höppner, J. Koj, P. Niederau, R. Sadre, and F. Steiner. PAKCS: The Portland Aachen Kiel Curry System. Available at http://www.informatik.uni-kiel.de/~pakcs/, 2003.
  10. M. Hanus (ed.). Curry: An integrated functional logic language (vers. 0.7.2). Avail- able at http://www.informatik.uni-kiel.de/~curry, 2002.
  11. H. Nilsson and P. Fritzson. Algorithmic debugging for lazy functional languages. Journal of Functional Programming, 4(3):337-370, 1994.
  12. Henrik Nilsson. Declarative Debugging for Lazy Functional Languages. PhD thesis, Linköping, Sweden, 1998.
  13. Simon Peyton Jones et al. Haskell 98 language and libraries: the revised report. Journal of Functional Programming, 13(1), 2003.
  14. B. Pope and Lee Naish. Practical aspects of declarative debugging in Haskell-98. In ACM PPDP '03, pages 230-240, 2003.
  15. Claus Reinke. GHood -graphical visualisation and animation of Haskell object observations. In Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, 2001.
  16. E. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
  17. J. Sparud and C. Runciman. Tracing lazy functional computations using redex trails. LNCS, 1292:291-308, 1997.
  18. A. Tessier. Declarative debugging in constraint logic programming. LNCS, 1179:64-73, 1996.
  19. M. Wallace, O. Chitil, T. Brehm, and C. Runciman. Multiple-view tracing for Haskell. In Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, 2001.

Related papers

Functional computations in logic programs
David Warren

ACM Transactions on Programming Languages and Systems, 1989

Although the ability to simulate nondeterminism and to compute multiple solutions for a single query is a powerful and attractive feature of logic programming languages, it is expensive in both time and space. Since programs in such languages are very often functional, that is, they do not produce more than one distinct solution for a single input, this overhead is especially undesirable. This paper describes how programs may be analyzed statically to determine which literals and predicates are functional, and how the program may then be optimized using this information. Our notion of “functionality” subsumes the notion of “determinacy” that has been considered by various researchers. Our algorithm is less reliant on language features such as the cut, and thus extends more easily to parallel execution strategies, than others that have been proposed.

View PDFchevron_right
Qualified Computations in Functional Logic Programming
Rafael Caballero

Qualification has been recently introduced as a generaliza- tion of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language for First-Order Functional Logic Programming with Constraints and Qualification. We present a Rewrit- ing Logic which characterizes the intended semantics of programs, and a prototype implementation based on a semantically correct program transformation. Potential applications of the resulting language include flexible information retrieval. As a concrete illustration, we show how to write program rules to compute qualified answers for user queries con- cerning the books available in a given library.

View PDFchevron_right
On a Tighter Integration of Functional and Logic Programming
Bernd Braßel

2007

The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: sharing computations across non-deterministic branching and the declarative encapsulation of logic search. We then present a formal approach which shows how these improvements can be realized and prove the soundness of our approach.

View PDFchevron_right
The (Lazy) Functional Side of Logic Programming
Sandro Etalle

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 programs. As a consequence of this it has become widely accepted that "complex" logical variables, the possibility of a dynamic selection rule, and general properties of non-well-moded programs are exclusive features of logic programs. This is not quite true, as some of these features are naturally found in lazy functional languages. We readdress the old question of what features are exclusive to the logic programming paradigm by defining a simple translation applicable to a wider range of logic programs, and demonstrate that the current circumscription is unreasonably restrictive.

View PDFchevron_right
Functional and (Constraint) Logic Programming
Santiago Escobar

Information and Computation, 2014

View PDFchevron_right

Related topics

  • Computer Science
  • Functional Programming
  • Lazy Evaluation
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved