A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs

DOI10.1007/978-3-642-00515-2_4zbMath1185.68188OpenAlexW2158027862MaRDI QIDQ3617429

Germán Vidal, J. Guadalupe Ramos, Gustavo Arroyo, Salvador Tamarit

Publication date: 24 March 2009

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00515-2_4

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definitional interpreters for higher-order programming languages
• Fast narrowing-driven partial evaluation for inductively sequential programs
• Automated termination proofs for logic programs by term rewriting
• Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Higher-order narrowing with definitional trees
• Term Rewriting and All That
• Functional Logic Programming: From Theory to Curry
• Termination analysis and call graph construction for higher-order functional programs
• The size-change principle for program termination
• The narrowing-driven approach to functional logic program specialization

This page was built for publication: A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs