A Higher Order Reconstruction of Stepwise Enhancement [chapter]

Lee Naish, Leon Sterling
1998 Lecture Notes in Computer Science  
EXTENDED ABSTRACT Motivation In the last couple of years, there has been renewed interest in systematic methods for the construction of This paper loosely characterises the progression of approaches that have been offered for systematic construction of logic (usually Prolog) programs. There is a trade-off between what is accessible for practical programmers and what is clearly explained in theory. We claim that both audiences can be addressed through stepwise enhancement. The method can be
more » ... ined directly in term of programming techniques applied to simple programs, and also given a solid theoretical founding in terms of higher order functions. We review stepwise enhancement, sketch how to capture an enhancement as a higher order function adapted from foldr, and then sketch how individual enhancements are specializations of the particular foldr predicate. Our work generalises some of the new ideas on shape and shape grammars being discussed in the functional programming community (Jay and Cockett, 1994), (Bellé et al., 1996) . What are the approaches to developing Prolog programs?
doi:10.1007/3-540-49674-2_13 fatcat:wbezgfhz65c6hg6dtlnx65pjnm