H ? « ‹ ← → › »

Language peer sets for CLAIRE:
France↑
France/1996↑
Designed 1996 ↑
1990s languages ↑
Fifth generation↑
Post-Cold War↑

CLAIRE(ID:1902/cla001)

alternate simple view
Country: France
Designed 1996

is a high-level functional and OOL with advanced rule processing capabilities. It is intended to allow the programmer to express complex algorithms with fewer lines and in an elegant readable form. Parametric classes and methods, OO logic with set extensions, dynamic versioning that supports easy exploration of search spaces, very rich type system including type intervals and second-order types (with dual static/dynamic typing). Set-based with an intuitive syntax, simple OOP, truly polymorphic and parametric programming, powerful yet readable extensions of DATALOG to express logic conditions.  Has a complete system with compiler, interpreter, tools - tracer, debugger, and object inspector.

Structures:
Related languages
DATALOG → CLAIRE   Extension of
LAURE → CLAIRE   Augmentation of
References:
  • Caseau, Y. and Laburthe, F. (1996) Caseau, Y. and Laburthe, F. "Introduction to the CLAIRE programming language" Tech. rep., Departement Mathematiques et Informatique, Ecole Normale Superieure, Paris, France.
  • Caseau, Y.; Laburthe, F. (1996) Caseau, Y.; Laburthe, F. "CLAIRE : a brief overview", Working paper, LIENS, 1996. Abstract Online copy
  • Caseau, Yves and Laburthe, Francois (1996) Caseau, Yves and Laburthe, Francois "CLAIRE: Combining objects and rules for problem solving" Abstract Online copy
          in Proceedings of the JICSLP'96 workshop on multi-par (1996) Proceedings of the JICSLP'96 workshop on multi-paradigm logic programming. TU Berlin, 1996
  • Caseau, Y.; Josset, F.-X.; Laburthe, F. (1999) Caseau, Y.; Josset, F.-X.; Laburthe, F. "CLAIRE : Combining Sets, Search and Rules to Better Express Algorithms" Abstract Online copy
          in (1999) ICLP 1999
  • Caseau, Yves; Josset, François-Xavier; Laburthe, F (2002) Caseau, Yves; Josset, François-Xavier; Laburthe, François "CLAIRE: Combining sets, search and rules to better express algorithms" pp769-805
          in (2002) Theory and Practice of Logic Programming (TPLP) 2(6)
    Search in: Google  Google scholar  World Cat  Yahoo  Overture  DBLP  Monash bib  NZ  IEEE  ACM portal  CiteSeer  CSB  ncstrl  jstor  Bookfinder