D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In Recent Trends in Data Type Specifications, pages 132--152. Springer LNCS 906, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Debugging Scheme for Functional Logic Programs - Alpuente, Correa, Falaschi (2002) (1 citation) (Correct)
....ii) see [25] for details) Note that inn as well as out only compute constructor substitutions in programs which satisfy the conditions for the completeness of the corresponding strategy. Innermost narrowing is the foundation of several functional logic programming languages like SLOG [30] LPG [14,15] and (a subset of) ALF [33] Innermost narrowing corresponds to the eager evaluation strategies in functional programming. Modern functional logic languages like Curry [35] Escher [39] and Toy [21] are based on lazy evaluation principles, which delay the evaluation of function arguments until ....
D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In Recent Trends in Data Type Specifications, pages 132--152. Springer LNCS 906, 1995.
A Debugging Scheme for Functional Logic Programs - Alpuente (2002) (1 citation) (Correct)
....(see [24] for details) Note that inn as well as out only compute constructor substitutions in programs which satisfy the conditions for the completeness of the corresponding strategy. Innermost narrowing is the foundation of several functional logic program ming languages like SLOG [29] LPG [13,14] and (a subset of) ALF [32] In nermost narrowing corresponds to the eager evaluation strategies in functional programming. Modern functional logic languages like Carry [341, Escher [381 and Toy [201 are based on lazy evaluation principles, which delay the eval uation of function arguments until ....
D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In Recent Trends in Data Type Specifications, pages 132-152. Springer LNCS 906, 1995.
A Debugging Scheme for Functional Logic Programs - Alpuente, Correa, Falaschi (2001) (1 citation) (Correct)
....t whenever we consider = inn, whereas the equations have the form s t when we consider = out. Note that a non strict equation like f(a) g(a) is not an acceptable goal when = out. Innermost narrowing is the foundation of several functional logic programming languages like SLOG [21] LPG [7, 8] and (a subset of) ALF [23] Innermost narrowing corresponds to the eager evaluation strategies in functional programming. Modern functional logic languages like Curry [25] Escher [31] and Toy [12] are based on lazy evaluation principles, which delay the evaluation of function arguments until ....
D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In Recent Trends in Data Type Specications, pages 132{
Declarative Debugging of Functional Logic Programs - Alpuente, Correa, Falaschi (2001) (Correct)
....t whenever we consider = inn, whereas the equations have the form s t when we consider = out. Note that a non strict equation like f(a) g(a) is not an acceptable goal when = out. Innermost narrowing is the foundation of several functional logic programming languages like SLOG [26] LPG [7, 8] and (a subset of) ALF [28] Innermost narrowing corresponds to the eager evaluation strategies in functional programming. Modern functional logic languages like Curry [31] Escher [35] and Toy [13] are based on lazy evaluation principles, which delay the evaluation of function arguments until ....
D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In Recent Trends in Data Type Specications, pages 132-152. Springer LNCS 906, 1995.
Declarative Debugging of Functional Logic Programs - Alpuente, Correa, Falaschi (2001) (Correct)
.... equality is only defined on finite and completely determined data structures, whereas the other (non strict) equality = is defined on partially determined or infinite data structures [26] Innermost narrowing is the foundation of several functional logic programming languages like SLOG [25] LPG [6, 7] and (a subset of) ALF [27] Innermost narrowing corresponds to the eager evaluation strategies in functional programming. Modern functional logic languages like Curry [30] Escher [34] and Toy [12] are based on lazy evaluation principles, which delay the evaluation of function arguments until ....
D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In Recent Trends in Data Type Specifications, pages 132--152. Springer LNCS 906, 1995.
Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997) (Correct)
....the user, that is how to get and display information using the specification language known to the user. These ideas were used for developing interfaces with the proof checker LP [364] and, within the Salsa project [832] interfaces with environments for the algebraic specification languages Lpg [85] and Glider. 6.4.2 Extended ML The long term goal of work on Extended ML is to provide a practical framework for formal development of Standard ML programs together with an integrated suite of computer based specification and development support tools and complete mathematical foundations to ....
D. Bert and R. Echahed. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specifications. 10th Workshop on Specification of Abstract Data Types, pages 132--152. Springer LNCS 906, 1995.
Specialization of Functional Logic Programs - Alpuente, Falaschi, Vidal (Correct)
....over C. In one sorted theories, completely defined theories occur only rarely. However, they are common when using types, and each function is defined for all constructors of its argument types. Examples of functional logic languages following the CB CD discipline are SLOG [Fri85] and LPG [BE86, BE95] Let J (g) be the narrowing strategy which assigns the position p of the leftmost innermost subterm of g to the goal g. We formulate innermost conditional narrowing by means of a labeled transition system, whose transition relation ; J formalizes the computation steps. In the following, we ....
.... normal form of a goal uniquely exists and can be computed by any strategy of rewriting, only a decreasing subset of the program rules is used for normalization [DJ90] Normalizing innermost narrowing is the foundation of several functional logic programming languages like SLOG [Fri85] LPG [BE86, BE95] and (a subset of) ALF [Han90] Thus, the method that we propose can be used for the optimization of programs written in these languages. It has been shown that, since functions allow more deterministic evaluation than predicates, normalizing innermost narrowing has the effect that functional ....
[Article contains additional citation context not shown here]
D. Bert and R. Echahed. On the operational semantics of the algebraic and logic programming language LPG. In Recent Trends in Data Type Specifications, volume 906 of Lecture Notes in Computer Science, pages 132--152, Berlin, 1995. Springer-Verlag.
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