Fast narrowing-driven partial evaluation for inductively sequential programs

DOI10.1145/1086365.1086394zbMath1302.68067OpenAlexW2047867098MaRDI QIDQ2936786

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

Publication date: 6 January 2015

Published in: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1086365.1086394

zbMATH Keywords

narrowingoffline partial evaluationquasi-termination

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (7)

Ensuring the quasi-termination of needed narrowing computations ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ Conversion to tail recursion in term rewriting ⋮ Termination of narrowing via termination of rewriting ⋮ A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ Preserving Sharing in the Partial Evaluation of Lazy Functional Programs

This page was built for publication: Fast narrowing-driven partial evaluation for inductively sequential programs