Navajeni smo, da ko programiramo, opisujemo algoritme. Toda, ali je nujno, da je program vedno opis algoritma?

Pri tem predmetu bomo spoznali , da lahko programiramo tudi na druge načine, ne samo algoritmično. Na primer tako, da računalniku opišemo le, kaj je problem. Računalnik pa sam poišče postopek, ki privede do rešitve. To omogočajo deklarativni programski jeziki, ki temeljijo na uporabi logike ali omejitev. Programirati je možno celo kar s primeri. Računalniku na primer pokažemo nekaj primerov sortiranih seznamov, računalnik pa sam sestavi program za sortiranje. Obstajajo še druge paradigme programiranja, ki vodijo do korenito drugačnih načinov razmišljanja o programih, kot smo vajeni.

Spoznali bomo tudi, kako definiramo sintakso in semantiko, to je pomen programskega jezika. Pokazali bomo, kako lahko z DCG gramatiko napišemo prevajalnik za enostaven programski jezik v manj kot 50 vrsticah. Pa tudi, kako matematično dokažemo pravilnost programa.

     In this course we learn that programming
can be done in other ways -- other than algorithmically. For example, we may
just describe what the problem is. The computer then on its own automatically finds
a procedure that leads to a solution. This style of programming is done
with declarative programming languages based on logic or constraints. It is
even possible to program just by examples. For instance, we give the computer
examples of sorted lists, and the computer automatically puts together a
general program for sorting lists. There are yet other programming paradigms
that lead to radically different thinking about programs than we are used to.

     In this course we also learn how the
syntax and semantics, that is the meaning, of a programming language can be
defined. We show how an interpreter or a compiler for a simple programming language can be written with DCG grammars in less than 50 lines. And further, how we can mathematically prove the correctness of a
program.