Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
From MaRDI portal
Publication:5504591
DOI10.1007/978-3-540-78769-3_3zbMATH Open1179.68031OpenAlexW1556774584MaRDI QIDQ5504591FDOQ5504591
John P. Gallagher, Miguel Gómez-Zamalloa, Elvira Albert, Germán Puebla
Publication date: 22 January 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-540-78769-3_3
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial evaluation in logic programming
- Static Analysis
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Logic program specialisation through partial deduction: Control issues
- A polymorphic type system for Prolog
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Abstract Interpretation with Specialized Definitions
Cited In (2)
Uses Software
This page was built for publication: Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504591)
