(Prolog) For

A for-loop can be achieved by letting backtracking fail.

PREDICATES
  nondeterm name(symbol)
  printNames
	
CLAUSES
  name("Leonardo").
  name("Donnatello").
  name("Michelangelo").
  name("Rafael").
  
  printNames :-
    name(X),
    write(X),
    nl,
    fail.
    
  printNames.
	
GOAL
  printNames.

'for' links

Code links

last edited (October 24, 2006) by bilderbikkel, Number of views: 955, Current Rev: 2 (Diff)

[Edit this page] [Page history] [What links here] [Discuss this topic] [Printer Friendly]

HELP
FAQ

Undefined Pages
Orphan Pages
Latest Pages
Notifications
Top Users

Contact Us
Link To Us

Programmers Heaven - for .NET, Java, C/C++ and WEB Developers!

© 1996-2008 Community Networks Ltd. All rights reserved. Reproduction in whole or in part, in any form or medium without express written permission is prohibited. Violators of this policy may be subject to legal action. Please read Terms Of Use and Privacy Statement for more information. Development by Tore Nestenius at .NET Consultant - Synchron Data.