I hereby claim:
- I am andeh575 on github.
- I am andeh575 (https://keybase.io/andeh575) on keybase.
- I have a public key ASBIPWlTs7awhv6H7X0Vn52NAcq-t80USkAQJRKLSRS-8Qo
To claim this, I am signing this object:
zipIt :: [a] -> [b] -> [(a,b)] | |
zipIt (a:as) (b:bs) = (a,b) : zipIt as bs | |
zipIt _ _ = [] | |
main :: IO() | |
main = do | |
let x = zipIt [1,2,2,3] [4,5,6] | |
print x |
I hereby claim:
To claim this, I am signing this object:
/** | |
* Prints ascii digits | |
* | |
* Refresher on C; Learn C the hard way 1.3 | |
*/ | |
#include <unistd.h> | |
void my_putchar(char c) | |
{ |
/** | |
* Prints out the alphabet in lower case and reverse order | |
* | |
* A refresher on C; Learn C The hard way; 1.2 | |
*/ | |
#include <unistd.h> | |
void my_putchar(char c) | |
{ |
class lol(object): | |
def __eq__(self, other): | |
return True | |
a = lol() | |
if (a == 1 and a == 2 and a ==3): | |
print("Wai hallo dere") | |
-- Experimenting with emulation of dependently typed languages | |
-- Limitations: | |
-- Without being able to statically guarantee that some number is never 0 | |
-- then it's necessary to utilize the isPos type (which means we also need | |
-- to define addition on PosNat S). A dependently typed language would | |
-- greatly simplify this process and prevent the definitions of types from | |
-- growing out of control. | |
-- Define the natural numbers using Peano arithmetic | |
data Nat = Z | S Nat |
// Problem: For loop challenge 2 | |
import java.util.Scanner; | |
class Main { | |
public static void main(String[] args) { | |
Scanner inp = new Scanner(System.in); | |
System.out.print("In:"); | |
String s = inp.nextLine(); | |
// Problem: For loop challenge 1 | |
import java.util.Scanner; | |
class Main { | |
public static void main(String[] args) { | |
Scanner inp = new Scanner(System.in); | |
System.out.print("In:"); | |
int x = inp.nextInt(); | |
// Problem: Further for loop 7 | |
import java.util.Scanner; | |
class Main { | |
public static void main(String[] args) { | |
Scanner inp = new Scanner(System.in); | |
System.out.print("In:"); | |
String s = inp.nextLine(); |
// Problem: Conditional Statement Practice 4 | |
import java.util.Scanner; | |
class Main { | |
public static void main(String[] args) { | |
Scanner inp = new Scanner(System.in); | |
System.out.print("In:"); | |
String word = inp.nextLine(); | |