add README.pod

7 files changed, 631 insertions, 662 deletions

diff --git a/Makefile b/Makefile
index f9d8ce4..a9b6b31 100644
--- a/Makefile
+++ b/Makefile
@@ -112,3 +112,4 @@ deinstall:
 uninstall: deinstall
 pod:
 	@cd ./docs/pod; make clean all
+	@cp ./docs/pod/fype.pod README.pod
diff --git a/README b/README
deleted file mode 100644
index a6be7b8..0000000
--- a/README
+++ /dev/null
@@ -1,435 +0,0 @@
-NAME
-    Fype is For Your Program Execution
-
-    Fype is Free Yak Programed for ELF
-
-    It's not a hype - it's Fype!
-
-SYNOPSES
-    fype [-[hsvTV]] file.fy
-    fype -e "fype code string;"
-
-ABOUT
-    Fype is not yet released! Lots of basic stuff is still missing! See the
-    TODO file of the source distribution of Fype!
-
-    Fype is a 32 bit scripting language created for fun. You can use it and
-    comment on it if you like. You could also write patches and mail them to
-    fype at dev dot buetow dot org! Or go visit the IRC channel #coding at
-    irc.german-elite.net and ask rantanplan.
-
-    Fype is developed under the BSD license. See the COPYING file which is
-    included in the source tree.
-
-    Fype should be "at least as good as AWK". This does not mean it will be
-    a replacement for AWK but it should support functions, loops and arrays
-    like AWK does but with a different syntax. It should also get extension
-    support like AWK has. I am not talking about GNU AWK but about New AWK,
-    which is included in the *BSD distributions! Fype already has a few
-    features which are not available in AWK. However, AWK has still many
-    features which are not available in Fype as well ;)
-
-    Fancy stuff like OOP or unicode or threading is not yet planed. But
-    fancy stuff like function pointers and closures may be considered for
-    one of the first releases of Fype :)
-
-PARSING / CODE GENERATION
-    The Fype syntax is very simple and is using a maximum look ahead of 1
-    and a very easy top down parsing. Fype is parsing and interpreting its
-    code simultaneous. This means, that syntax errors are only detected
-    during program runtime.
-
-REQUIREMENTS
-    Fype only has been tested on FreeBSD 7.0. Linux may work too. Windows
-    support is not planned. But may work using Cygwin or SFU. Linux users
-    have to install pmake before compiling Fype!
-
-    You will need:
-
-            GNU GCC C Compiler (gcc.gnu.org)
-            NetBSD Make aka pmake (GNU Make will not work) 
-
-    NetBSD Make is included in any *BSD and can be run with just make.
-
-GETTING STARTED
-    On Linux: Extract, compile and install Fype:
-
-            tar xvjf fype.tar.bz2
-            cd fype
-            pmake
-            sudo pmake install 
-            pmake clean
-
-    On FreeBSD: Extract, compile and install Fype:
-
-            tar xvjf fype.tar.bz2
-            cd fype
-            make
-            sudo make install 
-            make clean
-
-    Run a .fy file:
-
-            fype test.fy
-
-    See the ./examples subdir of the Fype source distribution for examples!
-    See also fype -h for a list of all options.
-
-DATA TYPES
-    Fype uses auto type conversion. However, if you want to know what's
-    going on you may take a look at the provided basic datatypes.
-
-  The basic data types
-    *integer*
-        Specifies an integer number
-
-    *double*
-        Specifies a double number
-
-    *string*
-        Specifies a string
-
-    *number*
-        May be an integer or a double number
-
-    *any*
-        May be of any type above
-
-    *void*
-        No type
-
-    *identifier*
-        It's a variable name or a procedure name or a function name
-
-  Explicit type conversions
-    (*integer*) integer *any*
-        Converts any type to an integer
-
-    (*double*) double *any*
-        Converts any type to a double
-
-    (*string*) string *any*
-        Converts any type to a string
-
-SYNTAX
-  Comments
-    Text from a # character until the end of the current line is considered
-    being a comment. Multi line comments may start with an #* and and with
-    an *# anywhere. Exceptions are if those signs are inside of strings.
-
-  Statements
-    A Fype program is a list of statements. Each keyword, expression or
-    function call is part of a statement. Each statement is ended with a
-    semicolon. Example:
-
-            my bar = 3, foo = 1 + 2; 
-            say foo;
-            exit foo - bar;
-
-  Paranthesis
-    All paranthesis of function calls are optional. They help to make the
-    code better readable. They also help to force precedences of
-    expressions.
-
-  Scopeing
-    A new scope starts with an { and ends with an }. An exception is a
-    procedure, which does not use its own scope (see later in this manual).
-    Control statements and functions support scopeings. The scope function
-    will print out all available symbols at the current position. Here is a
-    small example of how to use scopes:
-
-            my foo = 1;
-
-            {
-                    # Prints out 1
-                    put defined foo;
-                    {
-                            my bar = 2;
-
-                            # Prints out 1
-                            put defined bar;
-
-                            # Prints out all available symbols at this
-                            # point to stdout. Those are: bar and foo
-                            scope;
-                    }
-
-                    # Prints out 0
-                    put defined bar;
-
-                    my baz = 3;
-            }
-
-            # Prints out 0
-            say defined bar;
-
-  Control statements
-    Fype knows the following control statements:
-
-    if *<expression*> { *<statements*> }
-        Runs the statements if the expression evaluates to a true value.
-
-    ifnot *<expression*> { *<statements*> }
-        Runs the statements if the expression evaluates to a false value.
-
-    while *<expression*> { *<statements*> }
-        Runs the statements as long as the the expression evaluates to a
-        true value.
-
-    until *<expression*> { *<statements*> }
-        Runs the statements as long as the the expression evaluates to a
-        false value.
-
-VARIABLES
-    Variables can be defined with the my keyword. If you don't assign a
-    value during declaration, then it's using the default integer value 0.
-    Variables may be changed during program runtime. Variables may be
-    deleted using the undef keyword! Example of defining variables:
-
-            my foo = 1 + 2;
-            say foo; 
-
-            my bar = 12, baz = foo;
-            say 1 + bar;
-            say bar;
-
-            my baz;
-            say baz; # Will print out 0
-
-    You may use the defined keyword to check if an identifier has been
-    defined or not.
-
-            ifnot defined foo {
-                    say "No foo yet defined";
-            }
-
-            my foo = 1;
-
-            if defined foo {
-                    put "foo is defined and has the value ";
-                    say foo;
-            }
-
-SYNONYMS
-    Each variable can have as many synonyms as wished. A synonym is another
-    name to access the content of a specific variable. Here is an example of
-    how to use synomyms:
-
-            my foo = "foo";
-            my bar = \foo;
-            foo = "bar";
-
-            # The synonym variable should now also set to "bar"
-            assert "bar" == bar;
-
-    Synonyms can be used for all kind of identifiers. It's not limited to
-    normal variables but can be also used for function and procedure names
-    etc.
-
-            # Create a new procedure baz
-            proc baz { say "I am baz"; }
-
-            # Make a synonym baz, and undefine baz
-            my bay = \baz;
-
-            undef baz;
-
-            # bay still has a reference of the original procedure baz
-            bay; # this prints aut "I am baz" 
-
-    The syms keyword gives you the total number of synonyms pointing to a
-    specific value:
-
-            my foo = 1;
-            say syms foo; # Prints 1
-
-            my baz = \foo; 
-            say syms foo; # Prints 2
-            say syms baz; # Prints 2
-
-            undef baz;
-            say syms foo; # Prints 1
-
-BUILT IN FUNCTIONS
-    In Fype, operators are built in functions as well. The difference is,
-    that they may be written in infix notation instead in front of the
-    arguments. The types inside the () specify the return types.
-
-  Math
-    (*any*) *any* + *any*
-        Special string behavior: A string will get auto convertet into an
-        *integer*.
-
-    (*any*) *any* - *any*
-        Special string behavior: A string will get auto convertet into an
-        *integer*.
-
-    (*any*) *any* * *any*
-        Special string behavior: A string will get auto convertet into an
-        *integer*.
-
-    (*any*) *any* / *any*
-        Special string behavior: A string will get auto convertet into an
-        *integer*.
-
-  Conditional
-    (*integer*) *any* == *any*
-    (*integer*) *any* != *any*
-    (*integer*) *any* <= *any*
-    (*integer*) *any* >= *any*
-    (*integer*) *any* < *any*
-    (*integer*) *any* > *any*
-    (*integer*) not *any*
-
-  Definedness
-    (*integer*) defined *identifier*
-        Returns 1 if *identifier* has been defined. Returns 0 else.
-
-    (*integer*) undef *identifier*
-        Tries to undefine/delete the *identifier*. Returns 1 if success,
-        otherwise 0 is returned.
-
-  Bitwise
-    (*integer*) *any* :< *any*
-    (*integer*) *any* :> *any*
-    (*integer*) *any* and *any*
-    (*integer*) *any* or *any*
-    (*integer*) *any* xor *any*
-
-  Numeric
-    (*number*) neg *number*
-        This function returns the negative value of *any*
-
-    (*integer*) no [*integer*]
-        This function returns 1 if the argument is 0, otherwise it will
-        return 0! If no argument is given, then 0 is returned!
-
-    (*integer*) yes [*integer*]
-        This function always returns 1. The parameter is optional.
-
-                # Prints out 1, because foo is not defined
-                if yes { say no defined foo; } 
-
-  System
-    (*void*) end
-        Exits the program with the exit status of 0
-
-    (*void*) exit *integer*
-        Exits the program with the specified exit status
-
-    (*integer*) fork
-        Fork forks a subprocess. It returns 0 for the child process and the
-        pid of the child process otherwise! Example:
-
-                my pid = fork;
-
-                if pid {
-                        put "I am the parent process; child has the pid ";
-                        say pid;
-
-                } ifnot pid {
-                        say "I am the child process";
-                }
-
-    (*integer*) gc
-        Executes the garbage collector and returns the number of items
-        freed! You may wonder why most of the time it will return a value of
-        0! Fype tries to free not needed memory asap. This may change in
-        future versions in order to gain faster execution of scripts!
-
-  I/O
-    (*any*) put *any*
-        Prints out the argument
-
-    (*any*) say *any*
-        Same as put, but also includes an ending newline
-
-    (*void*) ln
-        Just prints a newline
-
-SELF DEFINING PROCEDURES AND FUNCTIONS
-  Procedures
-    A procedure can be defined with the proc keyword and deleted with the
-    undef keyword. A procedure does not return any value and does not
-    support parameter passing. It's using already defined variables (e.g.
-    global variables). A procedure does not have its own namespace. It's
-    using the calling namespace. It is possible to define new variabes
-    inside of a procedure in the current namespace.
-
-            proc foo {
-                    say 1 + a * 3 + b;
-                    my c = 6;
-            }
-
-            my a = 2, b = 4;
-
-            foo; # Run the procedure. Print out "11\n"
-            say c; # Print out "6\n";
-
-  Nested procedures
-    It's possible to define procedures inside of procedures. Since
-    procedures don't have its own scope, nested procedures will be available
-    to the current scope as soon as the main procedure has run the first
-    time. You may use the defined keyword in order to check if a procedure
-    has been defined or not.
-
-            proc foo {
-                    say "I am foo";
-
-                    undef bar;
-                    proc bar {
-                            say "I am bar";
-                    }
-            }
-
-            # Here bar would produce an error because 
-            # the proc is not yet defined!
-            # bar; 
-
-            foo; # Here the procedure foo will define the procedure bar!
-            bar; # Now the procedure bar is defined!
-            foo; # Here the procedure foo will redefine bar again!
-
-  Functions
-    A function should be defined with the func keyword and deleted with the
-    undef keyword. Function not yet return values (will be changed in future
-    versions) and supports not yet parameter passing (will be changed in
-    future versions). It's using local (lexical scoped) variables. If a
-    certain variable does not exist It's using already defined variables
-    (e.g. one scope above).
-
-            func foo {
-                    say 1 + a * 3 + b;
-                    my c = 6;
-            }
-
-            my a = 2, b = 4;
-
-            foo; # Run the procedure. Print out "11\n"
-            say c; # Will produce an error, because c is out of scoped!
-
-  Nested functions
-    Nested functions work the same way the nested procedures work, with the
-    exception that nested functions will not be available any more after the
-    function has been left!
-
-            func foo {
-                    func bar {
-                            say "Hello i am nested";
-                    }
-
-                    bar; # Calling nested
-            }
-
-            foo;
-            bar; # Will produce an error, because bar is out of scope!
-
-AUTHOR
-    Paul C. Buetow (http://paul.buetow.org)
-
-WEBSITE
-    The Fype Language (http://fype.buetow.org)
-
-SEE ALSO
-    awk(1) cc(1) make(1)
-
diff --git a/README.pod b/README.pod
new file mode 100644
index 0000000..5006345
--- /dev/null
+++ b/README.pod
@@ -0,0 +1,495 @@
+=head1 NAME
+
+B<Fype> is B<F>or B<Y>our B<P>rogram B<E>xecution
+
+B<Fype> is B<F>ree B<Y>ak B<P>rogramed for B<E>LF
+
+It's not a hype - it's B<Fype>!
+
+=head1 SYNOPSES
+
+=over
+
+=item B<fype> [-[hsvTV]] file.fy
+
+=item B<fype> -e "fype code string;"
+
+=back
+
+=head1 ABOUT
+
+Fype is not yet released! Lots of basic stuff is still missing! See the
+TODO file of the source distribution of Fype!
+
+Fype is a 32 bit scripting language created for fun. You can use it and comment on it if you like. You could also write patches and mail them to fype at dev dot buetow dot org! Or go visit the IRC channel #coding at irc.german-elite.net and ask rantanplan.
+
+Fype is developed under the BSD license. See the COPYING file which is included in the source tree.
+
+Fype should be "at least as good as AWK". This does not mean it will be a replacement for AWK but it should support functions, loops and arrays like AWK does but with a different syntax. It should also get extension support like AWK has. I am not talking about GNU AWK but about New AWK, which is included in the *BSD distributions! Fype already has a few features which are not available in AWK. However, AWK has still many features which are not available in Fype as well ;)
+
+Fancy stuff like OOP or unicode or threading is not yet planed. But fancy stuff like function pointers and closures may be considered for one of the first releases of Fype :) 
+
+=head1 PARSING / CODE GENERATION
+
+The Fype syntax is very simple and is using a maximum look ahead of 1 and a very easy top down parsing. Fype is parsing and interpreting its code simultaneous. This means, that syntax errors are only detected during program runtime. 
+
+=head1 REQUIREMENTS
+
+Fype only has been tested on FreeBSD 7.0. Linux may work too. Windows support is not planned. But may work using Cygwin or SFU. Linux users have to install pmake before compiling Fype!
+
+You will need:
+
+	GNU GCC C Compiler (gcc.gnu.org)
+	NetBSD Make aka pmake (GNU Make will not work) 
+
+NetBSD Make is included in any *BSD and can be run with just B<make>.
+
+=head1 GETTING STARTED
+
+On Linux: Extract, compile and install Fype:
+
+	tar xvjf fype.tar.bz2
+	cd fype
+	pmake
+	sudo pmake install 
+	pmake clean
+
+On FreeBSD: Extract, compile and install Fype:
+
+	tar xvjf fype.tar.bz2
+	cd fype
+	make
+	sudo make install 
+	make clean
+
+Run a .fy file:
+
+	fype test.fy
+
+See the ./examples subdir of the Fype source distribution for examples! See also fype -h for a list of all options.
+
+=head1 DATA TYPES
+
+Fype uses auto type conversion. However, if you want to know what's going on you may take a look at the provided basic datatypes.
+
+=head2 The basic data types
+
+=over
+
+=item I<integer>
+
+Specifies an integer number
+
+=item I<double>
+
+Specifies a double number
+
+=item I<string>
+
+Specifies a string
+
+=item I<number>
+
+May be an integer or a double number
+
+=item I<any>
+
+May be of any type above
+
+=item I<void>
+
+No type
+
+=item I<identifier>
+
+It's a variable name or a procedure name or a function name
+
+=back
+
+=head2 Explicit type conversions
+
+=over
+
+=item (I<integer>) B<integer> I<any>
+
+Converts any type to an integer
+
+=item (I<double>) B<double> I<any>
+
+Converts any type to a double
+
+=item (I<string>) B<string> I<any>
+
+Converts any type to a string
+
+=back
+
+=head1 SYNTAX
+
+=head2 Comments
+
+Text from a B<#> character until the end of the current line is considered being a comment. Multi line comments may start with an B<#*> and and with an B<*#> anywhere. Exceptions are if those signs are inside of strings.
+
+=head2 Statements
+
+A Fype program is a list of statements. Each keyword, expression or function call is part of a statement. Each statement is ended with a semicolon. Example:
+
+	my bar = 3, foo = 1 + 2; 
+	say foo;
+	exit foo - bar;
+
+=head2 Paranthesis
+
+All paranthesis of function calls are optional. They help to make the code better readable. They also help to force precedences of expressions.
+
+=head2 Scopeing
+
+A new scope starts with an { and ends with an }. An exception is a procedure, which does not use its own scope (see later in this manual). Control statements and functions support scopeings.  The B<scope> function will print out all available symbols at the current position. Here is a small example of how to use scopes: 
+
+	my foo = 1;
+
+	{
+		# Prints out 1
+		put defined foo;
+		{
+			my bar = 2;
+
+			# Prints out 1
+			put defined bar;
+
+			# Prints out all available symbols at this
+			# point to stdout. Those are: bar and foo
+			scope;
+		}
+
+		# Prints out 0
+		put defined bar;
+
+		my baz = 3;
+	}
+
+	# Prints out 0
+	say defined bar;
+
+=head2 Control statements
+
+Fype knows the following control statements:
+
+=over
+
+=item if I<<expression>> { I<<statements>> }
+
+Runs the statements if the expression evaluates to a true value.
+
+=item ifnot I<<expression>> { I<<statements>> }
+
+Runs the statements if the expression evaluates to a false value.
+
+=item while I<<expression>> { I<<statements>> }
+
+Runs the statements as long as the the expression evaluates to a true value.
+
+=item until I<<expression>> { I<<statements>> }
+
+Runs the statements as long as the the expression evaluates to a false value.
+
+=back
+
+=head1 VARIABLES
+
+Variables can be defined with the B<my> keyword. If you don't assign a value during declaration, then it's using the default integer value 0.  Variables may be changed during program runtime. Variables may be deleted using the B<undef> keyword! Example of defining variables:
+
+	my foo = 1 + 2;
+	say foo; 
+
+	my bar = 12, baz = foo;
+	say 1 + bar;
+	say bar;
+
+	my baz;
+	say baz; # Will print out 0
+
+You may use the B<defined> keyword to check if an identifier has been defined or
+not.
+
+	ifnot defined foo {
+		say "No foo yet defined";
+	}
+
+	my foo = 1;
+
+	if defined foo {
+		put "foo is defined and has the value ";
+		say foo;
+	}
+
+=head1 SYNONYMS 
+
+Each variable can have as many synonyms as wished. A synonym is another name to access the content of a specific variable. Here is an example of how to use synomyms:
+
+	my foo = "foo";
+	my bar = \foo;
+	foo = "bar";
+
+	# The synonym variable should now also set to "bar"
+	assert "bar" == bar;
+
+Synonyms can be used for all kind of identifiers. It's not limited to normal variables but can be also used for function and procedure names etc.
+
+	# Create a new procedure baz
+	proc baz { say "I am baz"; }
+
+	# Make a synonym baz, and undefine baz
+	my bay = \baz;
+
+	undef baz;
+
+	# bay still has a reference of the original procedure baz
+	bay; # this prints aut "I am baz" 
+
+The B<syms> keyword gives you the total number of synonyms pointing to a specific value:
+
+	my foo = 1;
+	say syms foo; # Prints 1
+
+	my baz = \foo; 
+	say syms foo; # Prints 2
+	say syms baz; # Prints 2
+
+	undef baz;
+	say syms foo; # Prints 1
+
+
+=head1 BUILT IN FUNCTIONS
+
+In Fype, operators are built in functions as well. The difference is, that they may be written in infix notation instead in front of the arguments. The types inside the () specify the return types.
+
+=head2 Math 
+
+=over 
+
+=item (I<any>) I<any> B<+> I<any>
+
+Special string behavior: A string will get auto convertet into an I<integer>.
+
+=item (I<any>) I<any> B<-> I<any>
+
+Special string behavior: A string will get auto convertet into an I<integer>.
+
+=item (I<any>) I<any> B<*> I<any>
+
+Special string behavior: A string will get auto convertet into an I<integer>.
+
+=item (I<any>) I<any> B</> I<any>
+
+Special string behavior: A string will get auto convertet into an I<integer>.
+
+=back
+
+=head2 Conditional
+
+=over 
+
+=item (I<integer>) I<any> B<==> I<any>
+
+=item (I<integer>) I<any> B<!=> I<any>
+
+=item (I<integer>) I<any> B<<=> I<any>
+
+=item (I<integer>) I<any> B<E<gt>=> I<any>
+
+=item (I<integer>) I<any> B<<> I<any>
+
+=item (I<integer>) I<any> B<E<gt>> I<any>
+
+=item (I<integer>) B<not> I<any>
+
+=back 
+
+=head2 Definedness 
+
+=over 
+
+=item (I<integer>) B<defined> I<identifier>
+
+Returns 1 if I<identifier> has been defined. Returns 0 else.
+
+=item (I<integer>) B<undef> I<identifier>
+
+Tries to undefine/delete the I<identifier>. Returns 1 if success, otherwise 0 is returned.
+
+=back 
+
+=head2 Bitwise 
+
+=over 
+
+=item (I<integer>) I<any> B<:<> I<any>
+
+=item (I<integer>) I<any> B<:E<gt>> I<any>
+
+=item (I<integer>) I<any> B<and> I<any>
+
+=item (I<integer>) I<any> B<or> I<any>
+
+=item (I<integer>) I<any> B<xor> I<any>
+
+=back
+
+=head2 Numeric 
+
+=over
+
+=item (I<number>) B<neg> I<number>
+
+This function returns the negative value of I<any>
+
+=item (I<integer>) B<no> [I<integer>]
+
+This function returns 1 if the argument is 0, otherwise it will return 0! If no
+argument is given, then 0 is returned!
+
+=item (I<integer>) B<yes> [I<integer>]
+
+This function always returns 1. The parameter is optional. 
+	
+	# Prints out 1, because foo is not defined
+	if yes { say no defined foo; } 
+
+=back
+
+=head2 System 
+
+=over
+
+=item (I<void>) B<end>
+
+Exits the program with the exit status of 0
+
+=item (I<void>) B<exit> I<integer>
+
+Exits the program with the specified exit status
+
+=item (I<integer>) B<fork>
+
+Fork forks a subprocess. It returns 0 for the child process and the pid of the
+child process otherwise! Example:
+
+	my pid = fork;
+
+	if pid {
+		put "I am the parent process; child has the pid ";
+		say pid;
+
+	} ifnot pid {
+		say "I am the child process";
+	}
+
+=item (I<integer>) B<gc>
+
+Executes the garbage collector and returns the number of items freed! You may
+wonder why most of the time it will return a value of 0! Fype tries to free not
+needed memory asap. This may change in future versions in order to gain faster
+execution of scripts!
+
+=back
+
+=head2 I/O 
+
+=over
+
+=item (I<any>) B<put> I<any>
+
+Prints out the argument
+
+=item (I<any>) B<say> I<any>
+
+Same as put, but also includes an ending newline 
+
+=item (I<void>) B<ln>
+
+Just prints a newline
+
+=back
+
+=head1 SELF DEFINING PROCEDURES AND FUNCTIONS
+
+=head2 Procedures
+
+A procedure can be defined with the B<proc> keyword and deleted with the B<undef> keyword.  A procedure does not return any value and does not support parameter passing. It's using already defined variables (e.g. global variables). A procedure does not have its own namespace. It's using the calling namespace. It is possible to define new variabes inside of a procedure in the current namespace.
+
+	proc foo {
+		say 1 + a * 3 + b;
+		my c = 6;
+	}
+
+	my a = 2, b = 4;
+
+	foo; # Run the procedure. Print out "11\n"
+	say c; # Print out "6\n";
+
+=head2 Nested procedures
+
+It's possible to define procedures inside of procedures. Since procedures don't
+have its own scope, nested procedures will be available to the current scope as
+soon as the main procedure has run the first time. You may use the B<defined>
+keyword in order to check if a procedure has been defined or not.
+
+	proc foo {
+		say "I am foo";
+
+		undef bar;
+		proc bar {
+			say "I am bar";
+		}
+	}
+
+	# Here bar would produce an error because 
+	# the proc is not yet defined!
+	# bar; 
+
+	foo; # Here the procedure foo will define the procedure bar!
+	bar; # Now the procedure bar is defined!
+	foo; # Here the procedure foo will redefine bar again!
+
+=head2 Functions
+
+A function should be defined with the B<func> keyword and deleted with the B<undef> keyword. Function not yet return values (will be changed in future versions) and supports not yet parameter passing (will be changed in future versions). It's using local (lexical scoped) variables. If a certain variable does not exist It's using already defined variables (e.g. one scope above). 
+
+	func foo {
+		say 1 + a * 3 + b;
+		my c = 6;
+	}
+
+	my a = 2, b = 4;
+
+	foo; # Run the procedure. Print out "11\n"
+	say c; # Will produce an error, because c is out of scoped!
+
+=head2 Nested functions
+
+Nested functions work the same way the nested procedures work, with the exception that nested functions will not be available any more after the function has been left!
+
+	func foo {
+		func bar {
+			say "Hello i am nested";
+		}
+
+		bar; # Calling nested
+	}
+
+	foo;
+	bar; # Will produce an error, because bar is out of scope!
+
+=head1 AUTHOR
+
+Paul C. Buetow (http://paul.buetow.org)
+
+=head1 WEBSITE
+
+The Fype Language (http://fype.buetow.org)
+
+=head1 SEE ALSO
+
+awk(1) cc(1) make(1)
+
diff --git a/docs/pod/fype.1.gz b/docs/pod/fype.1.gz
index 164c95c..916f836 100644
--- a/docs/pod/fype.1.gz
+++ b/docs/pod/fype.1.gz
diff --git a/docs/pod/fype.html b/docs/pod/fype.html
index 0a709bb..121cbea 100644
--- a/docs/pod/fype.html
+++ b/docs/pod/fype.html
@@ -4,13 +4,15 @@
 <head>
 <title>NAME</title>
 <meta http-equiv="content-type" content="text/html; charset=utf-8" />
-<link rev="made" href="mailto:root@chuck.buetow.org" />
+<link rev="made" href="mailto:root@localhost" />
 </head>
 
 <body style="background-color: white">
 
-<p><a name="__index__"></a></p>
+
 <!-- INDEX BEGIN -->
+<div name="index">
+<p><a name="__index__"></a></p>
 
 <ul>
 
@@ -64,9 +66,11 @@
 	<li><a href="#website">WEBSITE</a></li>
 	<li><a href="#see_also">SEE ALSO</a></li>
 </ul>
+
+<hr name="index" />
+</div>
 <!-- INDEX END -->
 
-<hr />
 <p>
 </p>
 <h1><a name="name">NAME</a></h1>
@@ -78,9 +82,9 @@
 <hr />
 <h1><a name="synopses">SYNOPSES</a></h1>
 <dl>
-<dt><strong><a name="item_fype__5b_2d_5bhsvtv_5d_5d_file_2efy"><strong>fype</strong> [-[hsvTV]] file.fy</a></strong>
+<dt><strong><a name="fype_hsvtv_file_fy" class="item"><strong>fype</strong> [-[hsvTV]] file.fy</a></strong></dt>
 
-<dt><strong><a name="item_fype__2de__22fype_code_string_3b_22"><strong>fype</strong> -e ``fype code string;''</a></strong>
+<dt><strong><a name="fype_e_fype_code_string" class="item"><strong>fype</strong> -e &quot;fype code string;&quot;</a></strong></dt>
 
 </dl>
 <p>
@@ -91,7 +95,7 @@
 TODO file of the source distribution of Fype!</p>
 <p>Fype is a 32 bit scripting language created for fun. You can use it and comment on it if you like. You could also write patches and mail them to fype at dev dot buetow dot org! Or go visit the IRC channel #coding at irc.german-elite.net and ask rantanplan.</p>
 <p>Fype is developed under the BSD license. See the COPYING file which is included in the source tree.</p>
-<p>Fype should be ``at least as good as AWK''. This does not mean it will be a replacement for AWK but it should support functions, loops and arrays like AWK does but with a different syntax. It should also get extension support like AWK has. I am not talking about GNU AWK but about New AWK, which is included in the *BSD distributions! Fype already has a few features which are not available in AWK. However, AWK has still many features which are not available in Fype as well ;)</p>
+<p>Fype should be &quot;at least as good as AWK&quot;. This does not mean it will be a replacement for AWK but it should support functions, loops and arrays like AWK does but with a different syntax. It should also get extension support like AWK has. I am not talking about GNU AWK but about New AWK, which is included in the *BSD distributions! Fype already has a few features which are not available in AWK. However, AWK has still many features which are not available in Fype as well ;)</p>
 <p>Fancy stuff like OOP or unicode or threading is not yet planed. But fancy stuff like function pointers and closures may be considered for one of the first releases of Fype :)</p>
 <p>
 </p>
@@ -139,71 +143,61 @@ TODO file of the source distribution of Fype!</p>
 </p>
 <h2><a name="the_basic_data_types">The basic data types</a></h2>
 <dl>
-<dt><strong><a name="item_integer"><em>integer</em></a></strong>
+<dt><strong><a name="integer" class="item"><em>integer</em></a></strong></dt>
 
 <dd>
 <p>Specifies an integer number</p>
 </dd>
-</li>
-<dt><strong><a name="item_double"><em>double</em></a></strong>
+<dt><strong><a name="double" class="item"><em>double</em></a></strong></dt>
 
 <dd>
 <p>Specifies a double number</p>
 </dd>
-</li>
-<dt><strong><a name="item_string"><em>string</em></a></strong>
+<dt><strong><a name="string" class="item"><em>string</em></a></strong></dt>
 
 <dd>
 <p>Specifies a string</p>
 </dd>
-</li>
-<dt><strong><a name="item_number"><em>number</em></a></strong>
+<dt><strong><a name="number" class="item"><em>number</em></a></strong></dt>
 
 <dd>
 <p>May be an integer or a double number</p>
 </dd>
-</li>
-<dt><strong><a name="item_any"><em>any</em></a></strong>
+<dt><strong><a name="any" class="item"><em>any</em></a></strong></dt>
 
 <dd>
 <p>May be of any type above</p>
 </dd>
-</li>
-<dt><strong><a name="item_void"><em>void</em></a></strong>
+<dt><strong><a name="void" class="item"><em>void</em></a></strong></dt>
 
 <dd>
 <p>No type</p>
 </dd>
-</li>
-<dt><strong><a name="item_identifier"><em>identifier</em></a></strong>
+<dt><strong><a name="identifier" class="item"><em>identifier</em></a></strong></dt>
 
 <dd>
 <p>It's a variable name or a procedure name or a function name</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
 <h2><a name="explicit_type_conversions">Explicit type conversions</a></h2>
 <dl>
-<dt><strong><a name="item__28integer_29_integer_any">(<em>integer</em>) <strong>integer</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_integer_any" class="item">(<em>integer</em>) <strong>integer</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Converts any type to an integer</p>
 </dd>
-</li>
-<dt><strong><a name="item__28double_29_double_any">(<em>double</em>) <strong>double</strong> <em>any</em></a></strong>
+<dt><strong><a name="double_double_any" class="item">(<em>double</em>) <strong>double</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Converts any type to a double</p>
 </dd>
-</li>
-<dt><strong><a name="item__28string_29_string_any">(<em>string</em>) <strong>string</strong> <em>any</em></a></strong>
+<dt><strong><a name="string_string_any" class="item">(<em>string</em>) <strong>string</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Converts any type to a string</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
@@ -259,30 +253,26 @@ TODO file of the source distribution of Fype!</p>
 <h2><a name="control_statements">Control statements</a></h2>
 <p>Fype knows the following control statements:</p>
 <dl>
-<dt><strong><a name="item_if__3cexpression_3e__7b__3cstatements_3e__7d">if <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong>
+<dt><strong><a name="if_expression_statements" class="item">if <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong></dt>
 
 <dd>
 <p>Runs the statements if the expression evaluates to a true value.</p>
 </dd>
-</li>
-<dt><strong><a name="item_ifnot__3cexpression_3e__7b__3cstatements_3e__7d">ifnot <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong>
+<dt><strong><a name="ifnot_expression_statements" class="item">ifnot <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong></dt>
 
 <dd>
 <p>Runs the statements if the expression evaluates to a false value.</p>
 </dd>
-</li>
-<dt><strong><a name="item_while__3cexpression_3e__7b__3cstatements_3e__7d">while <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong>
+<dt><strong><a name="while_expression_statements" class="item">while <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong></dt>
 
 <dd>
 <p>Runs the statements as long as the the expression evaluates to a true value.</p>
 </dd>
-</li>
-<dt><strong><a name="item_until__3cexpression_3e__7b__3cstatements_3e__7d">until <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong>
+<dt><strong><a name="until_expression_statements" class="item">until <em>&lt;expression</em>&gt; { <em>&lt;statements</em>&gt; }</a></strong></dt>
 
 <dd>
 <p>Runs the statements as long as the the expression evaluates to a false value.</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
@@ -356,153 +346,132 @@ not.</p>
 </p>
 <h2><a name="math">Math</a></h2>
 <dl>
-<dt><strong><a name="item__28any_29_any__2b_any">(<em>any</em>) <em>any</em> <strong>+</strong> <em>any</em></a></strong>
+<dt><strong><a name="any_any_any" class="item">(<em>any</em>) <em>any</em> <strong>+</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Special string behavior: A string will get auto convertet into an <em>integer</em>.</p>
 </dd>
-</li>
-<dt><strong><a name="item__28any_29_any__2d_any">(<em>any</em>) <em>any</em> <strong>-</strong> <em>any</em></a></strong>
+<dt><strong><a name="any_any_any2" class="item">(<em>any</em>) <em>any</em> <strong>-</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Special string behavior: A string will get auto convertet into an <em>integer</em>.</p>
 </dd>
-</li>
-<dt><strong><a name="item__28any_29_any__2a_any">(<em>any</em>) <em>any</em> <strong>*</strong> <em>any</em></a></strong>
+<dt><strong><a name="any_any_any3" class="item">(<em>any</em>) <em>any</em> <strong>*</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Special string behavior: A string will get auto convertet into an <em>integer</em>.</p>
 </dd>
-</li>
-<dt><strong><a name="item__28any_29_any__2f_any">(<em>any</em>) <em>any</em> <strong>/</strong> <em>any</em></a></strong>
+<dt><strong><a name="any_any_any4" class="item">(<em>any</em>) <em>any</em> <strong>/</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Special string behavior: A string will get auto convertet into an <em>integer</em>.</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
 <h2><a name="conditional">Conditional</a></h2>
 <dl>
-<dt><strong><a name="item__28integer_29_any__3d_3d_any">(<em>integer</em>) <em>any</em> <strong>==</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any" class="item">(<em>integer</em>) <em>any</em> <strong>==</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any__21_3d_any">(<em>integer</em>) <em>any</em> <strong>!=</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any2" class="item">(<em>integer</em>) <em>any</em> <strong>!=</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any__3c_3d_any">(<em>integer</em>) <em>any</em> <strong>&lt;=</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any3" class="item">(<em>integer</em>) <em>any</em> <strong>&lt;=</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any__3e_3d_any">(<em>integer</em>) <em>any</em> <strong>&gt;=</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any4" class="item">(<em>integer</em>) <em>any</em> <strong>&gt;=</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any__3c_any">(<em>integer</em>) <em>any</em> <strong>&lt;</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any5" class="item">(<em>integer</em>) <em>any</em> <strong>&lt;</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any__3e_any">(<em>integer</em>) <em>any</em> <strong>&gt;</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any6" class="item">(<em>integer</em>) <em>any</em> <strong>&gt;</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_not_any">(<em>integer</em>) <strong>not</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_not_any" class="item">(<em>integer</em>) <strong>not</strong> <em>any</em></a></strong></dt>
 
 </dl>
 <p>
 </p>
 <h2><a name="definedness">Definedness</a></h2>
 <dl>
-<dt><strong><a name="item__28integer_29_defined_identifier">(<em>integer</em>) <strong>defined</strong> <em>identifier</em></a></strong>
+<dt><strong><a name="integer_defined_identifier" class="item">(<em>integer</em>) <strong>defined</strong> <em>identifier</em></a></strong></dt>
 
 <dd>
 <p>Returns 1 if <em>identifier</em> has been defined. Returns 0 else.</p>
 </dd>
-</li>
-<dt><strong><a name="item__28integer_29_undef_identifier">(<em>integer</em>) <strong>undef</strong> <em>identifier</em></a></strong>
+<dt><strong><a name="integer_undef_identifier" class="item">(<em>integer</em>) <strong>undef</strong> <em>identifier</em></a></strong></dt>
 
 <dd>
 <p>Tries to undefine/delete the <em>identifier</em>. Returns 1 if success, otherwise 0 is returned.</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
 <h2><a name="bitwise">Bitwise</a></h2>
 <dl>
-<dt><strong><a name="item__28integer_29_any__3a_3c_any">(<em>integer</em>) <em>any</em> <strong>:&lt;</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any7" class="item">(<em>integer</em>) <em>any</em> <strong>:&lt;</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any__3a_3e_any">(<em>integer</em>) <em>any</em> <strong>:&gt;</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_any8" class="item">(<em>integer</em>) <em>any</em> <strong>:&gt;</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any_and_any">(<em>integer</em>) <em>any</em> <strong>and</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_and_any" class="item">(<em>integer</em>) <em>any</em> <strong>and</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any_or_any">(<em>integer</em>) <em>any</em> <strong>or</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_or_any" class="item">(<em>integer</em>) <em>any</em> <strong>or</strong> <em>any</em></a></strong></dt>
 
-<dt><strong><a name="item__28integer_29_any_xor_any">(<em>integer</em>) <em>any</em> <strong>xor</strong> <em>any</em></a></strong>
+<dt><strong><a name="integer_any_xor_any" class="item">(<em>integer</em>) <em>any</em> <strong>xor</strong> <em>any</em></a></strong></dt>
 
 </dl>
 <p>
 </p>
 <h2><a name="numeric">Numeric</a></h2>
 <dl>
-<dt><strong><a name="item__28number_29_neg_number">(<em>number</em>) <strong>neg</strong> <em>number</em></a></strong>
+<dt><strong><a name="number_neg_number" class="item">(<em>number</em>) <strong>neg</strong> <em>number</em></a></strong></dt>
 
 <dd>
 <p>This function returns the negative value of <em>any</em></p>
 </dd>
-</li>
-<dt><strong><a name="item__28integer_29_no__5binteger_5d">(<em>integer</em>) <strong>no</strong> [<em>integer</em>]</a></strong>
+<dt><strong><a name="integer_no_integer" class="item">(<em>integer</em>) <strong>no</strong> [<em>integer</em>]</a></strong></dt>
 
 <dd>
 <p>This function returns 1 if the argument is 0, otherwise it will return 0! If no
 argument is given, then 0 is returned!</p>
 </dd>
-</li>
-<dt><strong><a name="item__28integer_29_yes__5binteger_5d">(<em>integer</em>) <strong>yes</strong> [<em>integer</em>]</a></strong>
+<dt><strong><a name="integer_yes_integer" class="item">(<em>integer</em>) <strong>yes</strong> [<em>integer</em>]</a></strong></dt>
 
 <dd>
-<p>This function always returns 1. The parameter is optional. 
-</p>
-</dd>
-<dd>
+<p>This function always returns 1. The parameter is optional.</p>
 <pre>
 
         # Prints out 1, because foo is not defined
         if yes { say no defined foo; }</pre>
 </dd>
-</li>
 </dl>
 <p>
 </p>
 <h2><a name="system">System</a></h2>
 <dl>
-<dt><strong><a name="item__28void_29_end">(<em>void</em>) <strong>end</strong></a></strong>
+<dt><strong><a name="void_end" class="item">(<em>void</em>) <strong>end</strong></a></strong></dt>
 
 <dd>
 <p>Exits the program with the exit status of 0</p>
 </dd>
-</li>
-<dt><strong><a name="item__28void_29_exit_integer">(<em>void</em>) <strong>exit</strong> <em>integer</em></a></strong>
+<dt><strong><a name="void_exit_integer" class="item">(<em>void</em>) <strong>exit</strong> <em>integer</em></a></strong></dt>
 
 <dd>
 <p>Exits the program with the specified exit status</p>
 </dd>
-</li>
-<dt><strong><a name="item__28integer_29_fork">(<em>integer</em>) <strong>fork</strong></a></strong>
+<dt><strong><a name="integer_fork" class="item">(<em>integer</em>) <strong>fork</strong></a></strong></dt>
 
 <dd>
 <p>Fork forks a subprocess. It returns 0 for the child process and the pid of the
 child process otherwise! Example:</p>
-</dd>
-<dd>
 <pre>
         my pid = fork;</pre>
-</dd>
-<dd>
 <pre>
         if pid {
                 put &quot;I am the parent process; child has the pid &quot;;
                 say pid;</pre>
-</dd>
-<dd>
 <pre>
         } ifnot pid {
                 say &quot;I am the child process&quot;;
         }</pre>
 </dd>
-</li>
-<dt><strong><a name="item__28integer_29_gc">(<em>integer</em>) <strong>gc</strong></a></strong>
+<dt><strong><a name="integer_gc" class="item">(<em>integer</em>) <strong>gc</strong></a></strong></dt>
 
 <dd>
 <p>Executes the garbage collector and returns the number of items freed! You may
@@ -510,30 +479,26 @@ wonder why most of the time it will return a value of 0! Fype tries to free not
 needed memory asap. This may change in future versions in order to gain faster
 execution of scripts!</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
 <h2><a name="i_o">I/O</a></h2>
 <dl>
-<dt><strong><a name="item__28any_29_put_any">(<em>any</em>) <strong>put</strong> <em>any</em></a></strong>
+<dt><strong><a name="any_put_any" class="item">(<em>any</em>) <strong>put</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Prints out the argument</p>
 </dd>
-</li>
-<dt><strong><a name="item__28any_29_say_any">(<em>any</em>) <strong>say</strong> <em>any</em></a></strong>
+<dt><strong><a name="any_say_any" class="item">(<em>any</em>) <strong>say</strong> <em>any</em></a></strong></dt>
 
 <dd>
 <p>Same as put, but also includes an ending newline</p>
 </dd>
-</li>
-<dt><strong><a name="item__28void_29_ln">(<em>void</em>) <strong>ln</strong></a></strong>
+<dt><strong><a name="void_ln" class="item">(<em>void</em>) <strong>ln</strong></a></strong></dt>
 
 <dd>
 <p>Just prints a newline</p>
 </dd>
-</li>
 </dl>
 <p>
 </p>
@@ -620,9 +585,7 @@ keyword in order to check if a procedure has been defined or not.</p>
 </p>
 <hr />
 <h1><a name="see_also">SEE ALSO</a></h1>
-<p><code>awk(1)</code> <code>cc(1)</code> <code>make(1)</code>
-
-</p>
+<p><code>awk(1)</code> <code>cc(1)</code> <code>make(1)</code></p>
 
 </body>
 
diff --git a/docs/pod/fype.man b/docs/pod/fype.man
index e9b95a7..ed963a7 100644
--- a/docs/pod/fype.man
+++ b/docs/pod/fype.man
@@ -1,15 +1,7 @@
-.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.32
+.\" Automatically generated by Pod::Man 2.25 (Pod::Simple 3.16)
 .\"
 .\" Standard preamble:
 .\" ========================================================================
-.de Sh \" Subsection heading
-.br
-.if t .Sp
-.ne 5
-.PP
-\fB\\$1\fR
-.PP
-..
 .de Sp \" Vertical space (when we can't use .PP)
 .if t .sp .5v
 .if n .sp
@@ -25,11 +17,11 @@
 ..
 .\" Set up some character translations and predefined strings.  \*(-- will
 .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
-.\" double quote, and \*(R" will give a right double quote.  | will give a
-.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used to
-.\" do unbreakable dashes and therefore won't be available.  \*(C` and \*(C'
-.\" expand to `' in nroff, nothing in troff, for use with C<>.
-.tr \(*W-|\(bv\*(Tr
+.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
+.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
+.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
+.\" nothing in troff, for use with C<>.
+.tr \(*W-
 .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
 .ie n \{\
 .    ds -- \(*W-
@@ -48,22 +40,25 @@
 .    ds R" ''
 'br\}
 .\"
+.\" Escape single quotes in literal strings from groff's Unicode transform.
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\"
 .\" If the F register is turned on, we'll generate index entries on stderr for
-.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
+.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
 .\" entries marked with X<> in POD.  Of course, you'll have to process the
 .\" output yourself in some meaningful fashion.
-.if \nF \{\
+.ie \nF \{\
 .    de IX
 .    tm Index:\\$1\t\\n%\t"\\$2"
 ..
 .    nr % 0
 .    rr F
 .\}
-.\"
-.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
-.\" way too many mistakes in technical documents.
-.hy 0
-.if n .na
+.el \{\
+.    de IX
+..
+.\}
 .\"
 .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
 .\" Fear.  Run.  Save yourself.  No user-serviceable parts.
@@ -129,13 +124,17 @@
 .\" ========================================================================
 .\"
 .IX Title "FYPE 1"
-.TH FYPE 1 "2008-10-26" "Fype v0.1-devel Build 9276" "The Fype Users Manual Page"
+.TH FYPE 1 "2014-06-22" "Fype Superalpha Build 9666" "The Fype Users Manual Page"
+.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
+.\" way too many mistakes in technical documents.
+.if n .ad l
+.nh
 .SH "NAME"
-\&\fBFype\fR is \fBF\fRor \fBY\fRour \fBP\fRrogram \fBE\fRxecution
+Fype is For Your Program Execution
 .PP
-\&\fBFype\fR is \fBF\fRree \fBY\fRak \fBP\fRrogramed for \fBE\fRLF
+Fype is Free Yak Programed for ELF
 .PP
-It's not a hype \- it's \fBFype\fR!
+It's not a hype \- it's Fype!
 .SH "SYNOPSES"
 .IX Header "SYNOPSES"
 .IP "\fBfype\fR [\-[hsvTV]] file.fy" 4
@@ -156,10 +155,10 @@ Fype is developed under the \s-1BSD\s0 license. See the \s-1COPYING\s0 file whic
 .PP
 Fype should be \*(L"at least as good as \s-1AWK\s0\*(R". This does not mean it will be a replacement for \s-1AWK\s0 but it should support functions, loops and arrays like \s-1AWK\s0 does but with a different syntax. It should also get extension support like \s-1AWK\s0 has. I am not talking about \s-1GNU\s0 \s-1AWK\s0 but about New \s-1AWK\s0, which is included in the *BSD distributions! Fype already has a few features which are not available in \s-1AWK\s0. However, \s-1AWK\s0 has still many features which are not available in Fype as well ;)
 .PP
-Fancy stuff like \s-1OOP\s0 or unicode or threading is not yet planed. But fancy stuff like function pointers and closures may be considered for one of the first releases of Fype :) 
+Fancy stuff like \s-1OOP\s0 or unicode or threading is not yet planed. But fancy stuff like function pointers and closures may be considered for one of the first releases of Fype :)
 .SH "PARSING / CODE GENERATION"
 .IX Header "PARSING / CODE GENERATION"
-The Fype syntax is very simple and is using a maximum look ahead of 1 and a very easy top down parsing. Fype is parsing and interpreting its code simultaneous. This means, that syntax errors are only detected during program runtime. 
+The Fype syntax is very simple and is using a maximum look ahead of 1 and a very easy top down parsing. Fype is parsing and interpreting its code simultaneous. This means, that syntax errors are only detected during program runtime.
 .SH "REQUIREMENTS"
 .IX Header "REQUIREMENTS"
 Fype only has been tested on FreeBSD 7.0. Linux may work too. Windows support is not planned. But may work using Cygwin or \s-1SFU\s0. Linux users have to install pmake before compiling Fype!
@@ -204,7 +203,7 @@ See the ./examples subdir of the Fype source distribution for examples! See also
 .SH "DATA TYPES"
 .IX Header "DATA TYPES"
 Fype uses auto type conversion. However, if you want to know what's going on you may take a look at the provided basic datatypes.
-.Sh "The basic data types"
+.SS "The basic data types"
 .IX Subsection "The basic data types"
 .IP "\fIinteger\fR" 4
 .IX Item "integer"
@@ -227,7 +226,7 @@ No type
 .IP "\fIidentifier\fR" 4
 .IX Item "identifier"
 It's a variable name or a procedure name or a function name
-.Sh "Explicit type conversions"
+.SS "Explicit type conversions"
 .IX Subsection "Explicit type conversions"
 .IP "(\fIinteger\fR) \fBinteger\fR \fIany\fR" 4
 .IX Item "(integer) integer any"
@@ -240,64 +239,52 @@ Converts any type to a double
 Converts any type to a string
 .SH "SYNTAX"
 .IX Header "SYNTAX"
-.Sh "Comments"
+.SS "Comments"
 .IX Subsection "Comments"
 Text from a \fB#\fR character until the end of the current line is considered being a comment. Multi line comments may start with an \fB#*\fR and and with an \fB*#\fR anywhere. Exceptions are if those signs are inside of strings.
-.Sh "Statements"
+.SS "Statements"
 .IX Subsection "Statements"
 A Fype program is a list of statements. Each keyword, expression or function call is part of a statement. Each statement is ended with a semicolon. Example:
 .PP
 .Vb 3
 \&        my bar = 3, foo = 1 + 2; 
 \&        say foo;
-\&        exit foo - bar;
+\&        exit foo \- bar;
 .Ve
-.Sh "Paranthesis"
+.SS "Paranthesis"
 .IX Subsection "Paranthesis"
 All paranthesis of function calls are optional. They help to make the code better readable. They also help to force precedences of expressions.
-.Sh "Scopeing"
+.SS "Scopeing"
 .IX Subsection "Scopeing"
-A new scope starts with an { and ends with an }. An exception is a procedure, which does not use its own scope (see later in this manual). Control statements and functions support scopeings.  The \fBscope\fR function will print out all available symbols at the current position. Here is a small example of how to use scopes: 
+A new scope starts with an { and ends with an }. An exception is a procedure, which does not use its own scope (see later in this manual). Control statements and functions support scopeings.  The \fBscope\fR function will print out all available symbols at the current position. Here is a small example of how to use scopes:
 .PP
 .Vb 1
 \&        my foo = 1;
-.Ve
-.PP
-.Vb 5
+\&
 \&        {
 \&                # Prints out 1
 \&                put defined foo;
 \&                {
 \&                        my bar = 2;
-.Ve
-.PP
-.Vb 2
+\&
 \&                        # Prints out 1
 \&                        put defined bar;
-.Ve
-.PP
-.Vb 4
+\&
 \&                        # Prints out all available symbols at this
 \&                        # point to stdout. Those are: bar and foo
 \&                        scope;
 \&                }
-.Ve
-.PP
-.Vb 2
+\&
 \&                # Prints out 0
 \&                put defined bar;
-.Ve
-.PP
-.Vb 2
+\&
 \&                my baz = 3;
 \&        }
-.Ve
-.PP
-.Vb 2
+\&
 \&        # Prints out 0
 \&        say defined bar;
 .Ve
-.Sh "Control statements"
+.SS "Control statements"
 .IX Subsection "Control statements"
 Fype knows the following control statements:
 .IP "if \fI<expression\fR> { \fI<statements\fR> }" 4
@@ -318,16 +305,12 @@ Variables can be defined with the \fBmy\fR keyword. If you don't assign a value
 .PP
 .Vb 2
 \&        my foo = 1 + 2;
-\&        say foo;
-.Ve
-.PP
-.Vb 3
+\&        say foo; 
+\&
 \&        my bar = 12, baz = foo;
 \&        say 1 + bar;
 \&        say bar;
-.Ve
-.PP
-.Vb 2
+\&
 \&        my baz;
 \&        say baz; # Will print out 0
 .Ve
@@ -339,13 +322,9 @@ not.
 \&        ifnot defined foo {
 \&                say "No foo yet defined";
 \&        }
-.Ve
-.PP
-.Vb 1
+\&
 \&        my foo = 1;
-.Ve
-.PP
-.Vb 4
+\&
 \&        if defined foo {
 \&                put "foo is defined and has the value ";
 \&                say foo;
@@ -359,9 +338,7 @@ Each variable can have as many synonyms as wished. A synonym is another name to
 \&        my foo = "foo";
 \&        my bar = \efoo;
 \&        foo = "bar";
-.Ve
-.PP
-.Vb 2
+\&
 \&        # The synonym variable should now also set to "bar"
 \&        assert "bar" == bar;
 .Ve
@@ -371,18 +348,12 @@ Synonyms can be used for all kind of identifiers. It's not limited to normal var
 .Vb 2
 \&        # Create a new procedure baz
 \&        proc baz { say "I am baz"; }
-.Ve
-.PP
-.Vb 2
+\&
 \&        # Make a synonym baz, and undefine baz
 \&        my bay = \ebaz;
-.Ve
-.PP
-.Vb 1
+\&
 \&        undef baz;
-.Ve
-.PP
-.Vb 2
+\&
 \&        # bay still has a reference of the original procedure baz
 \&        bay; # this prints aut "I am baz"
 .Ve
@@ -392,22 +363,18 @@ The \fBsyms\fR keyword gives you the total number of synonyms pointing to a spec
 .Vb 2
 \&        my foo = 1;
 \&        say syms foo; # Prints 1
-.Ve
-.PP
-.Vb 3
+\&
 \&        my baz = \efoo; 
 \&        say syms foo; # Prints 2
 \&        say syms baz; # Prints 2
-.Ve
-.PP
-.Vb 2
+\&
 \&        undef baz;
 \&        say syms foo; # Prints 1
 .Ve
 .SH "BUILT IN FUNCTIONS"
 .IX Header "BUILT IN FUNCTIONS"
 In Fype, operators are built in functions as well. The difference is, that they may be written in infix notation instead in front of the arguments. The types inside the () specify the return types.
-.Sh "Math"
+.SS "Math"
 .IX Subsection "Math"
 .IP "(\fIany\fR) \fIany\fR \fB+\fR \fIany\fR" 4
 .IX Item "(any) any + any"
@@ -421,7 +388,7 @@ Special string behavior: A string will get auto convertet into an \fIinteger\fR.
 .IP "(\fIany\fR) \fIany\fR \fB/\fR \fIany\fR" 4
 .IX Item "(any) any / any"
 Special string behavior: A string will get auto convertet into an \fIinteger\fR.
-.Sh "Conditional"
+.SS "Conditional"
 .IX Subsection "Conditional"
 .IP "(\fIinteger\fR) \fIany\fR \fB==\fR \fIany\fR" 4
 .IX Item "(integer) any == any"
@@ -439,7 +406,7 @@ Special string behavior: A string will get auto convertet into an \fIinteger\fR.
 .IP "(\fIinteger\fR) \fBnot\fR \fIany\fR" 4
 .IX Item "(integer) not any"
 .PD
-.Sh "Definedness"
+.SS "Definedness"
 .IX Subsection "Definedness"
 .IP "(\fIinteger\fR) \fBdefined\fR \fIidentifier\fR" 4
 .IX Item "(integer) defined identifier"
@@ -447,7 +414,7 @@ Returns 1 if \fIidentifier\fR has been defined. Returns 0 else.
 .IP "(\fIinteger\fR) \fBundef\fR \fIidentifier\fR" 4
 .IX Item "(integer) undef identifier"
 Tries to undefine/delete the \fIidentifier\fR. Returns 1 if success, otherwise 0 is returned.
-.Sh "Bitwise"
+.SS "Bitwise"
 .IX Subsection "Bitwise"
 .IP "(\fIinteger\fR) \fIany\fR \fB:<\fR \fIany\fR" 4
 .IX Item "(integer) any :< any"
@@ -461,7 +428,7 @@ Tries to undefine/delete the \fIidentifier\fR. Returns 1 if success, otherwise 0
 .IP "(\fIinteger\fR) \fIany\fR \fBxor\fR \fIany\fR" 4
 .IX Item "(integer) any xor any"
 .PD
-.Sh "Numeric"
+.SS "Numeric"
 .IX Subsection "Numeric"
 .IP "(\fInumber\fR) \fBneg\fR \fInumber\fR" 4
 .IX Item "(number) neg number"
@@ -472,13 +439,13 @@ This function returns 1 if the argument is 0, otherwise it will return 0! If no
 argument is given, then 0 is returned!
 .IP "(\fIinteger\fR) \fByes\fR [\fIinteger\fR]" 4
 .IX Item "(integer) yes [integer]"
-This function always returns 1. The parameter is optional. 
+This function always returns 1. The parameter is optional.
 .Sp
 .Vb 2
 \&        # Prints out 1, because foo is not defined
 \&        if yes { say no defined foo; }
 .Ve
-.Sh "System"
+.SS "System"
 .IX Subsection "System"
 .IP "(\fIvoid\fR) \fBend\fR" 4
 .IX Item "(void) end"
@@ -493,15 +460,11 @@ child process otherwise! Example:
 .Sp
 .Vb 1
 \&        my pid = fork;
-.Ve
-.Sp
-.Vb 3
+\&
 \&        if pid {
 \&                put "I am the parent process; child has the pid ";
 \&                say pid;
-.Ve
-.Sp
-.Vb 3
+\&
 \&        } ifnot pid {
 \&                say "I am the child process";
 \&        }
@@ -512,20 +475,20 @@ Executes the garbage collector and returns the number of items freed! You may
 wonder why most of the time it will return a value of 0! Fype tries to free not
 needed memory asap. This may change in future versions in order to gain faster
 execution of scripts!
-.Sh "I/O"
+.SS "I/O"
 .IX Subsection "I/O"
 .IP "(\fIany\fR) \fBput\fR \fIany\fR" 4
 .IX Item "(any) put any"
 Prints out the argument
 .IP "(\fIany\fR) \fBsay\fR \fIany\fR" 4
 .IX Item "(any) say any"
-Same as put, but also includes an ending newline 
+Same as put, but also includes an ending newline
 .IP "(\fIvoid\fR) \fBln\fR" 4
 .IX Item "(void) ln"
 Just prints a newline
 .SH "SELF DEFINING PROCEDURES AND FUNCTIONS"
 .IX Header "SELF DEFINING PROCEDURES AND FUNCTIONS"
-.Sh "Procedures"
+.SS "Procedures"
 .IX Subsection "Procedures"
 A procedure can be defined with the \fBproc\fR keyword and deleted with the \fBundef\fR keyword.  A procedure does not return any value and does not support parameter passing. It's using already defined variables (e.g. global variables). A procedure does not have its own namespace. It's using the calling namespace. It is possible to define new variabes inside of a procedure in the current namespace.
 .PP
@@ -534,17 +497,13 @@ A procedure can be defined with the \fBproc\fR keyword and deleted with the \fBu
 \&                say 1 + a * 3 + b;
 \&                my c = 6;
 \&        }
-.Ve
-.PP
-.Vb 1
+\&
 \&        my a = 2, b = 4;
-.Ve
-.PP
-.Vb 2
+\&
 \&        foo; # Run the procedure. Print out "11\en"
 \&        say c; # Print out "6\en";
 .Ve
-.Sh "Nested procedures"
+.SS "Nested procedures"
 .IX Subsection "Nested procedures"
 It's possible to define procedures inside of procedures. Since procedures don't
 have its own scope, nested procedures will be available to the current scope as
@@ -554,47 +513,37 @@ keyword in order to check if a procedure has been defined or not.
 .Vb 2
 \&        proc foo {
 \&                say "I am foo";
-.Ve
-.PP
-.Vb 5
+\&
 \&                undef bar;
 \&                proc bar {
 \&                        say "I am bar";
 \&                }
 \&        }
-.Ve
-.PP
-.Vb 3
+\&
 \&        # Here bar would produce an error because 
 \&        # the proc is not yet defined!
-\&        # bar;
-.Ve
-.PP
-.Vb 3
+\&        # bar; 
+\&
 \&        foo; # Here the procedure foo will define the procedure bar!
 \&        bar; # Now the procedure bar is defined!
 \&        foo; # Here the procedure foo will redefine bar again!
 .Ve
-.Sh "Functions"
+.SS "Functions"
 .IX Subsection "Functions"
-A function should be defined with the \fBfunc\fR keyword and deleted with the \fBundef\fR keyword. Function not yet return values (will be changed in future versions) and supports not yet parameter passing (will be changed in future versions). It's using local (lexical scoped) variables. If a certain variable does not exist It's using already defined variables (e.g. one scope above). 
+A function should be defined with the \fBfunc\fR keyword and deleted with the \fBundef\fR keyword. Function not yet return values (will be changed in future versions) and supports not yet parameter passing (will be changed in future versions). It's using local (lexical scoped) variables. If a certain variable does not exist It's using already defined variables (e.g. one scope above).
 .PP
 .Vb 4
 \&        func foo {
 \&                say 1 + a * 3 + b;
 \&                my c = 6;
 \&        }
-.Ve
-.PP
-.Vb 1
+\&
 \&        my a = 2, b = 4;
-.Ve
-.PP
-.Vb 2
+\&
 \&        foo; # Run the procedure. Print out "11\en"
 \&        say c; # Will produce an error, because c is out of scoped!
 .Ve
-.Sh "Nested functions"
+.SS "Nested functions"
 .IX Subsection "Nested functions"
 Nested functions work the same way the nested procedures work, with the exception that nested functions will not be available any more after the function has been left!
 .PP
@@ -603,14 +552,10 @@ Nested functions work the same way the nested procedures work, with the exceptio
 \&                func bar {
 \&                        say "Hello i am nested";
 \&                }
-.Ve
-.PP
-.Vb 2
+\&
 \&                bar; # Calling nested
 \&        }
-.Ve
-.PP
-.Vb 2
+\&
 \&        foo;
 \&        bar; # Will produce an error, because bar is out of scope!
 .Ve
diff --git a/docs/pod/fype.txt b/docs/pod/fype.txt
index a6be7b8..8513538 100644
--- a/docs/pod/fype.txt
+++ b/docs/pod/fype.txt
@@ -47,7 +47,7 @@ REQUIREMENTS
     You will need:
 
             GNU GCC C Compiler (gcc.gnu.org)
-            NetBSD Make aka pmake (GNU Make will not work) 
+            NetBSD Make aka pmake (GNU Make will not work)
 
     NetBSD Make is included in any *BSD and can be run with just make.
 
@@ -235,7 +235,7 @@ SYNONYMS
             undef baz;
 
             # bay still has a reference of the original procedure baz
-            bay; # this prints aut "I am baz" 
+            bay; # this prints aut "I am baz"
 
     The syms keyword gives you the total number of synonyms pointing to a
     specific value:
@@ -308,7 +308,7 @@ BUILT IN FUNCTIONS
         This function always returns 1. The parameter is optional.
 
                 # Prints out 1, because foo is not defined
-                if yes { say no defined foo; } 
+                if yes { say no defined foo; }
 
   System
     (*void*) end