Automated generalisation of function definitions

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

Volumn 1722, Issue , 1999, Pages 225-240

  Bakewell, Adam ^a   Runciman, Colin ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING;

FIRST ORDER; FUNCTION DEFINITIONS; GENERALISATION; HASKELL; HIGHER-ORDER LANGUAGES; REWRITE SYSTEMS; SPECIALISATION;

COMPUTER CIRCUITS;

EID: 84957709757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_15     Document Type: Conference Paper

References (16)

1. F Baader. Unification, weak unification, upper bound, lower bound, and generalization problems. Lecture Notes in Computer Science, 488:86-97, 1991. 230, 237
2. H P Barendregt. The Lambda Calculus: its syntax and semantics. Elsevier Science Publishers BV, 1984. 229
3. N Dershowitz. Termination of rewriting. J. Sym. Comp., 3(1 2):69-116, 1987. 229
4. N Dershowitz and J P Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 243-320. Elsevier, 1990. 230
5. J Peterson et al. Haskell 1.4: A Non-Strict, Purely Functional Language, 1997. 226, 229
6. A I Furtado. Analogy by generalization — and the quest for the grail. ACM SIGPLAN Notices, 27 (1):105-113, January 1992. 238
7. M Hagiya. Synthesis of rewrite programs by higher-order unification and semantic unification. New Generation Computing, 8(4):403-420, 1991. 236
8. G P Huet. A unification algorithm for typed A-calculus. Theor. Comp. Sci, 1:27-57, 1975. 237
9. N D Jones, C K Gomard, and P Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, 1993.
10. K Knight. Unification: A multidisciplinary survey. ACM Computing Surveys, 21(1):93-124, March 1989. 231
11. C D Page and A M Frisch. Inductive Logic Programming, chapter 2: Generalization and Learnability: A Study of Constrained Atoms. London Academic Press, 1992. 237
12. G D Plotkin. A note on inductive generalization. In B Meltzer and D Mitchie, editors, Machine Intelligence 5, pages 153-163. Edinburgh University Press, 1969. 226, 235, 236
13. J C Reynolds. Transformational systems and the algebraic structure of atomic formulas. In B Meltzer and D Mitchie, editors, Machine Intelligence 5, pages 135-151. Edinburgh University Press, 1970. 226, 236
14. C Runciman and I Toyn. Retrieving reusable software components by polymorphic type. Journal of Functional Programming, 1(2):191-211, 1991. 236
15. M E Stickel. A unification algorithm for associative-commutative functions. JACM, 28 (3):423-434, July 1981. 237
16. P D Summers. A methodology for lisp program construction from examples. JACM, 24 (1):161-175, 1977. 236