Type-based homeomorphic embedding for online termination
From MaRDI portal
Publication:989516
DOI10.1016/j.ipl.2009.04.016zbMath1205.68508MaRDI QIDQ989516
Elvira Albert, John P. Gallagher, Germán Puebla, Miguel Gómez-Zamalloa
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
analysis of algorithms; formal methods; program transformation; partial evaluation; termination; homeomorphic embedding; well-quasi orders
68W25: Approximation algorithms
Related Items
Uses Software
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