next up previous
Next: Benchmarks code Up: Incremental Needed Narrowing Previous: Conclusions

References

AEH94
S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc. 21st ACM Symp. on Principles of Programming Languages, Portland, pages 268-279, 1994.

AHLV99
M. Alpuente, M. Hanus, S. Lucas, and G. Vidal. Specialization of Inductively Sequential Functional Logic Programs. In Proc. of 1999 International Conference on Functional Programming, ICFP'99, 1999. To appear.

Ant92
S. Antoy. Definitional trees. In Proc. of the 3rd International Conference on Algebraic and Logic Programming ALP'92, pages 143-157. Springer LNCS 632, 1992.

BCG tex2html_wrap_inline1751 89
P.G. Bosco, C. Cecci, E. Giovannetti, C. Moiso, and C. Palamidessi. Using resolution for a sound and efficient integration of logic and functional programming. In J. deBakker, editor, Languages for parallel architectures. Wiley (UK), 1989.

DJ90
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243-320. Elsevier, Amsterdam, 1990.

DS93
I. Durand and B. Salinier. Constructor Equivalent Term Rewriting Systems. Information Processing Letters, 47:131-137, 1993.

Dur94
I. Durand. Bounded, Strongly Sequential and Forward Branching Term Rewriting Systems. Journal of Symbolic Computation, 18:319-352, 1994.

EAL98
S. Escobar, M. Alpuente, and S. Lucas. UPV-Curry User's Manual. Technical Report DSIC-II/38/98, DSIC, Universidad Politécnica de Valencia, 1998. Available at http://www.dsic.upv.es/users/elp/papers.html.

HAK tex2html_wrap_inline1751 99
M. Hanus, S. Antoy, H. Kuchen, F.J. López-Fraguas, and F. Steiner. Curry An Integrated Functional Logic Language (version 0.5). Available at http://www-i2.informatik.rwth-aachen.de/~hanus/curry, February 1999.

Han94
M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.

Han95
M. Hanus. Efficient translation of lazy functional logic programs into prolog. In Proc. Fifth International Workshop on Logic Program Synthesis and Transformation, pages 252-266. Springer LNCS 1048, 1995.

HKMN95
M. Hanus, H. Kuchen, and J.J. Moreno-Navarro. Curry: A truly functional logic language. In Proc. ILPS'95 Workshop on Visions for the Future of Logic Programming, pages 95-107, 1995.

HL79
G. Huet and J.-J. Lévy. Call by need computations in nonambiguous linear term rewriting systems. Technical report, IRIA Laboria, LeChesnay, France, 1979.

HL91
G. Huet and J.-J. Lévy. Computations in Orthogonal Term Rewriting Systems. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honour of Alan Robinson, pages 396-443. The MIT Press, Cambridge, MA, 1991.

HL94
P. Hill and J.W. Lloyd. The Gödel Programming Language. The MIT Press, Cambridge, MA, 1994.

HLM98
M. Hanus, S. Lucas, and A. Middeldorp. Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters, 67(1):1-8, 1998.

HPW92
P. Hudak, S. Peyton Jones, and P. Wadler. Report on the Functional Programming Language Haskell: a non-strict, purely functional language. Sigplan Notices, 27(5), 1992.

HS91
M. Hanus and A. Schwab. The Implementation of the Functional-Logic Language ALF. FB Informatik, Univ. Dortmund, 1991.

Hul80
J.M. Hullot. Canonical Forms and Unification. In Proc of 5th Int'l Conf. on Automated Deduction, pages 318-334. Springer LNCS 87, 1980.

KA96
H. Kuchen and J. Anastasiadis. Higher Order Babel: Language and implementation. In editors Proc. 5th International Workshop on Extensions of Logic Programming ELP'96, pages 193-207. Springer LNAI 1050, 1996.

KLMR90
H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodríguez-Artalejo. Lazy Narrowing in a Graph Machine. In Proc. of the Int'l Conf. on Algebraic and Logic Programming, pages 298-317. Springer LNCS 463, 1990.

LLR93
R. Loogen, F. López-Fraguas, and M. Rodríguez-Artalejo. A Demand Driven Computation Strategy for Lazy Narrowing. In J. Penjam and M. Bruynooghe, editors, Proc. of PLILP'93, Tallinn (Estonia), pages 184-200. Springer LNCS 714, 1993.

LS99
F.J. López Fraguas and J. Sánchez Hernández. Toy: A multiparadigm Declarative System. In P. Narendran and M. Rusinowitch, editors, 10th International Conference on Rewriting Techniques and Applications, RTA'99, volume 1631 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1999.

MTH90
R. Milner, M. Tofte, and R. Harper. The Definition of ML. The MIT Press, 1990.

NM88
G. Nadathur and D. Miller. An Overview of tex2html_wrap_inline1801 Prolog. In R.A. Kowalski and K.A. Bowen, editors, Proc. of Fifth Int'l Conf. on Logic Programming ICLP'88, pages 810-827. The MIT Press, Cambridge, MA, 1988.

O'D98
M. J. O'Donnell. Equational Logic Programming. In D. Gabbay, ed., Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5 on Logic Programming, Chapter 2, pages 69-161. Oxford Science Publications, 1998.

PvE93
R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993.

Red85
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138-151. IEEE, New York, 1985.

Sla74
J.R. Slagle. Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal of the ACM, 21(4):622-642, 1974.

Str89
R. Strandh. Classes of Equational Programs that Compile into Efficient Machine Code. In N. Dershowitz, editor, Proc. of RTA'89, volume 355 of Lecture Notes in Computer Science, pages 449-461. Springer-Verlag, Berlin, 1989.

TSvEP93
Y. Toyama, S. Smetsers, M.C.J.D. van Eekelen, and R. Plasmeijer. The functional strategy and transitive term rewriting systems. In Term Graph Rewriting - Theory and Practice, pages 117-129. John Wiley & sons, 1993.



Santiago Escobar
Fri Sep 3 14:51:16 MET DST 1999