https://ocw.cs.pub.ro/ppcarte/ 2026-05-14T20:16:07+03:00 https://ocw.cs.pub.ro/ppcarte/ https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico text/html 2025-03-02T22:21:36+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l01&rev=1740946896&do=diff Lab 1. Introduction to Scala Objectives: * get yourself familiar with Scala syntax basics * practice writing tail-recursive functions as an alternative to imperative loops * keep your code clean and well-structured. Create a new Scala worksheet to write your solutions $ n$$ 1 + 2^2 + 3^2 + \ldots + (n-1)^2 + n^2$$ x$$ x_0, x_1, \ldots, x_n$$ (\ldots((x - x_0) - x_1) - \ldots x_n)$$ x$$ x_0, x_1, \ldots, x_n$$ x_0 - (x_1 - \ldots - (x_n - x)\ldots)$$ \sqrt{a}$$ x_0 = 1$$ x_{n+1} = \d… text/html 2025-03-16T01:35:01+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l02&rev=1742081701&do=diff Lab 2. High order functions Objectives: * implement and use higher-order functions. A higher-order function takes other functions as parameter or returns them * implement curry and uncurry functions, and how they should be properly used (review lecture).$ x_1, x_2, x_3$$ +$$ x_1 + (x_2 + (x_3 + acc))$$ a_1, a_2, \ldots, a_k$$ f(a_1)\;op\;f(a_2)\;op\;\ldots f(a_k)$$ f(x) = a*x + b$$ \Delta y$$ \Delta x$ text/html 2025-03-28T12:04:49+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l03&rev=1743156289&do=diff Lab 3. Algebraic Datatype Definition 3.1 Abstract Lists Below, you will find the algebraic definition of the datatype IList: Void : IList Cons : Int x IList -> IList This definition has already been implemented in Scala, as shown below. Please copy-paste this definition in your worksheet. text/html 2025-03-19T20:51:05+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l04&rev=1742410265&do=diff Lab 4. Lists in Scala Objectives: * get familiar with pattern matching lists, as well as common list operations from Scala and how they work * get familiar with common higher-order functions over lists (partition, map, foldRight, foldLeft, filter) text/html 2025-04-04T15:09:24+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l05&rev=1743768564&do=diff Lab 5. Data types in Scala Objectives: * get familiar with algebraic data types * get familiar with pattern matching and recursion with them 5.1 Natural Numbers Given the following implementation of the natural numbers, solve the next few exercises.$ \displaystyle \left(\begin{array}{ccc} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \\ \end{array}\right)$$ \displaystyle 2 * \left(\begin{array}{ccc} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \\ \end{array}\right) = \left(\begin{array}{ccc} 2 & 4 & 6 \\… text/html 2025-04-09T22:22:42+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l06&rev=1744226562&do=diff Lab 6. For expressions 6.1 A small string DSL “” In this section we will extend the scala String class with several operators that implement useful string functions, effectively obtaining a small string-specialized DSL. 6.1.1 Implement the << and text/html 2025-04-09T20:16:19+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:l07&rev=1744218979&do=diff Lab 7. Lambda Calculus 7.0. What? Why? Lambda Calculus is a universal model of computation (can be used to simulate any Turing Machine) based on function abstraction and application. It has a very simple semantic that can be used to study properties of comput$ \lambda f.\lambda x.(f \ x) $$ x $$ x \in VARS $$ \lambda x.e $$ x \in VARS $$ e $$ \lambda $$ (e_1 \ e_2) $$ e_1, e_2 $$ \lambda $$\lambda$$ \lambda x.e $$(\lambda x.body \ param)$$ body[x \ / \ param] $$ E_1 = (\lambda x.e_1 \ e_2) $$ … text/html 2025-04-10T12:09:24+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:secret_tema2&rev=1744276164&do=diff Tema 2 PP 2024 DEADLINE TBD * Temele trebuie submise pe curs.upb.ro, in assignment-ul numit Tema 2 Scala. * Temele ce nu sunt acceptate de validatorul de arhive NU vor fi puncate. * Vom folosi vesiunea Scala TBD si TBD. Folosiți un stil de programare funcțional. NU se vor accepta: text/html 2025-08-13T12:51:29+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:t01&rev=1755078689&do=diff Tema 1 PP – Barcode decoder Publicare: 24 martie 2025 Deadline: 9 aprilie 2025 Schelet de cod: După ce ați descărcat scheletul, creați un proiect nou din IntelliJ în Scala, în care copiați folderele și fișierul din arhivă în root-ul proiectului (folderul $ C = \left(10 - \left( \sum_{i=1}^{12} w_i \cdot c_i \right) \mod 10 \right) \mod 10$$ w_i$$ i$$ c_i$$ i$$ \text{frecvență relativă}=\dfrac{\text{număr apariții}}{\text{număr total de elemente}}$ text/html 2025-04-28T09:44:50+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=pp:2025:scala:t02&rev=1745822690&do=diff Tema 2 PP 2025 DEADLINE 4 Mai 2025 * Temele trebuie submise pe curs.upb.ro, in assignment-ul numit Tema 2 Scala. * Temele ce nu sunt acceptate de validatorul de arhive NU vor fi puncate. Folosiți un stil de programare funcțional. NU se vor accepta: