A method for removing unused arguments from logic programs
暂无分享,去创建一个
[1] Emmanouil I. Marakakis. Guided Correctness Proofs of Logic Programs , 2005, Artificial Intelligence and Applications.
[2] Alberto Pettorossi,et al. Rules and strategies for transforming functional and logic programs , 1996, CSUR.
[3] John Darlington,et al. A semantic approach to automatic program improvement , 1972 .
[4] John P. Gallagher,et al. Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types , 1994, LOPSTR.
[5] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.
[6] Alberto Pettorossi,et al. Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs , 1999, J. Log. Program..
[7] John P. Gallagher,et al. Logic Program Specialisation With Deletion of Useless Clauses , 1993, ILPS.
[8] Hisao Tamaki,et al. Unfold/Fold Transformation of Logic Programs , 1984, ICLP.
[9] Εμμανουηλ Μαρακακησ. LOGIC PROGRAM DEVELOPMENT BASED ON TYPED,MODED SCHEMATA AND DATA TYPES , 1997 .
[10] John W. Lloyd,et al. The Gödel programming language , 1994 .
[11] Alberto Pettorossi,et al. Transformation of Logic Programs , 1994 .
[12] Jan-Willem Romeijn. European Summer School on Logic, Language, and Information , 2008 .
[13] John P. Gallagher,et al. Transforming Logic Programs by Specialising Interpreters , 1986, ECAI.
[14] Jan Komorowski,et al. Towards a Programming Methodology Founded on Partial Deduction , 1990, ECAI.