Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
From MaRDI portal
Publication:5504591
Recommendations
Cites work
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1950450 (Why is no real title available?)
- scientific article; zbMATH DE number 1953286 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A polymorphic type system for Prolog
- Abstract Interpretation with Specialized Definitions
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- Logic program specialisation through partial deduction: Control issues
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Partial evaluation in logic programming
- Static Analysis
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(2)
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)