Translating fork specifications into logic programs
In this work a compiler from fork specifications into logic programs is presented. The technique implemented by the compiler consists of transforming a set of fork equations (with some restrictions) into normal logic programs in such a way that the semantics of the fork equations is preserved. After translating a fork specification, it can be executed by consulting the generated logic program. The fork compiler, a tool for the translation, is also introduced.
 Apt, K.R., Blair, H.A., Walker, A., Towards a Theory of Declarative Knowledge, in J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Pub., Washington D.C., 1988.
 Baum, G.A., Frias, M.F., Haeberer, A.M. and Martínez López,P.E., From Specifications to Programs: AFork-algebraic Approach to Bridge the Gap, in Proceedings of MFCS'96, LNCS1113, Springer-Verlag, pp. 180-191,1996.
 Brink, C., Kahl, W. and Schmidt, G.(Eds.), Relational Methods in Computer Science, Springer, Wien New York, 1997.
 Frias, M. F., Baum, G. A. and Haeberer, A.M., Representability and Program Construction within Fork Algebras, to appear in Journal of the IGPL.
 Frias, M. F., Baum, G.A., Haeberer, A. M. and Veloso, P.A.S.,A Representation Theorem for Fork Algebras, (Technical Report) MCC. 29/93, PUC-RJ, August 1993.
 Frias, M. F., Baum, G. A., Haeberer, A.M. and Veloso, P. A.S., Fork Algebras are Representable, in Bulletin of the Section of Logic, University of Lodz, Vol. 24, No. 2, pp.64-75, 1995.
 Libra Programming Language, Department of Computer Science, University of Adelaide, Adelaide, South Australia, URL: www.cs.adelaide.edu.au/users/dwyer/TR95-10TOC.html.
 Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag, 1987.
 Ralf System, Home Page of RelMiCS,URL: inf2-www.informatik.unibw-muenchen.de/Research/Tools/Ralf/ralfmanual.html.
 Relview System, Department of Computer Science and Applied Mathemathics, University of Kiel, Germany. URL: www.informatik.unikiel.de/~progsys/relview.html.