Abstract
We propose an implementation of a functional logic language with parametric order sorted types by translating typed lazy narrowing into Prolog, and establishing a reasonable strategy of combination of data and type constraints solving. By means of this translation, we describe how types can be used at run-time to prune the search space of solutions of a goal. Moreover, we present type inference and checking compile-time tools for the language showing its usefulness for improving computations.
This research has been partially supported by the Spanish National Projects TIC95-0433-C03-01 “CPD” and TIC98-0445-C03-02 “TREND”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.M. Almendros-Jiménez, A. Gil-Luezas. Lazy Narrowing with Parametric Order-Sorted Types, Procs. ALP-HOA’97, LNCS 1298, pp. 159–173, 1997.
J.M. Almendros-Jiménez, A. Gavilanes-Franco, A. Gil-Luezas. Algebraic Semantics for Functional Logic Programs with Polymorphic Order-Sorted Types, Procs. ALP’96, LNCS 1139, pp. 299–313, 1996.
P. Arenas-Sánchez, A. Gil-Luezas, F.J. López-Fraguas. Combining Lazy Narrowing with Disequality Constraints, Procs. PLILP’94, LNCS 844, pp. 385–399, 1994.
C. Beierle. Type Inferencing for Polymorphic Order-Sorted Logic Programs, Procs. ICLP’95, The MIT Press, pp. 765–779, 1995.
C. Beierle. Concepts, Implementation and Applications of a Typed Logic Programming Language, Logic Programming: Formal Methods and Practical Applications. C. Beierle and L. Plümer Eds. Elsevier Science, pp. 139–167, 1995.
C. Beierle, G. Meyer. Run-Time Type Computations in the Warren Abstract Machine, JLP, 18, pp. 123–148, 1994.
P.H. Cheong. L. Fribourg. Implementation of Narrowing: The Prolog-Based Approach, In K.R. Apt, J.W. Bakker, J.J.M.M. Rutten, Eds. Logic Programming Languages: Constraints, Functions and Objects. The MIT Press, pp. 1–20. 1993.
Y. Fuh, P. Mishra. Type Inference with Subtypes, TCS 73, pp. 155–175, 1990.
J.C. González-Moreno, T. Hortalá-González, F. J. López-Fraguas, M. Rodríguez-Artalejo. A Rewriting Logic for Declarative Programming, Procs. ESOP’96, LNCS 1058, pp. 156–172, 1996.
J.C. González-Moreno, T. Hortalá-González, M. Rodrǵuez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming, Procs.ICLP’97,The MIT Press, pp. 153–167, 1997.
M. Hanus, S. Antoy, H. Kuchen, F.J. López-Fraguas, F. Steiner Curry: An Integrated Functional Logic Language, Draft June 1998.
M. Hanus. Parametric Order-Sorted Types in Logic Programming, Procs. TAPSOFT91’, LNCS 494, pp. 181–200, 1991.
M. Hanus. The Integration of Functions into Logic Programming: A Survey, JLP (19,20), Special issue “Ten Years of Logic Programming”, pp. 583–628, 1994.
M. Hanus. A Unified Computation Model for Functional and Logic Programming, Procs. POPL’97, pp. 80–93, 1997.
P.M. Hill, R.W. Topor. A Semantics for Typed Logic Programming, in [17], Chapter 1, pp. 1–58, 1992.
R. Loogen, F.J. López-Fraguas, M. Rodríguez-Artalejo. A Demand Driven Computation Strategy for Lazy Narrowing,Procs.PLILP’93, LNCS 714, pp. 184–200, 1993.
F. Pfenning. Types in Logic Programming, The MIT Press, 1992.
G.S. Smith. Principal Type Schemes for FunctionalPrograms with Overloading and Subtyping, Science of Computer Programming 23, pp. 197–226, 1994.
G. Smolka. TEL (version 0.9), Report and User Manual, SEKI-Report SR, 87–17, FB Informatik, Universität Kaiserslautern, Germany, 1988.
G. Smolka. Logic Programming over Polymorphically Order-Sorted Types, PhD thesis, FB Universität Kaiserslautern, Germany, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Almendros-Jiménez, J.M. (1998). Improving Computations in a Typed Functional Logic Language. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_31
Download citation
DOI: https://doi.org/10.1007/3-540-49253-4_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65462-9
Online ISBN: 978-3-540-49253-5
eBook Packages: Springer Book Archive