SAL Home PROGRAM Languages & Compilers


The principal goal of designing NCL is to provide programmers with a constraint language, which is fast to learn and easy to use, for declaratively solving a large scope of combinatorial problems. NCL combines Boolean logic, integer constraints and set reasoning over finite domains. Concering its syntax, NCL fully adopts mathematical notations. Compared to some other modeling languages, one of NCL's features is: Though NCL handles several data types such as Boolean, integer, set, index, array, tuple and reference, there is no need to separate data from a problem model. Concerning constraint handling capability, logical and meta controls such as quantification, search strategy, logical switch, multi-criteria optimization, and meta expression are introduced in a natural and flexible fashion.

Current Version:   1.2

License Type:   ??

Home Site:

Source Code Availability:   ??

Available Binary Packages:

  • Debian Package:   No
  • RedHat RPM Package:   No
  • Other Packages:   Yes (.tar.gz from Home Site)

Targeted Platforms:

SunOS, Linux

Software/Hardware Requirements:


Other Links:

Mailing Lists/USENET News Groups:


User Comments:

  • None

See A Screen Shot? (Not Yet)

  SAL Home   |   Programming   |   Languages & Compilers

Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.