Abstract
The functional-logic language Flang is considered in this paper. The ideas of logic programming, functional programming and tools for algebraic computations are unified in it within a single abstract machine. This language is intended for symbolic computations and education.
Preview
Unable to display preview. Download preview PDF.
References
Warren D.H.D. Implementing Prolog — Compiling predicate logic programs. Technical Report, 39, 40, University of Edinburgh, May 1977.
Robinson J.A., Sibert E. The LOGLISP user's manual.-Syracuse Univ., NY, 1981.
Bockmayr A. Conditional rewriting and narrowing as theoretical framework for logic-functional programming (A Survay).-Interner Bericht No 10/86, Univ Karlsruhe, 35p., 1986.
Goguen J.A., Meseguer J. Equality, types, modules and generics for logic programming.-Proc of the 1985 symp.on logic programming, Boston, MA, 172–184,1985.
Fribourg L. SLOG: a logic programming language interpreter based on clausal superposition and rewriting.-Proc or the 1985 eymp.on logic programming, Boston, MA, 172–184.
Boley H. Relfun: A relational/functional integration with valued clauses. SIGPLAN Notices, 21(12), 1986, 87–98.
Boley H. A Relational/Functional Language and its Compilation into the WAM. SEKI Report SR-90-05, University of Kaiserslautern., April 1990.
Hein H.-G. Adding WAM instructions to support valued clauses for relational/functional integration language RELFUN. Technical Report SWP-90-02, University of Kaiserslautern, December 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mantsivoda, A.V. (1991). Flang: A functional-logic language. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013535
Download citation
DOI: https://doi.org/10.1007/BFb0013535
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive