Lazy narrowing with parametric order sorted types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1298, Issue , 1997, Pages 159-173

  Almendros Jimenez J M ^a   Gil Luezas, A ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; CALCULATIONS; COMPUTER CIRCUITS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

INCLUSION POLYMORPHISM; LAZY FUNCTIONAL PROGRAMMING; MODEL-THEORETIC SEMANTICS; RUNTIMES; SOLVING PROCEDURE; SOUND AND COMPLETE; SOUNDNESS AND COMPLETENESS; TYPECHECKING;

FUNCTIONAL PROGRAMMING;

EID: 84957631998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027009     Document Type: Conference Paper

References (22)

1. J.M. Almendros-Jiménez. Type Inference and Checking for Polymorphic Order-Sorted Typed Functional Logic Programs, Procs. Joint Conference in Declarative Programming APPIA-GULP-PRODE'96, pp. 439-450, 1996.
2. J.M. Almendros-Jiménez, A. Gavilanes-Franco, A. Gil-Luezas. Algebraic Semantics for Functional Logic Programs with Polymorphic Order-Sorted Types, Procs. ALP96, Springer LNCS 1139, pp. 299-313, 1996.
3. J.M.Almendros-Jiménez, A. Gil-Luezas. Lazy Narrowing with Polymorphic Order-Sorted Types (Extended Version), Technical Report 30/96 DIA. Universidad Com-plutense. Madrid. 1996. Available in http://mozart.mat.ucm.es.
4. C. Beierle. Type Inferencingfor Polymorphic Order-Sorted Logic Programs, Procs. ICLP'95, The MIT Press, pp. 765-779, 1995.
5. C.Beierle. Concepts, Implementation and Applications of a Typed Logic Programming Language, Logic Programming: Formal Methods and Practiced Applications. C. Beierle and L. Pliimer Eds. Elsevier Science, pp. 139-167, 1995.
6. 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, pp. 1-20. The MIT Press. 1993.
7. N. Dershowitz, A. Manna. Proving Termination with Multisets Orderings, Communications of the ACM 22(8), pp. 465-476, 1979.
8. Y. Fuh, P. Mishra, Type Inference with Subtypes, Theoretical Computer Science 73, pp. 155-175, 1990.
9. J.A. Goguen, J. Meseguer. Order Sorted Algebra I: Equational deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations, Theoretical Computer Science 105, pp. 217-273, 1992.
10. J.C. González-Moreno, T. Hortalá-González, M. Rodriguez Artalejo. On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming, Procs. CSL'92, Springer LNCS 702, pp. 216-230, 1993.
11. J.C. González-Moreno, T. Hortalá-González, F. López-Fraguas, M. Rodríguez-Artalejo. A Rewriting Logic for Declarative Programming, Procs. ESOP'96, Springer LNCS 1058, pp. 156-172, 1996.
12. M. Hanus. A Functional and Logic Language with Polymorphic Types, Procs. Int. Symp. on Design and Implementation of Symbolic Computation Systems, Springer LNCS 429, pp. 215-224, 1990.
13. M. Hanus. Parametric Order-Sorted Types in Logic Programming, Procs. TAPSOFT'91, Springer LNCS 494, pp. 181-200, 1991.
14. M. Hanus. The Integration of Functions into Logic Programming: A Survey, Journal of Logic Programming (19,20), Special issue Ten Years of Logic Programming, pp. 583-628, 1994.
15. P.M. Hill, R.W. Topor. A Semantics for Typed Logic Programming, Chapter 1, Types in Logic Programming, Logic Programming Series, Frank Pfenning Editor, The MIT Press, pp. 1-58, 1992.
16. R. Milner. A Theory of Type Polymorphism in Programming, Journal of Computer and System Sciences, 17(3), pp. 348-375, 1978.
17. Logic Programming with Functions and Predicates: The Language BABEL, Journal of Logic Programming 12, pp. 191-223, 1992.
18. A. Mycroft, R.A. O'Keefe. A Polymorphic Type System for Prolog, Artificial Intelligence 23, pp. 295-307, 1984.
19. A. Middeldorp, S. Okui. Deterministic Lazy Narrowing, Procs. Fuji International Workshop on Functional and Logic Programming, World Scientific, pp. 104-118, 1995.
20. K. Nakahara, A. Middeldorp, T. Ida. A Complete Narrowing Calculus for Higher-Order Functional Logic Programming, Procs. PLILP'95, Springer LNCS 982, pp. 97-114, 1995.
21. G.S. Smith. Principal Type Schemes for Functional Programs with Overloading and Subtyping, Science of Computer Programming 23, pp. 197-226, 1994.
22. G. Smolka. Logic Programming over Polymorphically Order-Sorted Types, PhD thesis, Universität Kaiserslautern, Germany, 1989.