U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proceedings of the IEEE International Symposium on Logic Programming, pages 138-- 151, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Debugging Scheme for Functional Logic Programs - Alpuente, Correa, Falaschi (2002) (1 citation) (Correct)
....there are no infinite sequences of the form t 1 . A CTRS is confluent if, whenever a term s reduces to two terms t 1 and t 2 , both t 1 and t 2 reduce to the same term. Functional logic languages are extensions of functional languages with principles derived from logic programming [46]. The computation mechanism of functional logic languages is based on narrowing , a generalization of term rewriting where unification replaces matching: both the rewrite rule and the term to be rewritten can be instantiated. Since unrestricted narrowing has quite a large search space, several ....
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, New York, 1985.
Correction of Functional Logic Programs - Alpuente, Ballis, Correa, Falaschi (2003) (Correct)
....by R is noetherian and con uent [27] A successful conditional rewriting sequence (also called proof) for a goal g in R (extended with the rules for the equality) is a sequence D : g g 1 g 2 : true. The standard operational semantics of functional logic programs is based on narrowing [18, 36], a combination of uni cation for parameter passing and reduction as evaluation mechanism which subsumes rewriting and SLD resolution. Essentially, narrowing consists of the instantiation of goal variables, followed by a reduction step on the instantiated goal. Narrowing is complete in the sense ....
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138-151. IEEE, New York, 1985.
A Debugging Scheme for Functional Logic Programs - Alpuente (2002) (1 citation) (Correct)
....are no infinite sequences of the form tl 7z t2 7z t3 7z A CTRS is confluent if, whenever a term reduces to two terms tl and t2, both tl and t2 reduce to the same term. Functional logic languages are extensions of functional languages with prin ciples derived from logic programming [45]. The computation mechanism of functional logic languages is based on narrowing, a generalization of term rewriting where unification replaces matching: both the rewrite rule and the term to be rewritten can be instantiated. Since unrestricted narrowing has quite a large search space, several ....
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Syrup. on Logic Programming, pages 138-151. IEEE, New York, 1985.
Sharing of Computations - Amtoft (1993) (1 citation) (Correct)
....produce the function this enables specializations to be reused even though the (non used) static arguments di#er. 9. 2 Integrating the functional and logical model The functional and logic paradigms are not too far apart, as witnessed by several successful attempts at bridging the gap e.g. Red85] and [Han92] So is there any excuse for my not coming up with a core model, capturing the abstract properties needed to formulate correctness speedup theorems etc Well, since flow of control and data di#er in a substantial way some rather severe di#culties arise, cf. the discussion initially ....
Uday S. Reddy. Narrowing as the operational semantics of functional languages. In IEEE Logic Programming Symposium, Boston, pages 138--151, 1985.
Conditional Equational Theories and Complete Sets of.. - Hölldobler (2 citations) (Correct)
....[Jaffar et al. 1984; Jaffar et al. 1986] the main problem remains of how the E unifiers of two expressions can be computed. This can be done by flattening and SLD resolution (e.g. Barbuti et al. 1986] by paramodulation or special forms of it (e.g. Robinson and Wos, 1969; Fribourg, 1985; Reddy, 1985; Furbach et al. 1989] or by complete sets of transformations [Kirchner, 1984; Martelli et al. 1986; Gallier and Snyder, 1987; Holldobler, 1987b] Let us briefly recall these techniques. Flattening a clause means to replace nested functional expressions by new variables and to add equations ....
....=t i j 1 i ng; where D and D are sets of atoms and equations. There are, of course, other proposals to handle equational theories. We have already mentioned paramodulation and special forms of it like narrowing (e.g. Giovannetti and Moiso, 1988; Hullot, 1980; Hussmann, 1985; Kaplan, 1986; Reddy, 1985; Rety et al. 1985] or superposition [Fribourg, 1984; Fribourg, 1985] It seems that the use of transformation rules cuts down the search space since there are less alternatives, the application is demand driven, and failures can be recognized earlier. Another proposal is based on the idea to ....
U. S. Reddy. Narrowing as an operational semantics of functional languages. In Proceedings of the Symposium on Logic Programming, Computer Society, Press of the IEEE, Washington, pages 138--151, 1985. 28
Making a Productive Use of Failure to Generate Witnesses.. - Dennis, Bundy, Green (2000) (Correct)
....X i )i 2 R ) 8 : f i ( X 0 i ) g i ( X 0 i ) f i ( X 0 i ) g i ( X 0 i ) h ; i 2 R [ Figure 2. The Gfp Membership(h i) Method 6.3. Evaluate Method The evaluate method embodies a non strict evaluation strategy with narrowing [28]. The object is to reduce the expressions l i in goals of the form coinduction hypothesis ) 8 : l a l b ) l a l b ) h ; i 2 R[ 34) Witnesses for Coinduction 15 to weak head normal form. To do this, non strict evaluation has to be extended with some case ....
U. S. Reddy. Narrowing as the Operational Semantics of Functional Languages, in: Proc. of Second IEEE Int'l Symp. on Logic Programming pp. 138-151. IEEE, New York, 1985.
Adding Linear Constrains over Real Numbers to Curry - Lux (2000) (Correct)
....1 Introduction Curry [Han00] is a multi paradigm language that integrates features from functional languages, logic languages, and concurrent programming. The operational model of Curry is based on an optimal reduction strategy [AEH97] which integrates needed narrowing and residuation. Narrowing [Red85] combines uni cation and reduction allowing the non deterministic instantiation of unbound logic variables. The residuation strategy [ALN87] on the other hand, delays the evaluation of expressions containing unbound logic variables until these are suciently instantiated by other parts of the ....
U. Reddy. Narrowing as the operational semantics of functional languages. In Proc. ILPS'85, pages 138-151, 1985.
A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proceedings of the IEEE International Symposium on Logic Programming, pages 138-- 151, 1985.
A Compositional Semantic Basis for the Analysis of.. - Alpuente, Falaschi.. (1996) (2 citations) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, 1985. 21
Compositional Analysis for - Programs (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, 1985.
Call-by-Name Specialization of Functional Logic Programs - Alpuente, Falaschi.. (1996) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, New York, 1985.
Specialization of Lazy Functional Logic Programs - Alpuente, Falaschi, Julian.. (1997) (8 citations) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, New York, 1985.
Narrowing-driven Partial Evaluation of Functional Logic.. - Alpuente, Falaschi, Vidal (1996) (12 citations) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, New York, 1985.
Safe Folding/Unfolding with Conditional Narrowing - Alpuente, Falaschi, Moreno.. (1997) (2 citations) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of 2nd Int'l Symp. on Logic Programming, pages 138--151. IEEE, 1985.
The Narrowing-Driven Approach to Functional Logic Program.. - Albert, Vidal (2002) (2 citations) (Correct)
No context found.
) Reddy U.S., "Narrowing as the Operational Semantics of Functional Languages, " in Proc. of the 2nd IEEE Int'l Symp. on Logic Programming, IEEE, New York, pp. 138--151, 1985.
Unfolding of Equational Logic Programs - Alpuente, Falaschi, Ramis, Vidal (1994) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, 1985.
Narrowing-driven Specialization of Functional Logic Programs - Alpuente, Falaschi, Vidal (1996) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, New York, 1985.
Call-by-Name Partial Evaluation of Functional Logic.. - Alpuente, Falaschi.. (1996) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. SLP'85, pages 138--151. IEEE, New York, 1985.
Refining Weakly Outermost-Needed Rewriting and Narrowing - Escobar (2003) (Correct)
No context found.
U. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138--151. IEEE, New York, 1985.
On Modularity in Term Rewriting and Narrowing - Prehofer (1994) (4 citations) (Correct)
No context found.
U. S. Reddy. Narrowing as the operational semantics of functional languages. In Symposium on Logic Programming, pages 138--151. IEEE Computer Society, Technical Committee on Computer Languages, The Computer Society Press, July 1985.
ROSE: A Practical Higher-Order Functional/Logic Language - Bayram, Bryant, Altynay (Correct)
No context found.
Uday S. Reddy. Narrowing as the operational semantics of functional languages. In Proceedings of the 1985.
Swinging Data Types - The dielectic between actions and.. - Padawitz (1998) (Correct)
No context found.
U. Reddy, Narrowing as the Operational Semantics of Functional Languages, Proc. IEEE Symp. on Logic Programming (1985) 138-151
Programming with Narrowing - Sergio Antoy Computer (Correct)
No context found.
U. S. Reddy. Narrowing as the operational semantics of functional languages. In International Symposium on Logic Programming, pages 138--151. IEEE Computer Soc. Press, 1985.
A Semantics for Program Analysis in Narrowing-Based Functional .. - Hanus, Lucas (1999) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of IEEE International Symposium on Logic Programming, pages 138151, 1985.
Context-Sensitive Rewriting Strategies - Lucas (2000) (2 citations) (Correct)
No context found.
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages In Proc. of IEEE International Symposium on Logic Programming, pages 138-151, 1985.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC