nicodelpiano

#!/usr/bin/env node

function main() {
  console.log('hello');
}

main();

nicodelpiano

# Binary Tree definition
class Node
  def initialize(val)
    @val = val
    @right = nil
    @left = nil
  end
end

# Preorder Traversal

nicodelpiano

function Node(value) {
  return {data: value, next: null};
}

function isEmpty(object) { for(var i in object) { return false; } return true; }

function add(root, value) {
  var head = root;
  if (root === null || isEmpty(root))
    return Node(value);

nicodelpiano

Exact Solutions using Linear Programming

This is a brief description for the final submission of the GSoC 2016 program. This project implements the method described in [[1]] for providing exact solutions for both MDPs and DTMCs models using exact arithmetic on PRISM probabilistic model checker.

Full list of contributions

Last pull requests for the whole project (will be merged soon)

• Project (prism-svn): prismmodelchecker/prism-svn#1
• Tests (prism-tests): prismmodelchecker/prism-tests#10

nicodelpiano

/*
BP: Entrenamiento de redes neuronales feedforward de 3 capas (entrada - oculta - salida).
Algoritmo: Backpropagation estocastico.
Capa intermedia con unidades sigmoideas.
Salidas con unidades lineales.

PMG - Ultima revision: 18/02/2002
*/

#include <stdio.h>

nicodelpiano

----------------------------------------
--
-- | Exhaustivity Checking Library (ECL)
--
----------------------------------------
module ECL where

import Data.List (foldl', nub)

-- | Type synonyms: names and lists of binders

nicodelpiano

data List a = Nil | Cons a

nicodelpiano

  {-# LANGUAGE DataKinds #-}
  {-# LANGUAGE GADTs #-}
  {-# LANGUAGE FlexibleInstances #-}
  {-# LANGUAGE FlexibleContexts #-}
  {-# LANGUAGE ScopedTypeVariables #-}
  {-# LANGUAGE TypeOperators #-}
  {-# LANGUAGE RankNTypes #-}
  import Test.QuickCheck
  import Data.Type.Equality
  import Data.Proxy

nicodelpiano

module AST where

-- | Name binding association
data Binder = NullBinder       -- Wildcard binder
            | Zero             -- Zero binder
            | Succ Binder      -- Nat binder
  deriving (Show, Eq)

-- | Basic representations of cases
type Case = [Binder]

nicodelpiano

module AST where

-- Name binding association
data Binder = NullBinder       -- Wildcard binder
            | Zero             -- Zero binder
            | Succ Binder      -- Nat binder
  deriving (Show, Eq)

-- Alternatives are the pattern matching clauses
data Alternative = Alternative [Binder]