Type-based homeomorphic embedding for online termination

DOI10.1016/j.ipl.2009.04.016zbMath1205.68508OpenAlexW2061746685MaRDI QIDQ989516

Elvira Albert, Germán Puebla, Miguel Gómez-Zamalloa, John P. Gallagher

Publication date: 20 August 2010

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

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

zbMATH Keywords

analysis of algorithmsformal methodsprogram transformationpartial evaluationterminationhomeomorphic embeddingwell-quasi orders

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items

Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Partial evaluation of string obfuscations for Java malware detection

Uses Software

• ECCE
• Mercury

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Mixtus: An automatic partial evaluator for full Prolog
• Automatic finite unfolding using well-founded measures
• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Logic program specialisation through partial deduction: Control issues
• Loop checking in partial deduction
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Static Analysis