Architecture of Symbolic Computers

Course guarantor:

Neurčen

Lecturer:

Tutor:

Supervisor:

Department of Computer Science

Synopsis:

Symbolic expressions and abstract programs, lambda calculus, formal basis for abstract programming, self-interpretation, SECD abstract machine, memory management, demand-driven evaluation, Lisp implementations, predicate logic and its inference engine, Prolog inference engine and dynamic algebras, Warren abstract machine, optimisation, Prolog implementations, parallel inference engines.

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

1. Peter M. Kogge: The Architecture of Symbolic Computers. McGraw-Hill,

Inc.1990, New York, NY, USA ISBN:0070355967

2. Gopal Gupta, et al.: Parallel execution of prolog programs: a survey.

July 2001, ACM Transactions on Programming Languages and Systems

(TOPLAS), Volume 23 Issue 4

3. L.C.Paulson: Foundations of Functional Programming.

http://www.cl.cam.ac.uk/users/lcp/papers/Notes/Founds-FP.pdf

Note:

Time-table for winter semester 2024/2025:

Time-table is not available yet

Time-table for summer semester 2024/2025:

Time-table is not available yet

The course is a part of the following study plans:

• Doctoral studies, daily studies (compulsory elective course)
• Doctoral studies, combined studies (compulsory elective course)
• Doctoral studies, structured daily studies (compulsory elective course)
• Doctoral studies, structured combined studies (compulsory elective course)