||This article uses bare URLs for citations, which may be threatened by link rot. (June 2013)|
|Designed by||Paulo Moura|
|Stable release||2.44.1 / May 28, 2012|
|Preview release||3.00.0 Release Candidate 6 / November 19, 2014|
|Influenced by||Prolog, Smalltalk, Objective-C; logic programming, object-oriented programming, prototype-based programming|
|License||Artistic License 2.0 (2.x) / GNU GPL v3 (3.x)|
Logtalk is an object-oriented logic programming language that extends and leverages the Prolog language with a feature set suitable for programming in the large. It provides support for encapsulation and data hiding, separation of concerns and enhanced code reuse. Logtalk uses standard Prolog syntax with the addition of a few operators and directives.
Logtalk aims to bring together the advantages of object-oriented programming and logic programming. Object-orientation emphasizes developing discrete, reusable units of software, while logic programming emphasizes representing the knowledge of each object in a declarative way.
As an object-oriented programming language, Logtalk's major features include support for both classes (with optional metaclasses) and prototypes, parametric objects, protocols (interfaces), categories (mixins, aspects, hot patching), multiple inheritance, public/protected/private inheritance, event-driven programming, high-level multi-threading programming, reflection, and automatic generation of documentation.
For Prolog programmers, Logtalk provides wide portability, featuring predicate namespaces (supporting both static and dynamic objects), public/protected/private object predicates, coinductive predicates, separation between interface and implementation, simple and intuitive meta-predicate semantics, lambda expressions, definite clause grammars, term-expansion mechanism, and conditional compilation. It also provides a module system based on de facto standard core module functionality (internally, modules are compiled as prototypes).
Logtalk's syntax is based on Prolog:
?- write('Hello world'), nl. Hello world true.
Defining an object:
:- object(my_first_object). :- initialization((write('Hello world'), nl)). :- public(p1/0). p1 :- write('This is a public predicate'), nl. :- private(p2/0). p2 :- write('This is a private predicate'), nl. :- end_object.
Using the object, assuming is saved in a my_first_object.lgt file:
?- logtalk_load(my_first_object). Hello world true. ?- my_first_object::p1. This is a public predicate true.
Trying to access the private predicate gives an error:
?- my_first_object::p2. ERROR: error(permission_error(access, private_predicate, p2), my_first_object::p2, user)
Prolog back-end compatibility
As of October 2011, supported back-end Prolog compilers include B-Prolog, CxProlog, ECLiPSe, GNU Prolog, LeanProlog, Qu-Prolog, SICStus Prolog, SWI-Prolog, XSB, and YAP Prolog. Logtalk allows seamless use of most back-end Prolog compiler libraries from within object and categories.
Logtalk features on-line help, a documenting tool (that can generate PDF and HTML files), an entity diagram generator tool, a built-in debugger (based on an extended version of the traditional Procedure Box model found on most Prolog compilers), a unit test framework with code coverage analysis, and is also compatible with selected back-end Prolog profilers and graphical tracers.
Logtalk has been used to process STEP data models used to exchange product manufacturing information. It has also been used to implement a reasoning system that allows preference reasoning and constraint solving.
- Paulo Moura (2003). Logtalk: Design of an Object-Oriented Logic Programming Language. PhD thesis. Universidade da Beira Interior
- "Logtalk compatibility". Logtalk.org. 2013-02-10. Retrieved 2013-08-19.
- / (2013-02-12). "Developer Tools 路 LogtalkDotOrg/logtalk3 Wiki 路 GitHub". Github.com. Retrieved 2013-08-19.
- Victor Noël; Antonis Kakas (2009). "Gorgias-C: Extending Argumentation with Constraint Solving". Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science 5753. pp. 535–541. doi:10.1007/978-3-642-04238-6_54.