Computer Science › Section G · Programming languages › Topic G.7
Declarative programming
What if you could describe a problem precisely and let the computer work out how to solve it? Declarative programming does exactly that, and its logic-based form shows how a machine can draw conclusions from facts by pure reasoning.
In this topic
- Saying what, not how
- Declarative languages you may already know
- Logic and the resolution rule
- Proof by finding a contradiction
- Worked example: a proof by resolution
- Unification
- Prolog: facts and rules
- Asking Prolog questions
- Worked example: tracing a recursive query
- Functional programming: a close relative
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…