W. Lux. Implementing encapsulated search for a lazy functional logic language. In Proc. 4th Fuji Intl. Symposium on Functional and Logic Programming (FLOPS '99), pages 100--113. Springer LNCS 1722, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Implementation of Narrowing Strategies - Antoy, Hanus, Massey, Steiner (2001) (Correct)
....on such languages and their implementations) An implementation of narrowing translates a program consisting of rewrite rules into executable code. This executable code currently falls into two categories: Prolog predicates (e.g. 4, 12, 15, 27] or instructions for an abstract machine (e.g. [11, 19, 26, 29]) Although these approaches are relatively simple, in both cases, several layers of interpretation separate the functional logic program from the hardware intended to execute it. Obviously, this situation does not lead to ecient execution. In this paper we investigate a di erent approach. We ....
....of these e orts are operationally incomplete (i.e. existing solutions might not be found due to in nite derivation paths) since they are based on Prolog s depth rst search mechanism. The same drawback also occurs in implementations of functional logic languages based on abstract machines (e.g. [11, 26, 29, 22]) since these abstract machines use backtracking to implement non determinism. An exception is the Curry2Java compiler [19] which is based on an abstract machine implementation in Java but uses independent threads to implement non deterministic choices. If these threads are fairly evaluated ....
[Article contains additional citation context not shown here]
W. Lux. Implementing encapsulated search for a lazy functional logic language. In Proc. 4th Fuji Intl. Symposium on Functional and Logic Programming (FLOPS '99), pages 100-113. Springer LNCS 1722, 1999.
Adding Linear Constrains over Real Numbers to Curry - Lux (2000) Self-citation (Lux) (Correct)
....reduce to True or False, resp. If neither the constraint nor its negation is entailed by the constraint store, the evaluation is delayed until enough constraints have been added to prove the entailment relation. 5 Implementation For the integration of linear constraints into our abstract machine [Lux99], we assume that the constraint solver implements an interface with the following functions ask : l cs fTrue; Falseg [ fUnknowng cs) tell : l cs (cs l ) clone : cs cs cs Here, l denotes a linear expression and cs denotes the state of the constraint store, which is a ....
W. Lux. Implementing encapsulated search for a lazy functional logic language. In Proc. FLOPS 99, pages 100-113. Springer LNCS 1722, 1999. 3 http://mozart.sip.ucm.es/incoming/toy.html 12
Programming with Narrowing - Sergio Antoy Computer (Correct)
No context found.
W. Lux. Implementing encapsulated search for a lazy functional logic language. In Proc. 4th Fuji Intl. Symposium on Functional and Logic Programming (FLOPS '99), pages 100--113. Springer LNCS 1722, 1999.
An Implementation of Narrowing Strategies - Antoy, Hanus, Massey, Steiner (2001) (Correct)
No context found.
W. Lux. Implementing encapsulated search for a lazy functional logic language. In Proc. 4th Fuji Intl. Symposium on Functional and Logic Programming (FLOPS '99), pages 100--113. Springer LNCS 1722, 1999.
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