Ensuring the quasi-termination of needed narrowing computations

DOI10.1016/j.ipl.2006.09.010zbMath1184.68165OpenAlexW2149745386MaRDI QIDQ845935

Germán Vidal, J. Guadalupe Ramos, Josep Silva

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.010

zbMATH Keywords

formal semanticsprogramming languagesfunctional programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• BABEL
• Kernel-LEAF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deforestation: Transforming programs to eliminate trees
• Termination of rewriting
• Kernel-LEAF: A logic plus functional language
• Fast narrowing-driven partial evaluation for inductively sequential programs
• A needed narrowing strategy
• Logic programming with functions and predicates: The language Babel
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• The integration of functions into logic programming: From theory to practice

This page was built for publication: Ensuring the quasi-termination of needed narrowing computations