Luiz-Monad

/*

[DESAFIO / LANGUAGE WAR] Implemente um programa na sua linguagem favorita onde o usuário digita um número x, e o programa calcula o somatório dos x primeiros números pares da sequência fibonacci, e imprime a soma dos algarismos desse número. 

Por exemplo, quando x = 5, a resposta é 17, pois:
 1. A sequência fibonacci é 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233,...
 2. Os 5 primeiros números pares são 0, 2, 8 e 34, 144.
 3. O somatório disso é 188.
 4. Somando os algarismos, 1+8+8 = 17

Luiz-Monad

-- Function: clone_schema(text, text, text)

-- DROP FUNCTION clone_schema(text, text, text);

CREATE OR REPLACE FUNCTION clone_schema(source_schema text, dest_schema text, dest_owner text)
  RETURNS void AS
$BODY$
 
DECLARE
  seq RECORD;

Luiz-Monad

#Creates a named function using the script block.
function Add-Function(
    [string]$name,
    [Parameter(ValueFromPipeline=$true)] 
    [ScriptBlock]$block)
{
    New-Item -Path "Function:" -Name "global:$name" -Value $block 
}

Luiz-Monad

Penetration Testing Execution Standard
http://www.pentest-standard.org/index.php

ISIS Lab's Hack Night - An Intense Introduction to Offensive Security
https://github.com/isislab/Hack-Night/

FSU Offensive Computer Security
http://www.cs.fsu.edu/~redwood/OffensiveComputerSecurity ( 2014 )
http://www.cs.fsu.edu/~redwood/OffensiveSecurity ( 2013 )

Luiz-Monad

• [A Simple Typed Intermediate Language for Object-Oriented Languages] http://research.microsoft.com/pubs/59934/lilc_popl05.pdf
• [A Type directed optimizing compiler for ML] http://www.cs.cmu.edu/~rwh/papers/til/pldi96.pdf
• [algebraIc methods fOr interactiVe proOf systems] http://greg.bronevetsky.com/CS717FA2004/Byzantine/Holographic%20Proofs%20-%20Computability/Algebraic%20Methods%20for%20Interactive%20Proof%20Systems.1992.pdf
• [biRd_wadleR. introduction To functionAl programming.1ed] http://usi-pl.github.io/lc/sp-2015/doc/Bird_Wadler.%20Introduction%20to%20Functional%20Programming.1ed.pdf
• [blame, coercion, and threesomes] http://homepages.inf.ed.ac.uk/wadler/papers/coercions/coercions.pdf
• [cAllariTY-TFP] http://www.joachim-breitner.de/publications/CallArity-TFP.pdf
• [categoRy theory fOr computiNg science] http://www.math.mcgill.ca/triples/Barr-Wells-ctcs.pdf
• [engineering a compiler] https://github.com/germanoa/compiladores/blob/master/doc/ebook/Engineering%20a%20Compiler%20-%202nd%20Edition%20-%20

Luiz-Monad

$packages = (git diff --name-only $env:TRAVIS_COMMIT_RANGE) |
    ? { $_ -like "conda/*" } |
    % { $_ | split-path -leaf } | 
    group | % { $_.name }
write-host "Packages to be built: $packages"
foreach ( $pkg in $packages )
{
	foreach ( $python in $env:PYTHON )
	{
		conda build "conda/$pkg" --python $python

Luiz-Monad

[Reading]
  Programming The Nintendo GameBoyAdvance : The Unofficial Guide
  Department of Sensor Systems Technology 'The Game BoyTM Project'
  Everything You Always Wanted To Know About GAMEBOY 
[info about the Serial Link]
  http://www.darkfader.net/gba/
[Search Gameboy multiboot]
  http://www.kernelthread.com/publications/gbaunix/
  https://developer.mbed.org/users/kek/notebook/gameboy-advance-multiboot/
  http://reinerziegler.de/GBA/gba.htm

Luiz-Monad

template<typename T>
struct S { 
  typedef T Previous;
  enum { ToInt = T::ToInt + 1 };
};

struct Z { enum { ToInt = 0 }; };

template<typename T>

Luiz-Monad

//Lets create an arithmetic by using templates, why not?
//We're not allowed to use builtin compiler math operations
//Yes, this uses sifinae

struct Z { 
  enum { ToInt = 0 };
};

template<typename T>
struct S { 

Luiz-Monad

input:not(:checked) + input:not(:checked) + input:not(:checked) + input:checked + 
  div:before {
    content: "1";
}
input:not(:checked) + input:not(:checked) + input:checked + input:not(:checked) + 
  div:before {
    content: "2";
}
input:not(:checked) + input:not(:checked) + input:checked + input:checked + 
  div:before {