Prolog (short for "Programming Logic") is a declarative and logic based programming language developed in 1972 by Alain Colmerauer and Philippe Roussel. It has many applications, most notably in Artificial Intelligence for its pattern matching abilities over natural language parse trees.
Prolog is written in "facts" and "rules" that define logical formulas, similar to functional programs. Learning Prolog is a great way to improve skills with recursion, predicate logic, and constraint logic programming.
Join the Prolog track
append([], L, L).
append([H|T], L2, [H|L3]) :- append(T, L2, L3).
?- appendx([1,2],[3,4],X).
X = [1, 2, 3, 4].
?- appendx([1,2],X,[1,2,3,4]).
X = [3, 4].
?- appendx(X,[3,4],[1,2,3,4]).
X = [1, 2].
What I like about it is that I am able to solve the challenges in a TDD way working in a environment that I am familiar (my own PC not a browser IDE) and the cherry on the top of the cake is that I have access to code reviews.
Once you join the Prolog language track, you will receive support and feedback from our team of mentors. Here are the bios of a few of the mentors of this track.
These are a few of the 16 exercises on the Prolog track. You can see all the exercises here.
The Prolog Maintainers are the brains behind the Prolog Track. They spend their spare time creating interesting and challenging exercises that we can all learn from. We are incredibly grateful for their hard work. Here are the bios of a few of the maintainers of this track.