Chema Cortés chemacortes

## fact_par.sc
#!/usr/bin/env -S scala-cli shebang

//> using scala "3.1.0"
//> using lib "org.scala-lang.modules::scala-parallel-collections:1.0.4"

import scala.collection.parallel.CollectionConverters._

def fact(n: BigInt) =
  (n to 1 by -1).par.product

## rand17.py
from random import randint
from functools import partial
from collections import Counter
from itertools import cycle
from typing import Iterable

# única función random que se permite usar
rand5 = partial(randint, 1, 5)

# yapf: disable

## Default.txt
======= [% page.basename %] =======
//Creado el [% strftime("%Y-%m-%d") %]//
TODO: @_revisar

## Default.txt
======= [% page.basename %] =======
//Creado el [% strftime("%Y-%m-%d") %]//
TODO: @_revisar

## new_project.sh
# create a new Dotty project
sbt new lampepfl/dotty.g8

# create a dotty project that cross compiles with scala 2
sbt new lampepfl/dotty-cross.g8

# start a dotty reply from within your sbt project
$ sbt

> console

## fact-fiddle.html
<iframe height="400px" frameborder="0" style="width: 100%" src="https://embed.scalafiddle.io/embed?sfid=HiIQqkL/11&theme=dark&layout=v50"></iframe>

## zip-function.ts
function zipWith<T, R, S>(as: T[], bs: R[], conv: (a: T, b: R) => S): S[] {
  return as.map((a, i) => conv(a, bs[i]));
}

function zip<T, R>(as: T[], bs: R[]) {
  return zipWith(as, bs, (a, b) => [a, b]);
}

## TypeClass.scala
package types


object Math {

  import annotation.implicitNotFound

  @implicitNotFound("No member of type class NumberLike in scope for ${T}")
  trait NumberLike[T] {
    def plus(x: T, y: T): T

## exercise1.hs
-- 1.Write your own definition of scanr, first using recursion, and then using foldr.
--   Do the same for scanl first using recursion then foldl.

import Prelude hiding (scanl, scanr)

scanr :: (a -> b -> b) -> b -> [a] -> [b]
scanr _ acc [] = [acc]
scanr f acc (x:xs) = f x (head qs) : qs
                        where qs = scanr f acc xs

## TypePractice.hs
module TypePractice where

data Nat = Zero
         | Succ Nat
         deriving Show

zero = Zero
one = Succ zero
two = Succ one
three = Succ two
	#!/usr/bin/env -S scala-cli shebang

	//> using scala "3.1.0"
	//> using lib "org.scala-lang.modules::scala-parallel-collections:1.0.4"

	import scala.collection.parallel.CollectionConverters._

	def fact(n: BigInt) =
	(n to 1 by -1).par.product
	from random import randint
	from functools import partial
	from collections import Counter
	from itertools import cycle
	from typing import Iterable

	# única función random que se permite usar
	rand5 = partial(randint, 1, 5)

	# yapf: disable
	======= [% page.basename %] =======
	//Creado el [% strftime("%Y-%m-%d") %]//
	TODO: @_revisar
	# create a new Dotty project
	sbt new lampepfl/dotty.g8

	# create a dotty project that cross compiles with scala 2
	sbt new lampepfl/dotty-cross.g8

	# start a dotty reply from within your sbt project
	$ sbt

	> console
	function zipWith<T, R, S>(as: T[], bs: R[], conv: (a: T, b: R) => S): S[] {
	return as.map((a, i) => conv(a, bs[i]));
	}

	function zip<T, R>(as: T[], bs: R[]) {
	return zipWith(as, bs, (a, b) => [a, b]);
	}
	package types


	object Math {

	import annotation.implicitNotFound

	@implicitNotFound("No member of type class NumberLike in scope for ${T}")
	trait NumberLike[T] {
	def plus(x: T, y: T): T
	-- 1.Write your own definition of scanr, first using recursion, and then using foldr.
	-- Do the same for scanl first using recursion then foldl.

	import Prelude hiding (scanl, scanr)

	scanr :: (a -> b -> b) -> b -> [a] -> [b]
	scanr _ acc [] = [acc]
	scanr f acc (x:xs) = f x (head qs) : qs
	where qs = scanr f acc xs
	module TypePractice where

	data Nat = Zero
	\| Succ Nat
	deriving Show

	zero = Zero
	one = Succ zero
	two = Succ one
	three = Succ two