I014 Functional Programming

Faculty of Informatics
Spring 2002
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Wed 17:00–19:50 D1
Prerequisites (in Czech)
I015 Intro to Func.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
Course objectives
The course gives an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1998, Spring 1999, Spring 2000, Spring 2001.

I014 Functional Programming

Faculty of Informatics
Spring 2001
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Tue 17:00–19:50 D1
Prerequisites (in Czech)
I015 Intro to Func.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
Course objectives
The gives an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF, denotational and operational semantics, full abstraction, parallel or.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1998, Spring 1999, Spring 2000, Spring 2002.

I014 Functional Programming

Faculty of Informatics
Spring 2000
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Prerequisites
I015 Intro to Func.Programming
Before enrolling this course the students should go through I015 Introduction to 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
  • The course should result in an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF, denotational and operational semantics, full abstraction, parallel or.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1998, Spring 1999, Spring 2001, Spring 2002.

I014 Functional Programming

Faculty of Informatics
Spring 1999
Extent and Intensity
3/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
Contact Person: RNDr. Libor Škarvada
Prerequisites
I015 Introduction to Functional Programming
Before enrolling this course the students should go through I015 Introduction to 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
  • The course should result in an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF, denotational and operational semantics, full abstraction, parallel or.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1998, Spring 2000, Spring 2001, Spring 2002.

I014 Functional Programming

Faculty of Informatics
Spring 1998
Extent and Intensity
3/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
Contact Person: RNDr. Libor Škarvada
Prerequisites
I015 Introduction to Functional Programming
Before enrolling this course the students should go through I015 Introduction to 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
  • The course should result in an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF, denotational and operational semantics, full abstraction, parallel or.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Language of instruction
Czech
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1999, Spring 2000, Spring 2001, Spring 2002.

I014 Functional Programming

Faculty of Informatics
Spring 1997
Extent and Intensity
3/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
Contact Person: RNDr. Libor Škarvada
Prerequisites
Before enrolling this course the students should go through I015 Introduction to 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
  • The course should result in an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF, denotational and operational semantics, full abstraction, parallel or.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Language of instruction
Czech
The course is also listed under the following terms Spring 1996, Spring 1998, Spring 1999, Spring 2000, Spring 2001, Spring 2002.

I014 Functional Programming

Faculty of Informatics
Spring 1996
Extent and Intensity
0/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
Contact Person: RNDr. Libor Škarvada
Prerequisites
Before enrolling this course the students should go through I015 Introduction to 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
  • The course should result in an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF, denotational and operational semantics, full abstraction, parallel or.
  • Types, typing.
  • Polymorphism, predicative and impredicative type systems.
  • Type classes and constructor classes. Subtyping, type systems for OOP.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type IO.
  • Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Language of instruction
Czech
The course is also listed under the following terms Spring 1997, Spring 1998, Spring 1999, Spring 2000, Spring 2001, Spring 2002.
  • Enrolment Statistics (recent)