I027 Systémy na prepisovanie termov

Faculty of Informatics
Autumn 1995
Extent and Intensity
0/0. 2 credit(s). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
Igor Prívara (lecturer)
Prerequisites
Prerequisites M009 Algebra II and I008 Computational Logic; recommended I013 Logic Programming I and I014 Functional Programming.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Term rewriting is a simple computational model for equational theories. Therefore, it is important for many different applications based on equational reasoning, e.g. computational logic, program specifications and verification, symbolic algebraic computations, etc.
  • Equational theories.
  • Unification problems.
  • Term rewriting.
  • Completion procedure.
  • Generalized term rewriting.
  • Modular term rewriting.
  • Theorem proving.
  • Functional and logic programming.
  • Equational programming.
  • Proving properties of algebraic specifications.
Language of instruction
Czech

  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn1995/I027