Course Code: L.EIC024
Acronym: PFL
- Acquire familiarity with the paradigms of Functional Programming and Logic Programming.
- Develop abstract reasoning and problem representation skills in a declarative way.
- Use predefined and algebraic Haskell types to represent values from a specific domain
- Define generic transformations over inductive data structures (eg trees) as polymorphic functions in Haskell
- Decompose programming problems into pure functions in Haskell operating on structured data types
- Prove program correctness in Haskell using definitions with equations and induction
- Representing facts and relationships as programs in Prolog
- Understand the model of running programs in Prolog
- Model search problems as logic programs and queries in Prolog
Title | ||
GUI | ❌ Not Available | |
Tools used | Haskell | Sicstus Prolog |
Brief Description | Data types have a maximum range limit, in Haskell "Int" has a range of [-2^29 .. 2^29-1]. Big Numbers provides infinite range representation, and also providing with basic arithmetic operations (+, -, *, /). (Warning: Arit. operations between large numbers will be slow) |
Strategy game developed using Prolog. More details 👉 Here Sit back and enjoy! :) |
Code links | 👉 BigNumbers | 👉 Taktikus |
More Detail: Sigarra