Evaluation Strategies for Functional Logic Programming

DOI10.1016/S1571-0661(04)00265-8zbMath1268.68092MaRDI QIDQ2841220

Sergio Antoy

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. ⋮ An integrated framework for the diagnosis and correction of rule-based programs

Cites Work

• Strongly sequential and inductively sequential term rewriting systems
• Programming in equational logic: Beyond strong sequentiality
• Conditional rewrite rules: Confluence and termination
• Computing in systems described by equations
• A needed narrowing strategy
• Higher-order narrowing with definitional trees
• The integration of functions into logic programming: From theory to practice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evaluation Strategies for Functional Logic Programming