A Plan based Approach to Prolo g Recursio n Jan Newmarc h Information Science and Engineerin g University of Canberr a Australi a Preface This paper discusses the learning of Prolog recursion, and shows ho w it is made easier by adopting a plan based approach . Many common Prolog examples are shown to be derivable from simple plans . Thes e plans form an inheritance hierarchy, and this is also discussed . Introductio n Learners of any programming language often have problems learnin g the basic techniques appropriate to that language . One of the principa l problems in learning a language such as Prolog is the heavy relianc e in the language upon a single technique, recursion [2,3,61 . Thi s causes difficulties even to those who have already learnt many of th e programming techniques appropriate to a language such as Pascal , because they cannot see how to translate their knowledge of, say, ho w to sum the elements of an array into the Prolog recursiv e environment . Much work has been done in the imperative languages on how t o devise "programming plans" to give high level guidance to peopl e trying
End of preview. The entire article is 7 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-plan-based-approach-to-prolog-recursion-wbVJtZe3XJ
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A plan-based approach to Prolog recursion
Newmarch, Jan
Follow ACM SIGCSE Bulletin
, Volume 25 (2)
Association for Computing Machinery – Jun 1, 1993
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
