Backtrackable state with linear affine implication and assumption grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1179, Issue , 1996, Pages 53-63

  Tarau, Paul ^a   Dahl, Veronica ^b   Fall, Andrew ^b  

^a UNIVERSITÉ DE MONCTON   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; LOGIC PROGRAMMING; NETWORK SECURITY; PROLOG (PROGRAMMING LANGUAGE);

DETERMINISTIC EXECUTION; FULLY INTEGRATED; GLOBAL VARIABLES; IN-PLACE UPDATE; META-INTERPRETERS; MULTIPLE STREAMS; PREPROCESSING TECHNIQUES; STATE INFORMATION;

FUNCTIONAL PROGRAMMING;

EID: 84947921943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0027779     Document Type: Conference Paper

References (14)

1. H. Baker. Lively linear lisp-'look ma, no garbage!'. ACM Sigplan Notices, 27(8):89-98, August 1992.
2. Andrew Fall, Paul Tarau, and Veronica Dahl. Natural Language Process¬ing with Hypothetical Assumption Grammars and Sparse Term Taxonomies. Technical Report 95-3, Departement d'Informatique, Universite de Moncton, April 1995. Available by ftp from clement.info.urnoncton.cα.
3. J.-Y. Girard. Linear logic. Theoretical Computer Science, (50):1-102, 1987.
4. Joshua S. Hodas and Dale Miller. Logic Programming in a Fragment of Intu-itionistic Linear logic. Journal of Information and Computation, 110(2):327-365, May 1994.
5. J. Hodas. Specifying Filler-Gap Dependency Parsers in a Linear-Logic Pro-gramming Language. In: Krzysztof Apt, editor, Logic Programming Proceedings of the Joint International Conference and Symposium on Logic programming, pages 622-636, Cambridge, Massachusetts London, England, 1992. MIT Press.
6. Joshua S. Hodas. Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation. PhD thesis, University of Pennsylvania, Depart¬ment of Computer and Information Science, May 1994. Available as University of Pennsylvania Technical Reports MS-CIS-92-28 or LINC LAB 269.
7. A. P. Kopylov. Decidability of linear affine logic. In: Proceedings, Tenth An¬nual IEEE Symposium on Logic in Computer Science, pages 496-504, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
8. Paul Tarau. BinProlog 5.00 User Guide. Technical Report 96-1, Departement d'Informatique, Universite de Moncton, April 1996. Available from http://clement.info.umoncton.ca/BinProlog.
9. Paul Tarau and Michel Boyer. Prolog Meta-Programming with Soft Databases. In: Harvey Abramson and M.H. Rogers, editors, Meta-Programming in Logic Programming, pages 365-382. MIT Press, 1989.
10. Paul Tarau, Veronica Dahl, and Andrew Fall. Backtrackable State with Lin¬ear Assumptions, Continuations and Hidden Accumulator Grammars. Tech¬nical Report 95-2, Departement d'Informatique, Universite de Moncton, April 1995. Available by ftp from clement.info.urnoncton.cα.
11. Peter Van Roy. A useful extension to Prolog's Definite Clause Grammar notation. SIGPLAN notices, 24(11):132-134, November 1989.
12. P. Wadler. Is there a use for linear logic? ACM/IFIP PEPM Symposium, June 1991.
13. Philip Wadler. The essence of functional programming. In ACM Symposium POPL'92, pages 1-15. ACM Press, 1992.
14. Michael Winikoff and James Harland. Implementing the linear logic program¬ming language Lygon. In John Lloyd, editor, International Logic Programming Symposium, pages 66-80, Portland, Oregon, December 1995. MIT Press.