Pages that link to "Item:Q5957056"
From MaRDI portal
The following pages link to The narrowing-driven approach to functional logic program specialization (Q5957056):
Displaying 12 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
- Conversion to tail recursion in term rewriting (Q2436518) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- Specialization of functional logic programs based on needed narrowing (Q3370571) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Towards Erlang Verification by Term Rewriting (Q3453650) (← links)
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (Q3617429) (← links)
- (Q3696486) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)