Handling function definitions through innermost superposition and rewriting-Reference-Cited by-同舟云学术

Handling function definitions through innermost superposition and rewriting

Published:1985 Issue: Volume: Page:325-344
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Fribourg Laurent

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-15976-2_16.pdf

Reference36 articles.

1. Abramson, H., "A Prological Definition of HASL, a Purely Functional Language with Unification Based Conditional Binding Expressions" New Generation Computing 2:1, pp. 3–35, 1984.

2. Aida, H., Tanaka, H. & Moto-oka, T., "A Prolog Extension for Handling Negative Knowledge", New Generation Computing 1:1, pp. 87–91, 1983.

3. Research Report;J Bergstra,1982

4. Bidoit,M. & Choquer,M.A., "Preuves de Formules Conditionnelles par Recurrence", Proc. AFCET IA, Grenoble, Nov. 1985.

5. Bouge, L., Choquet, N., Fribourg, L. & Gaudel, M.C.G., "Application of Prolog to Test Sets Generation from Algebraic Specifications", Coll. on Software Engineering, LNCS 186, pp.261–275, March 1985.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Detecting redundant narrowing derivations by the LSE-SL reducibility test;Rewriting Techniques and Applications;1991

2. The design and specification of the ASSPEGIQUE database;Design and Implementation of Symbolic Computation Systems;1990

3. Integrating logic and functional programming;Lisp and Symbolic Computation;1989-02

4. The Passau RAP system: Rapid prototyping for algebraic specifications;Conditional Term Rewriting Systems;1988

5. Narrowing with built-in theories;Algebraic and Logic Programming;1988