Term Rewriting Systems

 
Course code:
XM_400121
Period:
Period 4
Credits:
6.0
Language of tuition:
English
Faculty:
Faculty of Science
Coordinator:
drs. J. Endrullis
Examinator:
drs. J. Endrullis
Lecturers:
drs. J. Endrullis
Teaching method(s):
Lecture, Seminar
Level:
400

Course objective

Learning the fundamental notions of term rewriting and getting
acquainted with some more advanced topics in the field.

Course content

Term rewriting systems (TRSs) provide for a natural formalism for
specifying rules of computation and investigating their properties. TRSs
are of basic importance for functional programming and for the
implementation of abstract data types. Applications can also be found in
theorem proving, proof checking and logic programming. Some topics that
will be covered in the course are:
- abstract reduction systems
- term rewriting
- combinatory logic
- termination (rpo's, monotone algebras)
- confluence, critical pairs, orthogonality
- Knuth-Bendix completion
- strategies
- modularity
- decidability issues
- infinitary rewriting

Form of tuition

Lectures and practice sessions

Type of assessment

Written examination

Course reading

Course notes will be provided

Target audience

mCS, mPDCS, mAI, mMath

© Copyright VU University Amsterdam
asnDCcreatorasvVUAmsterdam asnDCdateasv2018 asnstudyguideasvmodule asnDCidentifierasv50049475 asnDCtitleasvTermRewritingSystems asnperiodasv140 asnperiodasv asncreditsasv6p0 asnvoertaalasvE asnfacultyasv50013925 asnDCcoverageasvdrsJEndrullis