15-317 Constructive Logic
Lecture 14: Prolog

In this lecture we dig deeper into programming in Prolog. Along the way we learn about some conveniences and inconveniences of this particular logic programming language.

  • Reading: 14-prolog.pdf
  • Key concepts:
    • Lists
    • Type predicates
    • List types
    • Disequality
    • Quicksort
    • Conditionals
    • Cut
    • Negation as failure
    • Prolog arithmetic
  • Previous lecture: Logic Programming
  • Next lecture:

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning