diff --git a/Channel.hs b/Channel.hs
new file mode 100644
--- /dev/null
+++ b/Channel.hs
@@ -0,0 +1,117 @@
+module Channel  (
+    Channel (..)   ,
+    ChannelType(..),
+    stdChan        ,
+    newChan        ,
+    dataBreak      )
+    where
+
+import qualified Network as N
+import Network.BSD (getHostName)
+import System.IO (Handle, hFlush, hGetLine, hPutStrLn, hShow)
+import System.IO.Error (catchIOError)
+import Control.Concurrent (forkIO,threadDelay)
+import Control.Concurrent.MVar
+
+data Channel = Channel {
+               chanType    :: ChannelType
+             , clientPort  :: Integer
+             , send        :: String -> IO ()
+             , receive     :: IO String
+             , extra       :: [String]
+             }
+
+data ChannelType = Internal
+                 | Std
+                 | HTTP
+                 | String
+                 deriving (Eq, Show, Read)
+
+stdChan :: Handle -> Channel
+stdChan h = Channel Std (-1) write rd []
+    where
+        write = hPutStrLn h
+        rd = hGetLine h
+
+newChan :: ChannelType -> String -> Integer -> IO Channel
+newChan t host cp = do 
+            currentHost <- getHostName 
+            case t of 
+                Internal -> newInternalChan currentHost hostPort cp 
+                HTTP
+                    | hostName == "localhost" || hostName == currentHost -> newLocalChan t cp
+                    | otherwise               -> newForeignChan t hostName hostPort 
+                String -> newForeignChan t hostName hostPort
+               where
+               (hostName, _:hostPort) = break (==':') host
+
+newInternalChan :: String -> String -> Integer -> IO Channel
+newInternalChan hostName hostPort cp = return $ Channel Internal cp s r ex
+    where
+       r   = N.withSocketsDo $ do
+            inSock <- N.listenOn $ N.PortNumber $ fromIntegral cp
+            (inHandle,_,_) <- N.accept inSock
+            msg <- hGetLine inHandle
+            N.sClose inSock
+            return msg
+       s v = N.withSocketsDo $ do
+            _ <- forkIO $ do
+                outHandle <- waitForConnect hostName $ N.PortNumber $ port hostPort
+                hPutStrLn outHandle v
+            return ()
+       ex = zipWith (\a b -> (a ++ dataBreak : b))  ["host","clientPort","type"] [hostName ++ ":" ++ hostPort,show cp,show Internal]
+
+newLocalChan :: ChannelType -> Integer -> IO Channel
+newLocalChan t cp = N.withSocketsDo $ do
+    hanVar <- newEmptyMVar
+    _ <- forkIO $ do
+        inSock <- N.listenOn $ N.PortNumber $ fromIntegral cp
+        (inHandle,_,_)  <- N.accept inSock
+        putMVar hanVar inHandle
+    currentHost <- getHostName
+    let ex' = ex ++ ["host" ++ dataBreak :currentHost ++ ":" ++ show cp]
+    return $ Channel t cp (send' hanVar) (receive' hanVar) ex'
+      where
+       ex = zipWith (\a b -> (a ++ dataBreak : b))  ["clientPort","type"] [show cp,show t]
+
+newForeignChan :: ChannelType -> String -> String -> IO Channel
+newForeignChan t hostName hostPort = N.withSocketsDo $ do
+    hanVar <- newEmptyMVar
+    _ <- forkIO $ do
+        outHandle <- waitForConnect hostName $ N.PortNumber $ port hostPort
+        putMVar hanVar outHandle
+    return $ Channel t 0 (send' hanVar) (receive' hanVar) ex
+    where
+       ex = zipWith (\a b -> a ++ dataBreak : b)  ["host","clientPort","type"] [hostName ++ ":" ++ hostPort,"-1",show t]
+
+port :: String -> N.PortNumber
+port s = fromIntegral  (read s :: Integer)
+
+dataBreak :: Char
+dataBreak = '#'
+
+waitForConnect :: N.HostName -> N.PortID -> IO Handle
+waitForConnect h p = N.connectTo h p `catchIOError`
+                                    (\_ -> do
+                                        threadDelay 10000
+                                        putStrLn "waiting for connection"
+                                        waitForConnect h p)
+
+send' :: MVar Handle -> String -> IO ()
+send' hanVar v = do
+        han <- takeMVar hanVar
+        hPutStrLn han v
+        hFlush han
+        putMVar hanVar han
+
+receive' :: MVar Handle -> IO String
+receive' hanVar = do
+        han <- readMVar hanVar
+        msg <- hGetLine han
+        hFlush han
+        return msg
+
+printH :: Handle -> IO ()
+printH h = do
+   hstr <- hShow h
+   putStrLn hstr
diff --git a/LICENSE b/LICENSE
new file mode 100644
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,675 @@
+              GNU GENERAL PUBLIC LICENSE
+                Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                     Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+ 
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+  
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+              END OF TERMS AND CONDITIONS
+
+     How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
diff --git a/PiCalculus.hs b/PiCalculus.hs
new file mode 100644
--- /dev/null
+++ b/PiCalculus.hs
@@ -0,0 +1,648 @@
+{-# LANGUAGE TupleSections #-}
+module Main where
+
+import Control.Arrow (second)
+import Control.Concurrent (forkIO, threadDelay)
+import Control.Concurrent.MVar (newEmptyMVar, takeMVar, tryPutMVar)
+import Control.Monad (liftM, liftM2, unless)
+import Control.Monad.Error (throwError)
+import Control.Monad.Trans (liftIO)
+import Control.Monad.Trans.Except (ExceptT(..), catchE, runExceptT, throwE)
+import Data.Char (toLower)
+import Data.IORef (IORef, newIORef, readIORef,writeIORef)
+import Data.List (intercalate)
+import Data.Maybe (isJust)
+import Network.HTTP.Base (Request(..), RequestMethod(..), mkRequest)
+import Network.URI (parseURI)
+import System.Environment (getArgs, getProgName)
+import System.IO (hFlush, stderr, stdin, stdout)
+import Text.ParserCombinators.Parsec
+
+import Data.Map (Map)
+import qualified Data.Map as Map
+
+import Channel
+
+data PiProcess = Null
+               | In   Term Term
+               | Out  Term Term
+               | New  Term
+               | PiProcess `Seq`   PiProcess -- Sequential Composition
+               | Conc [PiProcess]            -- Parallel   Composition
+               | Replicate PiProcess         -- Infinite parallel replication
+               | Let Term Value (Maybe PiProcess)
+               | If Condition PiProcess PiProcess
+                 deriving (Eq,Show)
+
+data Term = TVar Name 
+          | TStr String
+          | TNum Integer
+          | TBool Bool
+          | TPair (Term, Term)
+          | TFun Name [Term] Int
+            deriving (Eq)
+
+data Value = Proc PiProcess 
+           | Term Term
+           | Chan Channel
+           | PrimitiveFunc TermFun
+           | Func {params :: [String] , body :: Value, closure :: Env}
+
+data PiError = NumArgs Name Integer [Value]
+             | TypeMismatch String [Value]
+             | Parser ParseError
+             | UnboundVar String String
+             | NotTerm Name Value
+             | NotFunction String String
+             | NotChannel String
+             | Default String
+
+type IOThrowsError = ExceptT PiError IO 
+type ThrowsError   = Either  PiError
+
+type Name      = String
+data Condition = Term `Equals` Term deriving (Eq)
+
+type Env = IORef (Map String Value)
+
+nullEnv :: IO Env
+nullEnv = newIORef Map.empty
+
+isBound :: Env -> String -> IO Bool
+isBound envRef var = liftM (isJust . Map.lookup var) $ readIORef envRef
+
+getVar :: Env -> String -> IOThrowsError Value 
+getVar envRef var = do env <- liftIO $ readIORef envRef
+                       maybe (throwE $ UnboundVar "Getting an unbound variable" var)
+                             return
+                             (Map.lookup var env)
+
+setVar :: Env -> String -> Value -> IOThrowsError Value
+setVar envRef var val = do env <- liftIO $ readIORef envRef
+                           maybe (throwE $ UnboundVar "Setting an unbound variable" var)
+                                 (return $ liftIO $ writeIORef envRef $ Map.insert var val env)
+                                 (Map.lookup var env)
+                           return val
+                           
+defineVar :: Env -> String -> Value -> IOThrowsError Value
+defineVar envRef var val = do
+    alreadyDefined <- liftIO $ isBound envRef var
+    if alreadyDefined
+        then setVar envRef var val >> return val
+        else liftIO $ do
+            env      <- readIORef envRef
+            writeIORef envRef $ Map.insert var val env
+            return val
+
+showValue :: Value -> String
+showValue (Proc p)  = show p
+showValue (Term t)  = show t
+showValue (Chan c)  = show $ convert c
+    where 
+        convert ch = TFun "<chan>" (map TStr ex) $ length ex
+            where ex = extra ch
+showValue (PrimitiveFunc _)  = "<primitive>" 
+showValue (Func {})          = "<user function>"  
+
+eqvVal :: Value -> Value -> Bool
+eqvVal (Proc p1)  (Proc p2) = p1 == p2
+eqvVal (Term t1)  (Term t2) = t1 == t2
+eqvVal _ _ = False
+
+instance Eq Value where (==) = eqvVal
+
+showPi :: PiProcess -> String
+showPi Null = "0"
+showPi (In c m) =  "in(" ++ show c ++ "," ++ show m ++ ")"
+showPi (Out c m) =  "out(" ++ show c ++ "," ++  show m ++ ")"
+showPi (Replicate proc) =  "!(" ++ show proc ++ ")"
+showPi (Conc procs) = intercalate "|" $ map show procs 
+showPi (p1 `Seq` Null) = show p1
+showPi (p1 `Seq` p2) = show p1 ++ ";" ++ show p2 
+showPi (New n)   = "new " ++ show n
+showPi (If c p1 Null) = "if " ++ show c ++ " then " ++ show p1 
+showPi (If c p1 p2)   = "if " ++ show c ++ " then " ++ show p1 ++ " else " ++ show p2
+showPi (Let n t p)    = "let " ++ show n ++ " = " ++ show t ++ case p of {Nothing -> "" ; Just x -> " in\n" ++ show x}
+
+showTerm :: Term -> String
+showTerm (TVar x)   = x
+showTerm (TStr str) = "\"" ++ str ++ "\""
+showTerm (TNum num) = show num
+showTerm (TBool b ) = map toLower $ show b
+showTerm (TPair (a,b)) = "pair("++ show a ++ ","++ show b ++ ")"
+showTerm (TFun n ts _ ) = n ++ "(" ++ intercalate "," (map show ts) ++ ")"
+
+showCond :: Condition -> String
+showCond (t1 `Equals` t2) = show t1 ++ " == " ++ show t2
+
+showError :: PiError -> String
+showError (UnboundVar message var)      = message ++ ": " ++ var
+showError (NotFunction message fun)     = message ++ ": " ++ fun
+showError (NotChannel chan)             = "Not a channel: " ++ chan 
+showError (NotTerm name var)            = "Expecting " ++ name ++ " to be a Term, found: " ++ show var
+showError (NumArgs name expected found) = "Expected " ++ show name ++ show expected ++ " args; found values "
+                                          ++ unwordsList found
+showError (TypeMismatch expected found) = "Invalid type: expected " ++ expected ++ ", found "
+                                          ++ show found
+showError (Parser parseErr)             = "Parse error at " ++ show parseErr
+showError (Default msg)                 = msg
+
+--instance Show PiProcess where show = showPi
+instance Show Term      where show = showTerm
+instance Show Condition where show = showCond
+instance Show Value     where show = showValue
+instance Show PiError   where show = showError
+
+unwordsList :: [Value] -> String
+unwordsList = unwords . map show
+
+parseNull :: Parser PiProcess
+parseNull = do
+            paddedChar '0'
+            return Null
+
+parseIn :: Parser PiProcess
+parseIn = do
+            _ <- string "in("
+            name <- parseTerm
+            paddedComma
+            var  <- parseTerm
+            _ <- char ')'
+            parseSeq $ In name var 
+
+parseOut :: Parser PiProcess
+parseOut = do
+            _ <- string "out("
+            name <- parseTerm
+            paddedComma
+            term  <- parseTerm
+            _ <- char ')'
+            parseSeq $ Out name term 
+
+parseReplicate :: Parser PiProcess
+parseReplicate = do
+            _ <- string "!("
+            process <- parseProcess
+            _ <- char ')'
+            return $ Replicate process
+
+paddedChar :: Char ->  Parser ()
+paddedChar ch = do
+            spaces
+            _ <- char ch
+            spaces
+
+paddedStr :: String -> Parser ()
+paddedStr str = do
+            spaces
+            _ <- string str
+            spaces
+
+parseSeq :: PiProcess -> Parser PiProcess
+parseSeq p1 = do
+            p2 <- try (do {paddedChar ';' ; parseProcess}) <|> return Null
+            return $ p1 `Seq` p2
+
+parseNew :: Parser PiProcess
+parseNew = do
+            _ <- string "new"
+            spaces
+            name <- parseTerm
+            parseSeq $ New name
+
+parseIf :: Parser PiProcess
+parseIf = do
+            _ <- string "if" 
+            spaces
+            cond <- parseCondition
+            paddedStr "then"
+            p1 <- parseProcess
+            p2 <- try (do {paddedStr "else" ; parseProcess}) <|> return Null
+            return $ If cond p1 p2
+
+parseLet :: Parser PiProcess
+parseLet = do
+            _ <- string "let"
+            spaces
+            name <- parseTerm
+            paddedChar '='
+            val <- liftM Term parseTerm <|> liftM Proc parseProcess
+            p <- try (do 
+                paddedStr "in"
+                proc <- parseProcess
+                return $ Just proc) <|> return Nothing
+            return $ Let name val p
+
+parseCondition :: Parser Condition
+parseCondition = do
+            t1 <- parseTerm
+            paddedChar '='
+            t2 <- parseTerm
+            return $ t1 `Equals` t2
+
+parseTVar :: Parser Term
+parseTVar = do
+        v <- readVar
+        return $ case v of
+            "true"  -> TBool True
+            "false" -> TBool False
+            _       -> TVar v
+
+parseTFun :: Parser Term
+parseTFun = do
+            name <- readVar
+            spaces
+            args <- bracketed $ sepBy parseTerm paddedComma
+            return $ case (name,args) of
+                ("pair", t1:t2:_)  -> TPair  (t1,t2)
+                _                  -> TFun name args (length args) 
+
+parseTStr :: Parser Term
+parseTStr = do
+        _ <- char '"'
+        x <- many $ noneOf "\""
+        _ <- char '"'
+        return $ TStr x
+
+parseTNum :: Parser Term
+parseTNum = liftM (TNum . read) (many1 digit)
+        
+readVar :: Parser Name
+readVar = do
+        frst <- letter <|> symbol
+        rest <- many $ letter <|> digit <|> symbol
+        return $ frst:rest
+
+symbol :: Parser Char
+symbol = oneOf "'._<>"
+
+paddedComma :: Parser ()
+paddedComma = paddedChar ','
+
+parseTerm :: Parser Term
+parseTerm =  try parseAnonChan
+         <|> try parseTFun
+         <|> parseTNum
+         <|> parseTVar
+         <|> parseTStr
+         where
+            parseAnonChan = do
+                paddedChar '('
+                arg <- many digit
+                paddedChar ')'
+                case arg of
+                    [] -> return $ TFun "anonChan" [] 0
+                    _  -> return $ TFun "anonChan" [TNum (read arg)] 1
+
+parseProcess :: Parser PiProcess
+parseProcess = liftM Conc $ sepBy parseProcess' (paddedChar '|')
+    where
+    parseProcess'  = bracketed parseProcess'' <|> parseProcess''
+    parseProcess'' = parseNull 
+                 <|> try parseIf
+                 <|> parseIn 
+                 <|> parseOut
+                 <|> parseReplicate
+                 <|> parseNew
+                 <|> parseLet
+
+bracketed :: Parser a -> Parser a
+bracketed parser = do
+                    _ <- char '('
+                    spaces
+                    res <- parser
+                    spaces
+                    _ <- char ')'
+                    return res
+
+type TermFun = [Term] -> ThrowsError Term
+
+bindVars :: Env -> [(String , Value)] -> IO Env
+bindVars envRef bindings = do
+                env <- readIORef envRef
+                newIORef $ Map.union (Map.fromList bindings) env
+
+coreBindings :: IO Env
+coreBindings = do
+                n <- nullEnv 
+                e1 <- bindVars n (map (second PrimitiveFunc) primitives) 
+                e2 <- bindVars e1 (map (second Chan) nativeChannels)
+                bindVars e2 [(counterRef, Term $ TNum lowestPort)]
+                where 
+                    lowestPort = 2^(15::Integer) + 2^(14::Integer)
+counterRef :: String
+counterRef = "###"
+
+
+nativeChannels :: [(String   , Channel)]
+nativeChannels = [ ("stdin"  , stdChan stdin) 
+                 , ("0"      , stdChan stdin) 
+                 , ("stdout" , stdChan stdout)
+                 , ("1"      , stdChan stdout)
+                 , ("stderr" , stdChan stderr)
+                 , ("2"      , stdChan stderr)
+                 ]
+
+primitives :: [(String      , TermFun)]
+primitives = [ ("fst"       , first)
+             , ("snd"       , secnd)
+             , ("hash"      , unaryId "hash")
+             , ("pk"        , unaryId "pk")
+             , ("httpRequest", http)
+             , ("getmsg"    , getmsg)
+             , ("pair"      , binaryId "pair")
+             , ("sdec"      , sdec)
+             , ("senc"      , binaryId "senc")
+             , ("adec"      , adec)
+             , ("aenc"      , binaryId "aenc")
+             , ("sign"      , binaryId "sign")
+             , ("checksign" , checksign)
+             , ("mac"       , binaryId "mac")
+             ]
+
+true :: Term
+true = TBool True
+
+false :: Term
+false = TBool False
+
+constId :: String -> TermFun
+constId name [] = return $ TFun name [] 0
+constId name e  = throwError $ NumArgs name 0 (map Term e)
+
+unaryId :: String -> TermFun
+unaryId name [x] =  return $ TFun name [x] 1
+unaryId name e  = throwError $ NumArgs name 1 (map Term e)
+
+binaryId :: String ->  TermFun
+binaryId name [x,y] = return $ TFun name [x,y] 2 
+binaryId name e  = throwError $ NumArgs name 2 (map Term e)
+
+getmsg :: TermFun
+getmsg [TFun "sign" [_,y] 2] = return y
+getmsg e = throwError $ TypeMismatch "sign" $ map Term e
+
+first :: TermFun
+first [TPair p] = return $ fst p
+first e = throwError $ TypeMismatch "pair" $ map Term e 
+
+secnd :: TermFun
+secnd [TPair p] = return $ snd p
+secnd e = throwError $ TypeMismatch "pair" $ map Term e 
+
+sdec :: TermFun
+sdec [k1, TFun "senc" [k2,y] 2]
+    |k1 == k2  = return y
+    |otherwise = throwError $ Default "keys not the same in sdec"
+sdec e = throwError $ TypeMismatch "(var,senc(var,var))" $ map Term e
+
+adec :: TermFun
+adec [x , TFun "aenc" [TFun "pk" [k] 1, y ] 2]
+    | x == k = return y
+    | otherwise= throwError $ Default "keys not same in adec" 
+adec e = throwError $ TypeMismatch "(var,aenc(pk(var),var))" $ map Term e
+
+checksign :: TermFun
+checksign [TFun "pk" [k1] 1 , TFun "sign" [k2,_] 2 ] = return $ TBool (k1 == k2)
+checksign e = throwError $ TypeMismatch "(pk(var),sign(var,var))" $ map Term e
+
+http :: TermFun
+http [TStr url] = case httpGetRequest http' of
+                        Just x  -> return $ TStr x
+                        Nothing -> throwError $ Default "malformed uri"
+    where
+        http'  = if take 7 url /= http'' then http'' ++ url else url
+        http'' = "http://" 
+http _ = throwError $ Default "undefined"
+
+main :: IO ()
+main = do
+        name <- getProgName
+        args <- getArgs
+        case args of
+            []  -> runRepl coreBindings
+            [x] -> readFile x >>= runProcess coreBindings 
+            _   -> do
+                    putStrLn "Use:"
+                    putStrLn $ name ++ " -- Enter the REPL"
+                    putStrLn $ name ++ " [process] -- Run single process"
+        
+readProgram :: String ->  ThrowsError PiProcess
+readProgram input = case parse parseProcess "pi-calculus" input of
+                        Left  err -> throwError $ Parser err
+                        Right val -> return val 
+
+evalCond :: Env -> Condition -> IOThrowsError Bool
+evalCond env (t1 `Equals` t2) = liftM2 (==) (evalTerm env t1) (evalTerm env t2)
+
+evalTerm :: Env -> Term -> IOThrowsError Value
+evalTerm env (TVar name) = getVar env name
+evalTerm _   (TNum num) = return $ Term $ TNum num
+evalTerm _   (TStr str) = return $ Term $ TStr str
+evalTerm _   (TBool b ) = return $ Term $ TBool b
+evalTerm env (TPair (t1,t2)) = do
+            a <- evalTerm env t1
+            b <- evalTerm env t2
+            case (a,b) of 
+                (Term c, Term d) -> return $ Term $ TPair (c,d)
+                _                -> throwE $ Default "pair not given two terms"
+evalTerm env (TFun "anonChan" [] 0) = do
+            port <- assignFreePort env
+            liftM Chan $ liftIO $ newChan Internal ("localhost:"++ show port) port 
+evalTerm _   (TFun "anonChan" [TNum n] 1) = liftM Chan $ liftIO $ newChan Internal ("localhost:"++ show n) n 
+evalTerm env (TFun "httpChan" [TStr addr] 1) = do
+            port <- assignFreePort env
+            liftM Chan $ liftIO $ newChan HTTP (addr ++ ":80") port
+evalTerm env (TFun "chan" [TStr addr,TNum p] 2) = do
+            port <- assignFreePort env
+            liftM Chan $ liftIO $ newChan String (addr ++ ":" ++ show p) port
+evalTerm env (TFun name args _) = do
+            fun <- getVar env name
+            argVals <- mapM (evalTerm env) args
+            apply fun argVals
+
+
+assignFreePort :: Env -> IOThrowsError Integer
+assignFreePort env = do
+            Term (TNum port) <- getVar env counterRef
+            _ <- setVar env counterRef $ Term $ TNum $ port + 1
+            if port == 2 ^ (16 :: Integer)
+                then error "HOW MANY CHANNELS DO YOU WANT?!" 
+                else return port
+
+
+apply :: Value -> [Value] -> IOThrowsError Value 
+apply (PrimitiveFunc fun) args = do
+                        ts <- extracTerms args
+                        res <- liftThrows $ fun ts
+                        return $ Term res
+apply (Func parms bdy closre) args =
+    if num parms /= num args 
+        then throwE $ NumArgs "user-defined" (num parms) args
+        else do
+             clos <- liftIO (bindVars closre $ zip parms args)
+             case bdy of
+                Term t -> evalTerm clos t
+                Proc p -> eval clos p >> return bdy
+                _      -> throwE $ Default "this function makes no sense"
+    where
+        num = toInteger . length
+apply e _ = throwE $ NotFunction "expecting a function found" $ show e
+
+extracTerms :: [Value] -> IOThrowsError [Term]
+extracTerms ts
+        | all isTerm ts = return $ map (\(Term t) -> t) ts
+        | otherwise     = throwE $ Default "not all terms"
+        
+isTerm :: Value -> Bool
+isTerm (Term _) = True
+isTerm _ = False
+        
+liftThrows :: ThrowsError a -> IOThrowsError a
+liftThrows = either throwE return 
+
+extractValue :: ThrowsError a -> a 
+extractValue (Right v) = v
+extractValue (Left  e) = error $ show e
+
+eval :: Env -> PiProcess -> IOThrowsError () 
+eval _ Null = return ()
+eval env (In a (TVar name)) = do
+                chan <- evalChan env a
+                received <- receiveIn chan
+                _ <- defineVar env name received 
+                return ()
+eval env (Out a b) = do 
+                chan <- evalChan env a
+                bVal <- evalTerm env b
+                sendOut chan bVal
+                return ()
+eval env (Replicate proc) = liftIO (threadDelay 1000000) >> eval env (Conc [proc, Replicate proc])
+eval env (Conc [])     = eval env Null
+eval env (Conc [proc]) = eval env proc
+eval env (Conc procs)  = do
+                var <- liftIO newEmptyMVar 
+                mapM_ (forkProcess var) procs
+                res <- liftIO $ takeMVar var
+                case res of
+                    Left err -> throwE err
+                    Right _  -> return ()
+        where
+            forkProcess var proc = liftIO $ forkIO $ do
+                        res <- runExceptT $ eval env proc
+                        _ <- tryPutMVar var res
+                        return ()
+eval env (p1 `Seq` p2) = do
+                eval env p1
+                eval env p2
+eval env (New var@(TVar name)) = do
+                _ <- defineVar env name $ Term var
+                return ()
+eval env (If b p1 p2) = do
+                cond <- evalCond env b
+                eval env (if cond then p1 else p2)
+eval env (Let (TVar name) (Term t2) (Just p)) = do
+                val <- evalTerm env t2 
+                newEnv <- liftIO $ bindVars env [(name,val)]
+                eval newEnv p
+eval env (Let (TVar name) (Term t2) Nothing) = do
+                val <- evalTerm env t2
+                _ <- defineVar env name val
+                return ()
+eval env (Let (TFun name args _) t2 (Just p)) = 
+            defineLocalFun env name args t2 p
+eval env (Let (TFun name args _) t2 Nothing)  = 
+            defineGlobalFun env name args t2
+eval _ _ = throwE $ Default "undefined action"
+
+defineGlobalFun :: Env -> String -> [Term] -> Value -> IOThrowsError ()
+defineGlobalFun env name args term = do
+            _ <- defineVar env name $ makeFun args term env
+            return ()
+defineLocalFun :: Env -> String -> [Term] -> Value -> PiProcess -> IOThrowsError ()
+defineLocalFun env name args term p = do
+            clos <- liftIO $ bindVars env [(name, makeFun args term env)]
+            eval clos p
+
+makeFun :: [Term] -> Value -> Env -> Value
+makeFun args = Func (map show args)
+
+evalString :: Env -> String -> IO String
+evalString env expr = runIOThrows $ liftM show $ liftThrows (readProgram expr) >>= eval env
+
+runIOThrows :: IOThrowsError String -> IO String
+runIOThrows action = liftM extractValue $ runExceptT (trapError action)
+
+trapError :: IOThrowsError String -> IOThrowsError String
+trapError action = catchE action (return . show)
+
+readTerm :: String -> ThrowsError Term 
+readTerm str = case parse parseTerm "Term" str of
+                Left  err -> throwError $ Parser err
+                Right val -> return val 
+
+evalAndPrint :: Env -> String -> IO ()
+evalAndPrint env expr = do
+            res <- evalString env expr 
+            case res of
+                "()"  -> return ()
+                _     -> putStrLn res
+
+runProcess :: IO Env -> String -> IO ()
+runProcess core expr = core >>= flip evalAndPrint expr
+
+runRepl :: IO Env -> IO ()
+runRepl core = core >>= until_ quit (readPrompt "phi>") . evalAndPrint
+        where
+            quit = flip any [":quit",":q"] . (==)
+
+until_ :: Monad m => (a -> Bool) -> m a -> (a -> m ()) -> m ()
+until_ pre prompt action = do
+    result <- prompt
+    unless (pre result) $ action result >> until_ pre prompt action
+
+readPrompt :: String -> IO String
+readPrompt prompt = flushStr prompt >> getLine
+
+flushStr :: String -> IO ()
+flushStr str = putStr str >> hFlush stdout
+
+sendOut :: Channel -> Value -> IOThrowsError () 
+sendOut chan val = liftIO $ send chan $ show val
+
+receiveIn :: Channel -> IOThrowsError Value
+receiveIn chan = do
+        msg <- liftIO $ receive chan
+        let term = extractValue $ readTerm msg
+        case term of
+            TFun "<chan>" ex _ -> decodeChannel ex
+            _ -> return $ Term term
+            where
+            decodeChannel e = do
+                let extraStrings = map (\(TStr x) -> x) e
+                let extraData = map (second tail . break (==dataBreak)) extraStrings
+                case getChannelData extraData of
+                    Just (t,h,p)  -> liftM Chan $ liftIO $ newChan t h p
+                    Nothing -> throwE $ Default "incomplete data in channel"
+                
+
+getChannelData :: [(String,String)] -> Maybe (ChannelType, String, Integer)
+getChannelData ex = do
+        t            <- lookup "type" ex
+        host         <- lookup "host" ex
+        cp           <- lookup "clientPort" ex
+        return (read t,host,read cp)
+
+evalChan :: Env -> Term -> IOThrowsError Channel
+evalChan env t = do
+            chan <- evalTerm env t
+            case chan of
+                Chan c -> return c
+                _      -> throwE $ NotChannel $ show t
+
+
+httpGetRequest :: String -> Maybe String
+httpGetRequest str = do
+        uri <- parseURI str
+        return $ show (mkRequest GET uri :: Request String)
+
diff --git a/Setup.hs b/Setup.hs
new file mode 100644
--- /dev/null
+++ b/Setup.hs
@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain
diff --git a/pi-calculus.cabal b/pi-calculus.cabal
new file mode 100644
--- /dev/null
+++ b/pi-calculus.cabal
@@ -0,0 +1,20 @@
+-- Initial pi-calculus.cabal generated by cabal init.  For further 
+-- documentation, see http://haskell.org/cabal/users-guide/
+
+name:                pi-calculus
+version:             0.0.1
+synopsis:            Applied pi-calculus compiler
+description:         Phi - A compiler for the applied pi-calculus. Very rough around the edges.
+license:             GPL-3
+license-file:        LICENSE
+author:              Will de Renzy-Martin
+maintainer:          will.derenzymartin@gmail.com
+-- copyright:           
+category:            Web
+build-type:          Simple
+cabal-version:       >=1.8
+
+executable phi
+  main-is:           PiCalculus.hs
+  other-modules:     Channel
+  build-depends:       base >=4.5 && <=4.7, mtl ==2.2.*, parsec ==3.1.*, containers ==0.5.*, transformers ==0.4.*, network ==2.5.*, HTTP >=2.15
