Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51-65, Portland, Oregon, December 1995. MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....programming. Our formulation follows the judgmental presentation of Pfenning and Davies [PD01] which completely avoids the need for commuting conversions, but the latter treats neither linearity nor the existence of normal forms. The exploration of monads in logic programming by Bekkers and Tarau [BT95] concentrates on the use of monads for data structures and all solution predicate. This is quite di erent from our application and concerned neither with additional logical connectives nor a true extension of the operational semantics. Benton and Wadler [BW96] explore the relationship of Moggi s ....

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51-65, Portland, Oregon, December 1995. MIT Press.

....programming. Our formulation follows the judgmental presentation of Pfenning and Davies [PD01] which completely avoids the need for commuting conversions, but the latter treats neither linearity nor the existence of normal forms. The exploration of monads in logic programming by Bekkers and Tarau [BT95] concentrates on the use of monads for data structures and all solution predicate. This is quite di#erent from our application and concerned neither with additional logical connectives nor a true extension of the operational semantics. Benton and Wadler [BW96] explore the relationship of Moggi s ....

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51--65, Portland, Oregon, December 1995. MIT Press.

.... Special techniques have been developed to overcome this handicap and to improve the memory usage, both for logic programming languages [10, 14, 18] and functional languages [21, 16] Some of the approaches depend on a combination of special language constructs and analyses using unique objects [19, 1, 22], some are solely based on compiler analyses [13, 16] and others combine it with special memory layout techniques [21] In this work we develop a purely analysis based memory management system. Mercury, a modern logic programming language with declarations [19] pro les itself as a general ....

Y. Bekkers and P. Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 51-65, Cambridge, Dec. 4-7 1995. MIT Press.

.... of backtracking of sequential Prolog in various papers [11, 12, 5] More recently, the list monad has been used for describing the semantics of Prolog s clause unfolding and the advantages of adopting monads in the higher order logic programming framework of Prolog have been investigated [3]. Our continuation based approach to the semantics of parallelism in logic programming seems to be new. All papers known to us (including [5, 6, 7, 8, 9] follow the classic (direct) approach to concurrency, where the semantic designer de nes the various operators for parallel composition on ....

Y. Bekkers and P. Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of ILSP'95, pages 51-65, Portland, OR, Dec. 1995. MIT Press.

.... techniques have been developed to overcome this handicap and to improve the memory usage, both for logic programming languages [4, 13, 20] as for functional languages [11, 23, 17] Some of the approaches depend on a combination of special language constructs and analysis using unique objects [21, 1, 24], some are solely based on compiler analyses [7, 12, 18, 10] and others combine it with special memory layout techniques [23] In this work we develop a purely analysis based memory management system. Mercury, a modern logic programming language with declarations [21] pro les itself as a general ....

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 51-65, Cambridge, December 4-7 1995. MIT Press.

....It required quite some time until the relations between several concepts that might be applicable became clear. Although knowledge of work concerning handling of side e ects in purely functional languages 8 was available from the start of the project, the linking idea appeared after having read [BT95] this paper shows that even logic languages as expressive as LambdaProlog can strongly bene t from a speci c construct whose introduction to functional languages has opened new ways of programming: monads. 8 The reader may nd it very bene cial to read [Wad92] and further papers like [JW93] ....

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 51-65, Cambridge, December 4-7 1995. MIT Press.

.... one) There has been a lot of research on methods to overcome this handicap and improve the memory management, both for logic programming languages [5, 12, 14] as for functional programming languages [10, 19] Some approaches depend on a combination of special language constructs and analysis [17, 1, 21], others are solely based on compiler analyses [7, 11, 20] At least in logic programming, none of the analysis based methods has reached the maturity of becoming part of a widely distributed implementation, so this largely remains an unsolved problem. A language as Mercury, a logic language with ....

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 51-65, Cambridge, December 4-7 1995. MIT Press.

.... this problem 2 Nancy Mazur et al. within single assignment languages, in the context of logic programming languages [6,11,13] as well as functional programming languages [2,9,17,18] Some of the approaches involve special language constructs (such as uniqueness declarations within Mercury) [1,15,21,22], others are based on compiler analyses [7,10] Mulkers et al. 14] have developed such an analysis for Prolog, however, the lack of declarations and the impurity of Prolog make it dicult to integrate the analysis in a Prolog compiler. In [4] Bruynooghe et al. have adapted the analysis for a ....

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 51-65, Cambridge, December 4-7 1995. MIT Press.

....here is that the analyses are complex and potentially expensive. Moreover, the analysis results tend to be fragile, and the performance characteristics of the resulting code can be difficult for programmers to predict. 3. One can resort to special purpose programming constructs, such as monads [3, 24, 25], or uniqueness declarations [22] This can work well if one is writing fresh code in a new language, but it is not straightforward to integrate this with pre existing code (the dusty decks problem) Unfortunately, it is not always straightforward or practical to rewrite a large volume of ....

....[27] A very different approach to the aggregate update problem involves the development of language constructs aimed specifically at supporting a style of programming that allows the compiler to determine, without excessive effort, updates that can be implemented destructively. The work on monads [3, 24, 25] falls into this category, as does the unique declarations of Mercury [22] As mentioned in Section 1, this can work well if one is writing fresh code in a new language, but it is not straightforward to integrate this with pre existing code (the dusty decks problem) 7 Conclusions ....

Y. Bekkers and P. Tarau, "Monadic Constructs for Logic Programming", Proc. International Symposium on Logic Programming, 1995. The MIT Press.

....interoperation of declarative languages with conventional software and operating system services which often relay on stateful entities. Through constructs ranging from plain file or socket streams in C, to lazy list streams in languages like Scheme, iterators in Java or C , monadic constructs [15, 28, 29, 3] in Haskell or in Prolog, declarative I O in Mercury [20] the need for abstracting away the nature of the stepping process in a (finite or infinite, actual or generated as needed) sequence. Moreover, in the case of a declarative language implmented in a procedural or object oriented language, a ....

Yves Bekkers and Paul Tarau. Monadic Constructs for Logic Programming. In John Lloyd, editor, Proceedings of ILPS'95, pages 51--65, Portland, Oregon, December 1995. MIT Press. 14

No context found.

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51-65, Portland, Oregon, December 1995. MIT Press.

No context found.

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51--65, Portland, Oregon, December 1995. MIT Press.

No context found.

Y. Bekkers and P. Tarau. Monadic constructs for logic programming. In J.Lloyd, editor, Proceedings of the International Symposium on Logic Programming (ILPS'95), pages 51--65, Portland, Oregon, Dec. 1995. MIT Press.

No context found.

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51--65, Portland, Oregon, December 1995. MIT Press.

No context found.

Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 51--65, Cambridge, December 4--7 1995. MIT Press.

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