ichistmeinname

module Automaton2 where

data StateI ident = StateA ident TransitionsA Bool
 deriving Show

type StateA = StateI Ident

type Ident = String

type TransitionsA = Map.Map Char StateA

ichistmeinname

kandidat(maier).
kandidat(mueller).
kandidat(schroeder).
kandidat(schulz).

alleKandidat(vorstand(V,S,K)) :- kandidat(V), kandidat(S), kandidat(K).

einerKandidat(vorstand(V,S,K)) :- kandidat(V); kandidat(S); kandidat(K).
% alternativ:
% einerKandidat(vorstand(V,_,_)) :- kandidat(V).

ichistmeinname

Keybase proof

I hereby claim:

• I am ichistmeinname on github.
• I am ichistmeinname (https://keybase.io/ichistmeinname) on keybase.
• I have a public key whose fingerprint is E8DB 7D1E DB7A C29A 69D3 4F62 5D7D 6711 0887 2E97

To claim this, I am signing this object:

ichistmeinname

-----BEGIN PGP PUBLIC KEY BLOCK-----
Comment: GPGTools - https://gpgtools.org

mQINBFXppN4BEAC97Uf69q6xWGLM2629PZ0UVAuqwRU4vJdZQOyQvdlJFsyU7DJC
G2BR2MarsGW8XD59EBLL3tHWSe5Arqgf56woNMo6aLdUUVteqTDCiZmx07y1HTcG
lLLBTvI4tK0oj7pV3L/8I50R7jargzuK+ohlmC+GoqyEfFKHqowpH1G+p0Fm2EBP
umprOSq1EzklWsfj8bwfy9nBy/dlEzS+0Hpaj54UGxup1d1ljja/Evxv5S4Z7aRh
Ly0EUJco794nZyOT5/7AsBYmbGk/LOVCZWUK50cCukTyb5o6g8mxz9UIbk5nvPe3
P+s8/zzsR9jdgR6aT0SGX8aZXFl/d18N9EPHQ2xCjQes/MW31dYU5BxymaB8xECQ
Va2gjfi4+yM3j7CTE/oNjvhN2Cz6bF7RvNvbERBQ/R0S5KJ5IFOe6+1tVZFLE5XM

ichistmeinname

# Language: Ruby, Level: Level 1

##
## Übungsbetrieb vom 5.11.2015
##
##   alle mit `#` beginnenden Zeilen sind Kommentare
##

## Präsenzaufgabe 1

ichistmeinname

# Language: Ruby, Level: Level 1

##
## Übungsbetrieb vom 4.11.2015
##
##   alle mit `#` beginnenden Zeilen sind Kommentare
##

## Präsenzaufgabe 1
x = true;

ichistmeinname

# Language: Ruby, Level: Level 1

# Präsenzaufgabe 1 - Programmsimulation

n = 10;                      #1
sum = 0;                     #2
zaehler = 1;                 #3
while zaehler <= n do
    sum = sum + zaehler;     #4
    zaehler = zaehler + 1;   #5

ichistmeinname

# Language: Ruby, Level: Level 1

# Präsenzaufgabe - Programmsimulation

n = 10;                      #1
sum = 0;                     #2
zaehler = 1;                 #3
while zaehler <= n do
    sum = sum + zaehler;     #4
    zaehler = zaehler + 1;   #5

ichistmeinname

# min_sort
def min_sort(to_sort)
  length = to_sort.length - 1
  min_index = nil

  for i in 0..length
    min_index = i
    for j in i..length
      if to_sort[j] < to_sort[min_index]
        min_index = j

ichistmeinname

Require Import Coq.Arith.PeanoNat.

Definition VarIndex := nat.
Parameter atom : Set.
Parameter eq_atom_dec : forall x y : atom, {x = y} + {x <> y}.


Section expr_ind.
  Inductive Expr : Type :=
  | BVar : VarIndex -> VarIndex -> Expr