Paul Tarau, Veronica Dahl  Home/Search
Context Related
| unh.edu/pub/csp/ar...ontinuations.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unh.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Continuation passing binarization and specialization of the WAM to binary logic programs have been proven practical implementation techniques in the BinProlog system. In this paper we investigate the additional benefits of having first order continuations at source level. We devise a convenient way to manipulate them by introducing multipleheaded clauses which give direct access to continuations at source-level. We discuss the connections with various logic grammars, give examples of typical... (Update)
Context of citations to this paper: More
.... Continuations play a central role in denotational semantics, but it can also be beneficial to have them at the source level [6] [23]. Brisset and Ridoux [6] extend the semantics of [18] to cover new built ins (for #Prolog) that explicitly manipulate success and failure...
.... play a central role in denotational semantics, it can also be beneficial to have first order continuations at the source level [BR93] [TD94]. BR93] extends the semantics of [NF89] to cover new built ins (for Prolog) that explicitly manipulate success and failure...
Cited by: More
A Rewriting Prolog Semantics - Kulas (2000) (Correct)
Defining Standard Prolog in Rewriting Logic - Kulas, Beierle (2000) (Correct)
Similar documents (at the sentence level):
9.3%: BinProlog 4.00 User Guide - Tarau (1995) (Correct)
9.3%: BinProlog 5.00 User Guide - Paul Tarau Departement (Correct)
8.7%: BinProlog 7.0 Professional Edition - Advanced BinProlog.. - Tarau (1999) (Correct)
Active bibliography (related documents): More All
0.6: On Delphi Lemmas And Other Memoing Techniques For.. - Tarau, De Bosschere.. (1997) (Correct)
0.5: Higher-Order Programming in an OR-intensive Style - Tarau, Demoen (Correct)
0.3: Assumption Grammars: Parsing as Hypothetical Reasoning - Veronica Dahl, Paul Tarau (Correct)
Similar documents based on text: More All
0.4: Controlling Virtual Worlds Through Extensible Natural Language - Rochefort, Dahl, Tarau (1997) (Correct)
0.3: Backtrackable State with Linear Affine Implication .. - Paul Tarau.. (1996) (Correct)
0.3: Backtrackable State with Linear Assumptions, Continuations and.. - Tarau, Dahl (Correct)
Related documents from co-citation: More All
2: Prolog: The Standard (context) - Deransart, Ed-Dbali et al. - 1996
2: stepwise development of operational and denotational semantics for Prolog (context) - Jones, Mycroft - 1984
2: A denotational semantics for Prolog (context) - Nicholson, Foo - 1989
BibTeX entry: (Update)
P. Tarau and V. Dahl. Logic programming and logic grammars with binarization and first-order continuations. In LOPSTR'94: 4th Int. Workshop on Logic Program Synthesis and Transformation, Pisa, volume 883 of LNCS. Springer-Verlag, 1994. 17 http://citeseer.ist.psu.edu/tarau94logic.html More
@incollection{ tarau94logic,
author = "Paul Tarau and Veronica Dahl",
title = "Logic Programming and Logic Grammars with First-Order Continuations",
booktitle = "Logic Programming Synthesis and Transformation, Meta-Programming in Logic: Fourth International Workshops, {LOBSTR}'94 and {META}'94, Pisa, Italy",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "Laurent Fribourg and Franco Turini",
pages = "215--230",
year = "1994",
url = "citeseer.ist.psu.edu/tarau94logic.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
346 Denotational Semantics: the Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
251 A logic programming language with lambda-abstraction - Miller - 1991
223 Linear objects: Logical processes with built-in inheritance - Andreoli, Pareschi - 1990
113 The design and analysis of parallel algorithms (context) - Akl - 1989
69 Higher-order extensions to Prolog -- are they needed (context) - Warren - 1981
58 Contextual logic programming (context) - Monteiro, Porto - 1989
53 Lexical scoping as universal quantification - Miller - 1989
47 Continuation-based program transformation strategies (context) - Wand - 1980
28 Un systeme de communication homme-machine en francais (context) - Colmerauer, Kanoui et al. - 1973
27 Metamorphosis Grammars (context) - Colmerauer - 1978
21 Elementary Logic Programs (context) - Tarau, Boyer - 1990
16 systems: from formalism to programming languages (context) - Prusinkiewicz, Hanan - 1992
13 Extending the semantics of logic programs to disjunctive log.. - Lobo, Minker et al. - 1989
10 American Journal for Computational Linguistics (context) - Pereira - 1981
10 Lisp and Symbolic Computation (context) - Wadler, composable - 1993
10 An alternative characterization of disjunctive logic program.. (context) - Reed, Loveland et al. - 1991
9 Program Transformations and WAM-support for the Compilation .. (context) - Tarau - 1992
9 ese, Universit (context) - Brisset, Th - 1992
6 Computational Intelligence (context) - Dahl - 1989
5 Comparative semantics for a parallel contextual logic progra.. (context) - Jacquet, Monteiro - 1990
5 Translating spanish into logic through logic - Dahl - 1981
4 Memoing with Abstract Answers and Delphi Lemmas (context) - Tarau, De Bosschere - 1993
3 electronic document: ftp sbcs (context) - Warren, System et al. - 1992
1 the relationship between context-dependent grammars and mult.. (context) - Maluszy'nski - 1994
1 A Relevance Logic Characterization of Static Discontinuity G.. (context) - Andrews, Dahl et al. - 1991
1 the definition of binarization in terms of fold/unfold (context) - Proietti - 1994
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.unh.edu.html): More
Csim - a Simple HP48 Circuit Simulator for Educational Purposes - Stenius (1992) (Correct)
Solving Geometric Constraint Systems - Kramer (1990) (Correct)
A Theorem-Proving Approach to Jobshop Scheduling - Toni (1994) (Correct)
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