octopus (empty) → 0.0.1.0
raw patch · 11 files changed
+1772/−0 lines, 11 filesdep +arraydep +basedep +bytestringsetup-changed
Dependencies added: array, base, bytestring, containers, hexpr, mtl, parsec, symbol, text
Files
- LICENSE +675/−0
- Octopus.hs +175/−0
- Octopus/Basis.hs +98/−0
- Octopus/Data.hs +132/−0
- Octopus/Libraries.hs +94/−0
- Octopus/Parser.hs +211/−0
- Octopus/Primitive.hs +214/−0
- Octopus/Shortcut.hs +25/−0
- Setup.hs +2/−0
- main.hs +94/−0
- octopus.cabal +52/−0
+ LICENSE view
@@ -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>.+
+ Octopus.hs view
@@ -0,0 +1,175 @@+module Octopus where++import Import+import qualified Data.Sequence as Seq+import qualified Data.Map as Map++import Control.Monad.State+import Control.Monad.Reader+import System.IO.Error+import Control.Concurrent.MVar++import Octopus.Data+import Octopus.Parser (parseOctopusFile)+import qualified Octopus.Primitive as Oct+import Octopus.Basis+import Octopus.Shortcut+import Octopus.Libraries+++eval :: ImportsCache -> Val -> Val -> IO Val+eval cache env code = evalStateT (runReaderT (reduce code) cache) startState+ where+ startState = MState { environ = env --Ob Map.empty+ , control = [NormK []]+ }+++reduce :: Val -> Machine Val+reduce x@(Nm _) = done x+reduce x@(By _) = done x+reduce x@(Tx _) = done x+reduce x@(Fp _) = done x+reduce x@(Tg _) = done x+reduce x@(Ab _ _) = done x+reduce x@(Cl _ _ _) = done x+reduce x@(Ce _) = done x+reduce x@(Ar _) = done x+reduce x@(Pr _) = done x+reduce sq@(Sq xs) = case toList xs of+ [] -> done sq+ (x:xs) -> push (Es [] xs) >> reduce x+reduce ob@(Ob m) = case ensureCombination ob of+ Just (f, x) -> push (Op x) >> reduce f+ Nothing -> case Map.toList m of+ [] -> done (mkOb [])+ ((k,v):xs) -> push (Eo k [] xs) >> reduce v+reduce (Sy x) = gets environ >>= \env -> case Oct.resolveSymbol x env of+ Just val -> done val+ Nothing -> do+ env <- gets environ+ error $ "TODO unbound symbol: " ++ show x ++ "\n" ++ show env++combine :: Val -> Val -> Machine Val+combine (Pr Vau) x = case x of+ Sq xs -> case toList xs of+ [var, ast] -> do+ env <- gets environ+ done $ Cl var ast env+ _ -> error "raise wrong number of args to primitive vau"+ _ -> error "raise invalid args to primitive vau"+combine f@(Pr _) x = push (Ap f) >> reduce x+combine f x = case ensureClosure f of --all of these are operatives+ Just (var, ast, env) -> do+ caller <- gets environ+ let x' = mkSq [caller, x]+ case Oct.match var x' of+ Right env' -> swapEnv (env' `Oct.extend` env) >> reduce ast+ Left err -> error "raise match failure"+ _ -> error $ "raise not a combiner:\n" ++ show f++apply :: Val -> Val -> Machine Val+apply (Pr Eval) x = case ensureThunk x of+ Just (env, ast) -> swapEnv env >> reduce ast+ _ -> error $ "raise invalid args to primitive eval: " ++ show x+apply (Pr Ifz) x = case x of+ Sq xs -> case toList xs of+ [p, c, a] -> done $ Oct.ifz p c a+ _ -> error "raise wrong number of args to primitive Ifz"+ _ -> error "raise invalid args to primitive Ifz"+apply (Pr Imp) x = impFile x+apply (Pr Extends) x = case x of+ Sq xs -> case toList xs of+ [] -> done $ mkOb []+ xs -> done $ foldr1 Oct.extend xs+ _ -> error "raise invalid args to primitive Extends"+apply (Pr pr) x =+ case lookup pr table of+ Just f -> case f pr x of+ Right val -> done val+ Left err -> error $ "raise some error in primitive " ++ show pr+ Nothing -> error $ "unknown primitive " ++ show pr+ where+ table = + [ (Match, binary Oct.match)+ + , (Delete, binary Oct.delete)+ , (Keys, unary Oct.keys)+ , (Get, binary Oct.get)+ + , (Eq, binary Oct.eq)+ , (Neq, binary Oct.neq)+ , (Lt, binary Oct.lt)+ , (Lte, binary Oct.lte)+ , (Gt, binary Oct.gt)+ , (Gt, binary Oct.gt)+ + , (Add, binary Oct.add)+ , (Sub, binary Oct.sub)+ , (Mul, binary Oct.mul)+ , (Div, binary Oct.div)+ + , (Len, unary Oct.len)+ , (Cat, binary Oct.cat)+ , (Cut, binary Oct.cut)+ + , (Numer, unary Oct.numer)+ , (Denom, unary Oct.denom)+ , (NumParts, unary Oct.numParts)+ ]+ binary :: (Val -> Val -> Fallible Val) -> Primitive -> Val -> Fallible Val+ binary op pr x = case x of+ Sq xs -> case toList xs of+ [a, b] -> op a b+ _ -> error $ "raise wrong number of args to primitive " ++ show pr+ _ -> error $ "raise invalid args to primitive " ++ show pr+ unary :: (Val -> Fallible Val) -> Primitive -> Val -> Fallible Val+ unary op pr x = op x+apply f x = error "TODO apply"++done :: Val -> Machine Val+done x = do+ k <- gets control+ case k of+ [] -> return x+ (NormK []):_ -> pop >> done x+ (NormK (Re _:_)):_ -> pop >> done x+ (NormK (Es xs []:_)):_ -> pop >> done (Sq . Seq.fromList $ reverse (x:xs))+ (NormK (Es xs (x':xs'):_)):_ -> replace (Es (x:xs) xs') >> reduce x'+ (NormK (Eo k xs []:_)):_ -> pop >> done (Ob . Map.fromList $ (k,x):xs)+ (NormK (Eo k xs ((k',x'):xs'):_)):_ -> replace (Eo k' ((k,x):xs) xs') >> reduce x'+ (NormK (Op arg:ks)):kss -> pop >> combine x arg+ (NormK (Ap f:ks)):kss -> pop >> apply f x+ (ImptK _ slot):ks -> liftIO (slot `putMVar` Right x) >> pop >> done x+++impFile :: Val -> Machine Val+impFile (Tx pathstr) = do+ let path = pathstr --FIXME normalize path+ path' = unpack path+ --TODO check against builtin files, or else pre-populate the cache+ --TODO check the path against the current imports on stack to avoid circular import+ cache_var <- ask+ cache <- liftIO $ takeMVar cache_var+ case Map.lookup path cache of+ Just loaded_var -> do+ liftIO $ cache_var `putMVar` cache+ val_e <- liftIO $ readMVar loaded_var+ case val_e of+ Right val -> done val+ Left err -> error $ "raise exception " ++ show err+ Nothing -> do+ loading_var <- liftIO newEmptyMVar+ liftIO $ cache_var `putMVar` Map.insert path loading_var cache+ contents_e <- liftIO $ tryIOError $ readFile path'+ case contents_e of+ Right contents -> do+ swapEnv startData+ pushK (ImptK path loading_var)+ case parseOctopusFile path' contents of+ Right val -> reduce val --TODO consider which env to start a file off with+ Left err -> error "raise SyntaxError" --FIXME also don't forget to fill the loading_var+ Left err -> error "raise ImportError" --FIXME also don't forget to fill the loading_var+impFile _ = error "TODO raise TypeError"++
+ Octopus/Basis.hs view
@@ -0,0 +1,98 @@+{-| This module contains values that help create and manipulate Octopus+ values that are used by the interpreter, but not strictly primitive,+ that is, they could just as easily be defined in user-space, as long+ as the machine could get at them.+-}+module Octopus.Basis (+ mkVau+ -- * Basic Protocols+ -- ** Combination+ , mkCall+ , callOpr+ , callArg+ , ensureCombination+ -- ** Closure+ , mkClosure+ , ensureClosure+ -- ** Suspension+ , mkThunk+ , ensureThunk++ , module Octopus.Shortcut+ ) where++import Import+import qualified Data.Sequence as Seq+import qualified Data.Map as Map++import Octopus.Data+import Octopus.Shortcut+++mkVau :: String -> String -> Val -> Val+mkVau e arg body = mkCall (Pr Vau) (mkSq [mkSq [Sy $ intern e, Sy $ intern arg], body])+++{-| Construct a combination: an object with a+ @__car__@ slot and a @__cdr__@ slot.+-}+mkCall :: Val -- ^ Combiner (@__car__@)+ -> Val -- ^ Argument (@__cdr__@)+ -> Val+mkCall f x = mkOb [(callOpr, f), (callArg, x)]++{-| Extract a (combiner, argument) pair from a+ combination-responsive object.+-}+ensureCombination :: Val -> Maybe (Val, Val)+ensureCombination (Ob ob) = (,) <$> Map.lookup callOpr ob+ <*> Map.lookup callArg ob+ensureCombination _ = Nothing++{-| Combiner slot name in a combination (aka. application) -}+callOpr :: Symbol+callOpr = intern "__car__"+{-| Argument slot name in a combination (aka. application) -}+callArg :: Symbol+callArg = intern "__cdr__"+++{-| Construct a closure: an object with @__var__@,+ @__ast__@ and @__env__@ slots.+-}+mkClosure :: Val -- ^ Body (@__ast__@)+ -> Val -- ^ Static environment (@__env__@)+ -> Val -- ^ Parameter (@__arg__@)+ -> Val+mkClosure var ast env = Cl var ast env++{-| Extract a (body, environment, parameter) triple from+ a closure-responsive object.+-}+ensureClosure :: Val -> Maybe (Val, Val, Val)+ensureClosure (Cl var ast env) = Just (var, ast, env)+ensureClosure _ = Nothing+++{-| Construct a thunk: a (environment, body) pair. -}+mkThunk :: Val -- ^ Environment (second element)+ -> Val -- ^ Body (first element)+ -> Val+mkThunk env ast = Sq $ Seq.fromList [env, ast]++{-| Extract a (environment, body) pair from a thunk-responsive pair. -}+ensureThunk :: Val -> Maybe (Val, Val)+ensureThunk (Sq xs) = case toList xs of+ [env, ast] -> Just (env, ast)+ _ -> Nothing+ensureThunk _ = Nothing++++++++++
+ Octopus/Data.hs view
@@ -0,0 +1,132 @@+module Octopus.Data where++import Import+import qualified Data.Sequence as Seq+import qualified Data.Map as Map+import Control.Monad.Reader+import Control.Monad.State+import Control.Concurrent.MVar (MVar)+++type Fallible = Either Val+++data Val = Nm Rational -- ^ Rational number+ | By ByteString -- ^ Bytes+ | Tx Text -- ^ Text data+ | Fp Handle -- ^ Input/output handle+ | Sy Symbol -- ^ Symbol, aka. identifier+ | Tg Word -- ^ Unique tag+ | Ab Word Val -- ^ Abstract data+ | Sq (Seq Val) -- ^ Sequence, aka. list+ | Ob (Map Symbol Val) -- ^ Symbol-value map, aka. object+ | Cl Val Val Val -- ^ Operative closure+ | Ce (IORef Val) -- ^ Reference cell+ | Ar (IOArray Int Val) -- ^ Mutable array+ | Pr Primitive -- ^ Primitive operations+ | Pt Int -- ^ Control prompt --TODO consider removing this in favor of using tags and a handler protocol+ | Ks [Control] -- ^ Control stack + --TODO bytestring/buffer/bytes/other name?+ --TODO concurrency+ deriving (Eq)+data Primitive = Vau | Eval | Match | Ifz | Imp+ | Eq | Neq | Lt | Lte | Gt | Gte+ | Add | Mul | Sub | Div+ | Numer | Denom | NumParts+ --TODO By data primitives+ --TODO Tx data primitives+ --TODO Fp data primitives+ --TODO Sy data primitives+ --TODO Tg data primitives+ | Wrap Word | Unwrap Word+ | Len | Cat | Cut+ | Extends | Delete | Keys | Get+ --TODO Ce data primitives+ --TODO Ar data primitives+ --TODO Pt/Ks data primitives+ deriving (Eq, Show)++++type FileCache = MVar (Either Val Val)+type ImportsCache = MVar (Map Text FileCache)+data MState = MState { environ :: Val, control :: [Control] }++type Machine = ReaderT ImportsCache (StateT MState IO)+++data Context = Op Val -- ^ Hole must be a combiner, val is the uneval'd argument+ | Ap Val -- ^ Hole is the argument, apply held value to it+ | Re Val -- ^ Restore an environment before continuing+ | Es [Val] [Val] -- ^ Left-to-right sequence evaluation+ | Eo Symbol [(Symbol, Val)] [(Symbol, Val)] -- ^ Object evaluation+ deriving (Eq, Show)+data Control = NormK [Context]+ | HndlK Val+ --TODO onEnter/onSuccess/onFail+ | ImptK Text (MVar (Fallible Val))+ deriving (Eq)+instance Show Control where+ show (NormK k) = "NormK " ++ show k+ show (HndlK x) = "HndlK " ++ show x+ show (ImptK path slot) = "ImptK " ++ show path+++push :: Context -> Machine ()+push k = do+ (NormK ks):kss <- gets control+ modify $ \s -> s { control = (NormK (k:ks)):kss }+ --FIXME remember that when I push a handler or a winding protect, I also need to push an environment restore+pushK :: Control -> Machine ()+pushK k@(NormK _) = do+ ks <- gets control+ modify $ \s -> s { control = k:ks }+pushK k = do+ ks <- gets control+ modify $ \s -> s { control = (NormK []):k:ks }+pop :: Machine ()+pop = do+ stack <- gets control+ case stack of+ (NormK []):kss -> modify $ \s -> s { control = kss }+ (NormK (Re env:ks)):kss -> modify $ \s -> s { environ = env, control = (NormK ks):kss }+ (NormK (_:ks)):kss -> modify $ \s -> s { control = (NormK ks):kss }+ (ImptK _ _):ks -> modify $ \s -> s { control = ks }+replace :: Context -> Machine ()+replace k = do+ stack <- gets control+ case stack of+ (NormK []):kss -> modify $ \s -> s { control = (NormK [k]):kss }+ (NormK (_:ks)):kss -> modify $ \s -> s { control = (NormK (k:ks)):kss }+ (ImptK _ _):ks -> pop >> replace k+swapEnv :: Val -> Machine ()+swapEnv env' = do+ env <- gets environ+ (NormK ks):kss <- gets control+ case ks of+ (Re _):_ -> modify $ \s -> s { environ = env' } --allows tail recursion by not restoring environments that will immediately be thrown away by a second restoration+ ks -> modify $ \s -> s { environ = env', control = (NormK ((Re env):ks)):kss }+++instance Show Val where+ show (Nm nm) | denominator nm == 1 = show $ numerator nm+ | otherwise = show (numerator nm) ++ "/" ++ show (denominator nm)+ show (By bytes) = "b" ++ show bytes --FIXME show with \x?? for non-ascii printable chars+ show (Tx text) = show text --FIXME show using Octopus encoding, not Haskell+ show (Fp _) = "<handle>" --TODO at least show some metadata+ show (Sy sy) = show sy+ show (Tg i) = "<tag: " ++ show i ++ ">"+ show (Ab tag x) = "<box " ++ show tag ++ ": " ++ show x ++ ">"+ show (Sq xs) = "[" ++ intercalate ", " (show <$> toList xs) ++ "]"+ show (Ob m) = case getCombo m of+ Nothing -> "{" ++ intercalate ", " (showPair <$> Map.toList m) ++ "}"+ Just (f, x) -> "(" ++ show f ++ " " ++ show x ++ ")"+ where+ showPair (k,v) = show k ++ ": " ++ show v+ getCombo ob = case (Map.lookup (intern "__car__") ob, Map.lookup (intern "__cdr__") ob) of+ (Just f, Just x) -> if length (Map.keys ob) == 2 then Just (f, x) else Nothing+ _ -> Nothing+ show (Cl var ast env) = "<closure: var: " ++ show var ++ ", ast: " ++ show ast ++ ", env: " ++ show env ++ ">"+ show (Ce x) = "<reference cell>" --TODO show contents+ show (Ar xs) = "<mutable array>" --TODO show contents+ show (Pr f) = "<" ++ show f ++ ">"
+ Octopus/Libraries.hs view
@@ -0,0 +1,94 @@+module Octopus.Libraries where++import Import+import Octopus.Data+import Octopus.Basis+++startData = mkOb [+ --- Non-data ---+ (intern "__vau__", Pr Vau)+ , (intern "__match__", Pr Match)+ , (intern "__eval__", Pr Eval)+ , (intern "__ifz!__", Pr Ifz)+ , (intern "__import__", Pr Imp)+ --- Relationals ---+ , (intern "__eq__", Pr Eq)+ , (intern "__neq__", Pr Neq)+ , (intern "__lt__", Pr Lt)+ , (intern "__lte__", Pr Lte)+ , (intern "__gt__", Pr Gt)+ , (intern "__gte__", Pr Gt)+ --- Arithmetic ---+ , (intern "__add__", Pr Add)+ , (intern "__mul__", Pr Mul)+ , (intern "__sub__", Pr Sub)+ , (intern "__div__", Pr Div)+ --- Numbers ---+ , (intern "__numer__", Pr Numer)+ , (intern "__denom__", Pr Denom)+ , (intern "__numparts__", Pr NumParts)+ --- Lists ---+ , (intern "__len__", Pr Len)+ , (intern "__cat__", Pr Cat)+ , (intern "__cut__", Pr Cut)+ --- Xonses ---+ , (intern "__extends__", Pr Extends)+ , (intern "__del__", Pr Delete)+ , (intern "__keys__", Pr Keys)+ --TODO __lookup__+ --- Niceties ---+ , (intern "vau", vauDef)+ , (intern "__get__", getDef)+ , (intern "__let__", letDef)+ , (intern "__lambda__", lambdaDef)+ , (intern "__quote__", quoteDef)+ ]++vauDef = Cl+ (mkSq [mkOb [], mkSy "x"])+ (mkCall (Pr Vau) (mkSq [mkSq [mkSy "static", mkSy "body"],+ mkCall (Pr Vau) (mkSq [mkSy "arg",+ mkCall (Pr Eval) (mkSq [+ mkCall (Pr Extends) (mkSq [+ mkCall (Pr Match) (mkSq [mkSy "x", mkSy "arg"]),+ mkSy "static"]),+ mkSy "body"])])]))+ (mkOb [])+++delDef = Cl + (mkSy "ob")+ (mkCall (Pr Vau) (mkSq [mkSq [mkOb [], mkSy "x"],+ mkCall (Pr Delete) (mkSq [mkCall (Pr Eval) (mkSy "ob"), mkSy "x"])]))+ (mkOb [])++getDef = Cl+ (mkSq [mkOb [], mkSy "x"])+ (mkCall (Pr Vau) (mkSq [mkSy "ob",+ mkCall (Pr Eval) (mkSq [mkCall (Pr Eval) (mkSy "ob"), mkSy "x"])]))+ (mkOb [])+++letDef = Cl+ (mkSq [mkOb [], mkSy "x"])+ (mkCall (Pr Vau) (mkSq [mkSy "val",+ mkCall (Pr Vau) (mkSq [mkSq [mkSy "e", mkSy "body"],+ mkCall (Pr Eval) (mkSq+ [ mkCall (Pr Extends) (mkSq + [ mkCall (Pr Match) (mkSq [mkSy "x", mkCall (Pr Eval) (mkSy "val")])+ , mkSy "e"])+ , mkSy "body"])])]))+ (mkOb [])++lambdaDef = Cl+ (mkSq [mkOb [], mkSy "var"])+ (mkCall (Pr Vau) (mkSq [mkSq [mkSy "static", mkSy "ast"],+ mkCall (Pr Vau) (mkSq [mkSy "arg",+ mkCall (Pr Eval) (mkSq+ [ mkCall (Pr Extends) (mkSq+ [ mkCall (Pr Match) (mkSq [mkSy "var", mkCall (Pr Eval) (mkSy "arg")])+ , mkSy "static"])+ , mkSy "ast"])])]))+ (mkOb [])+quoteDef = Cl (mkSq [mkOb [], mkSy "ast"]) (mkSy "ast") (mkOb [])
+ Octopus/Parser.hs view
@@ -0,0 +1,211 @@+{-| Parse Octopus source code. The Octopus grammar is:++@+file ::= (\<expr\> | \<defn\>)*+defn ::= _field_ \<expr\>+expr ::= \<atom\> | \<list\> | \<object\>+ | \<combination\> | \<block\> | \<quotation\>+ | '(' \<expr\> ')'++atom ::= _symbol_ | _number_ | _string_ | _heredoc_ | _accessor_+list ::= '[' (\<expr\>+ (',' \<expr\>+)*)? ']'+object ::= '{' (_field_ \<expr\>+ (',' _field_ \<expr\>+)*)? '}'+combination ::= '(' \<expr\> \<expr\>+ ')'+block ::= 'do' (\<expr\> | \<defn\>)+ ';'+quotation ::= '`' \<expr\>++symbol ::= \/\<name\>\/ - reserved+ reserved = {'do'}+field ::= \/\<name\>:\/+accessor ::= \/:\<name\>\/+number ::= \/[+-]?(0[xX]\<hexnum\>|0[oO]\<octnum\>|0[bB]\<binnum\>|\<decnum\>)\/+ decnum ::= \/\\d+(\\.\\d+\<exponent\>?|\\\/\\d+)?\/+ hexnum ::= \/\\x+(\\.\\x+([hH][+-]?\\x+)?|\\\/\\x+)?\/+ octnum ::= \/[0-7]+(\\.[0-7]+\<exponent\>?|\\\/[0-7]+)?\/+ binnum ::= \/[01]+(\\.[01]+\<exponent\>?|\\\/[01]+)?\/+ exponent ::= \/[eE][+-]?\\d+|[hH][+-]?\\x+\/+string ::= \/\"([^\\\\\"]|\\\\[abefntv\'\"\\\\&]|\\\\\<numescape\>|\\\\\\s*\\n\\s*\\\\)*\"\/+ numescape ::= \/[oO][0-7]{3}|[xX][0-9a-fA-F]{2}|u[0-9a-fA-F]{4}|U0[0-9a-fA-F]{5}|U10[0-9a-fA-F]{4}\/+heredoc ::= \/\#\<\<\\s*(?\'END\'\\w+)\\s*\\n.*?\\g{END}\/+name ::= \/\<namehead\>\<nametail\>|-(\<namehead\>|-)\<nametail\>|-\/+ nametail = \/[^\#\\\\\"`()[]{}:;.,]*\/+ namehead = \/[^\#\\\\\"`()[]{}:;.,0-9-]\/++linecomment ::= \/#(?!\>\>)\\.*?\\n\/+blockcomment ::= \/\#\\{([^\#}]+|\<blockcomment\>|\#[^{]|\\}[^\#])*\\}\#\/+@+-}+module Octopus.Parser where++import Import++import qualified Data.ByteString.Lazy as BS+import qualified Data.Text as T+import Text.Parsec ( Parsec, SourceName, ParseError+ , try, (<?>), unexpected, parserZero+ , char, anyChar, eof)+import qualified Text.Parsec as P+import Language.Parse++import Octopus.Data+import Octopus.Shortcut+import Octopus.Basis+++type Parser = Parsec String ()++parseOctopusExpr :: SourceName -> String -> Either ParseError Val+parseOctopusExpr sourceName input = P.runParser (padded expr <* padded eof) () sourceName input++parseOctopusFile :: SourceName -> String -> Either ParseError Val+parseOctopusFile sourceName input = P.runParser octopusFile () sourceName input+ where+ octopusFile = do+ es <- P.many $ padded statement+ padded eof+ return $ loop es+ loop [] = mkCall getenv (mkOb [])+ loop (Left s:rest) = mkCall (mkDefn s) (loop rest)+ loop (Right e:rest) = mkCall (mkExpr e) (loop rest)+ getenv = (mkCall (Pr Vau) (mkSq [mkSq [mkSy "e", mkOb []], mkSy "e"]))+++define :: Parser (Val, Val)+define = do+ var <- try (expr <* char ':' <* whitespace)+ body <- expr+ return (var, body)++expr :: Parser Val+expr = composite P.<|> atom+ where+ atom = P.choice [symbol, numberLit, textLit, heredoc, accessor] <?> "atom"+ composite = P.choice [block, combine, sq, ob, quote]++statement :: Parser (Either (Val, Val) Val)+statement = (Left <$> define) P.<|> (Right <$> expr)+++------ Atoms ------+symbol :: Parser Val+symbol = do+ n <- name+ when (n == "do") (unexpected "reserved word (do)") --FIXME report error position before token, not after+ return $ mkSy n++numberLit :: Parser Val+numberLit = Nm <$> anyNumber++--TODO maybe bytes literals++textLit :: Parser Val+textLit = do+ content <- catMaybes <$> between2 (char '\"') (P.many maybeLiteralChar)+ return $ mkTxt content+mkBytes = By . encodeUtf8 . T.pack+mkTxt = Tx . T.pack++heredoc :: Parser Val+heredoc = do+ string "#<<"+ --grab until end of line, strip whitespace, save as `end`+ --anyChar `manyThru` end+ parserZero --TODO++accessor :: Parser Val+accessor = do+ key <- char ':' *> name+ return $ mkCall (mkSy "__get__") (mkSy key)+++------ Composites ------+combine :: Parser Val+combine = do+ postPadded $ char '('+ e <- bareCombination+ padded $ char ')'+ return e++sq :: Parser Val+sq = do+ postPadded $ char '['+ elems <- bareCombination `P.sepBy` padded comma+ padded $ char ']'+ return $ mkSq elems++ob :: Parser Val+ob = do+ postPadded $ char '{'+ elems <- pair `P.sepBy` padded comma+ padded $ char '}'+ return $ mkOb elems+ where+ pair = do+ key <- intern <$> padded name+ char ':' <* whitespace+ val <- bareCombination+ return (key, val)++block :: Parser Val+block = do+ try $ string "do" >> whitespace+ states <- P.many1 $ postPadded statement+ char ';'+ return $ loop states+ where+ loop [Left d] = mkCall (mkDefn d) (mkOb [])+ loop [Right e] = e+ loop (Left d:rest) = mkCall (mkDefn d) (loop rest)+ loop (Right e:rest) = mkCall (mkExpr e) (loop rest)++quote :: Parser Val+quote = do+ char '`'+ e <- expr+ return $ mkCall (mkSy "__quote__") e+++------ Space ------+whitespace :: Parser ()+whitespace = (<?> "space") . P.skipMany1 $ P.choice [spaces1, lineComment, blockComment]++lineComment :: Parser ()+lineComment = void $ do+ try $ char '#' >> P.notFollowedBy (string "<<")+ anyChar `manyThru` (void (char '\n') P.<|> eof)++blockComment :: Parser ()+blockComment = parserZero++padded :: Parser a -> Parser a+padded p = try $ P.optional whitespace >> p+postPadded :: Parser a -> Parser a+postPadded p = p <* P.optional whitespace+++------ Helpers ------+name :: Parser String+name = P.choice [ (:) <$> namehead <*> nametail+ , (:) <$> char '-' <*> P.option [] ((:) <$> (namehead P.<|> char '-') <*> nametail)+ ]+ where+ namehead = blacklistChar (`elem` reservedFirstChar)+ nametail = P.many $ blacklistChar (`elem` reservedChar)+ reservedChar = "#\\\"`()[]{}:;.,"+ reservedFirstChar = reservedChar ++ "-0123456789"++comma :: Parser ()+comma = char ',' >> whitespace++bareCombination :: Parser Val+bareCombination = loop <$> P.many1 (postPadded expr)+ where+ loop [e] = e+ loop [f, x] = mkCall f x+ loop es = mkCall (loop $ init es) (last es)++mkDefn (x, val) = mkCall (mkCall (mkSy "__let__") x) val+mkExpr e = mkCall (mkCall (mkSy "__let__") (mkOb [])) e+++
+ Octopus/Primitive.hs view
@@ -0,0 +1,214 @@+module Octopus.Primitive (+ resolveSymbol++ , match+ , ifz++ , eq, neq, lt, gt, lte, gte++ , add, sub, mul, div--, quo, rem, quorem+ + , numer, denom, numParts+ + --TODO float arithmetic (exp, log, ln, trig)++ --, read, write, flush, close++ --, newTag++ , len, cat, cut++ , get, keys, extend, delete++ --, new, deref, assign++ --, newArr, getIx, setIx++ --TODO os interface (perhaps in a separate file)+ ) where++import Prelude hiding (div, rem)+import Import hiding (delete)+import qualified Data.Sequence as Seq+import qualified Data.Map as Map+import qualified Data.Text as T+import qualified Data.ByteString as BS++import Octopus.Data+import Octopus.Shortcut+import Octopus.Basis+++------ Internals ------+{-| Lookup symbol in a value, if the binding exists. -}+resolveSymbol :: Symbol -> Val -> Maybe Val+resolveSymbol sy (Ob ob) = Map.lookup sy ob+resolveSymbol _ _ = Nothing+++------ Non-data Primitives ------+{-| Create a new environment by matching the second value+ to atoms in the first, even if those atoms are nested+ under sequences or objects. Symbols match any value and+ perform binding.+-}+match :: Val -> Val -> Fallible Val+--FIXME disallow double-binding+match var val = mkOb <$> go var val+ where+ go :: Val -> Val -> Fallible [(Symbol, Val)]+ go (Sy x) v = Right [(x, v)]+ go (Sq ps) (Sq xs) | Seq.length ps == Seq.length xs = do+ concat <$> mapM (uncurry go) (zip (toList ps) (toList xs))+ | otherwise = error "raise pattern match failure"+ go (Sq ps) _ = Left (error "TODO")+ go (Ob ps) _ | length (Map.keys ps) == 0 = Right []+ go (Ob ps) (Ob vs) = goObj (Map.toList ps) vs+ where+ goObj :: [(Symbol, Val)] -> Map Symbol Val -> Fallible [(Symbol, Val)]+ goObj [] _ = Right []+ goObj ((k, v):ks) vs = case Map.lookup k vs of+ Just v' -> (++) <$> go v v' <*> goObj ks vs+ Nothing -> error "raise pattern match failure"+ go pat val = error $ "unimplemented pattern-matching:\n" ++ show pat ++ "\n" ++ show val++ifz :: Val -> Val -> Val -> Val+ifz (Nm x) | x == 0 = const+ | otherwise = ignore+ifz _ = ignore+ignore x y = y+++------ Relational ------+eq :: Val -> Val -> Fallible Val+eq (Nm a) (Nm b) = Right . mkInt $ if a == b then 1 else 0+eq _ _ = error "TODO eq"++neq :: Val -> Val -> Fallible Val+neq (Nm a) (Nm b) = Right . mkInt $ if a == b then 1 else 0+neq _ _ = error "TODO neq"++lt :: Val -> Val -> Fallible Val+lt (Nm a) (Nm b) = Right . mkInt $ if a < b then 1 else 0++lte :: Val -> Val -> Fallible Val+lte (Nm a) (Nm b) = Right . mkInt $ if a <= b then 1 else 0++gt :: Val -> Val -> Fallible Val+gt (Nm a) (Nm b) = Right . mkInt $ if a > b then 1 else 0++gte :: Val -> Val -> Fallible Val+gte (Nm a) (Nm b) = Right . mkInt $ if a >= b then 1 else 0+++------ Arithmetic ------+add :: Val -> Val -> Fallible Val+add (Nm a) (Nm b) = Right . Nm $ a + b+add _ _ = Left (error "TODO")++sub :: Val -> Val -> Fallible Val+sub (Nm a) (Nm b) = Right . Nm $ a - b+sub _ _ = Left (error "TODO")++mul :: Val -> Val -> Fallible Val+mul (Nm a) (Nm b) = Right . Nm $ a * b+mul _ _ = Left (error "TODO")++div :: Val -> Val -> Fallible Val+div (Nm a) (Nm b) = Right . Nm $ a / b+div _ _ = Left (error "TODO")++--quo :: Val -> Val -> Maybe Val+--quo = error "TODO"++--rem :: Val -> Val -> Maybe Val+--rem = error "TODO"++--quorem :: Val -> Val -> Maybe Val+--quorem = error "TODO"+++------ Rationals ------+numer :: Val -> Fallible Val+numer (Nm n) = Right . mkInt $ numerator n+numer _ = Left (error "TODO")++denom :: Val -> Fallible Val+denom (Nm n) = Right . mkInt $ denominator n+denom _ = Left (error "TODO")++trunc :: Val -> Fallible Val+trunc (Nm n) = Right . mkInt $ truncate n+trunc _ = Left (error "TODO")++numParts :: Val -> Fallible Val+numParts (Nm n) = let (whole, frac) = properFraction n+ in Right $ mkSq [mkInt whole, Nm frac]+numParts _ = Left (error "TODO")+++------ Floats ------+++------ Sequence/Text/Bytes ------+len :: Val -> Fallible Val+len (Sq xs) = Right . mkInt $ Seq.length xs+len (Tx xs) = Right . mkInt $ T.length xs+len (By xs) = Right . mkInt $ BS.length xs+len _ = Left (error "TODO")++cat :: Val -> Val -> Fallible Val+cat (Sq xs) (Sq ys) = Right . Sq $ xs <> ys+cat (Tx xs) (Tx ys) = Right . Tx $ xs <> ys+cat (By xs) (By ys) = Right . By $ xs <> ys+cat _ _ = Left (error "TODO")++cut :: Val -> Val -> Fallible Val --FIXME I guess I really need to return (Either Val Val), where the left is an exception to raise+cut x (Nm q) = + case x of+ Sq xs -> do+ i <- n+ when (i >= Seq.length xs) $ Left (error "TODO")+ let (as, bs) = Seq.splitAt i xs+ Right $ mkSq [Sq as, Sq bs]+ Tx xs -> do+ i <- n+ when (i >= T.length xs) $ Left (error "TODO")+ let (as, bs) = T.splitAt i xs+ Right $ mkSq [Tx as, Tx bs]+ By xs -> do+ i <- n+ when (i >= BS.length xs) $ Left (error "TODO")+ let (as, bs) = BS.splitAt i xs+ Right $ mkSq [By as, By bs]+ where+ n = if denominator q == 1 then Right (fromIntegral $ numerator q) else Left (error "TODO")+++------ Xons ------+{-| @get x f@ retrieves field @f@ from @x@, if the field exists. -}+get :: Val -> Val -> Fallible Val+get (Ob ob) (Sy sy) = maybe (Left (error "TODO")) Right $ Map.lookup sy ob+get _ _ = Left (error "TODO")++{-| Get a list of the fields in a value. -}+keys :: Val -> Fallible Val+keys (Ob ob) = Right . mkSq $ Sy <$> Map.keys ob+keys _ = Right $ mkSq []++{-| @extend a b@ extends and overwrites bindings in @b@ with bindings in @a@. -}+extend :: Val -> Val -> Val+extend (Ob ob') (Ob ob) = Ob $ Map.union ob' ob+extend _ (Ob ob) = (Ob ob)+extend (Ob ob') _ = Ob ob'+extend _ _ = mkOb []++{-| @delete x f@ removes field @f@ from @x@, if the field exists.+ If it does not exist, then there is no change.+-}+delete :: Val -> Val -> Fallible Val+delete (Ob ob) (Sy sy) = Right . Ob $ Map.delete sy ob+delete x _ = Right x+++
+ Octopus/Shortcut.hs view
@@ -0,0 +1,25 @@+module Octopus.Shortcut where++import Import+import qualified Data.Sequence as Seq+import qualified Data.Map as Map++import Octopus.Data+++mkInt :: Integral a => a -> Val+mkInt = Nm . fromIntegral++mkSy :: String -> Val+mkSy = Sy . intern++mkSq :: [Val] -> Val+mkSq = Sq . Seq.fromList++mkOb :: [(Symbol, Val)] -> Val+mkOb = Ob . Map.fromList+++fromEnv :: Val -> Map Symbol Val+fromEnv (Ob ob) = ob+fromEnv _ = Map.empty
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ main.hs view
@@ -0,0 +1,94 @@+import System.IO+import System.Environment+import System.Exit+import Control.Applicative+import Control.Concurrent.MVar++import Octopus+import Octopus.Parser+import Octopus.Libraries++import qualified Data.Map as Map++main :: IO ()+main = do+ --parse_e <- parseOctopusFile "foo.oct" <$> readFile "test/foo.oct"+ --case parse_e of+ -- Left err -> print err+ -- Right val -> do+ -- print val+ -- print =<< eval startData val+ --exitSuccess++ test "do four: 4 ((vau x x) four);"+ test "do four: 4 ((vau x (__eval__ x)) four);"+ test "((vau [e, ast] e) dne)"+ test "((vau [e, ast] ast) dne)"+ test "(__extends__ [{a: 3}, {a: 2}, {a: 1}])"+ test "((vau [e, ast] (__eval__ [__extends__ [{five: 5}, e], ast])) five)"+ test "do four: 4 (vau [{}, ob] (__keys__ ob) {foo: 3, bar: four});"+ test "do four: 4 ((vau [e, ob] (:x ob)) {x: four});"+ test "do four: 4 ((vau [e, ob] (__eval__ [e, :x ob])) {x: four});"+ test $ "do four: 4 (" ++ lambda ++ " ob (:x ob) {x: four});"+ test $ "(" ++ lambda ++ " eight eight 8)"+ test $ "("++letin++" eight 8 eight)"+ + test $ "("++lambda++" let 2 "++letin++")"+ test $ "("++lambda++" let (let x 2 x) "++letin++")"+ test $ "("++lambda++" lambda 2 "++lambda++")"+ test $ "("++lambda++" lambda (lambda x x 2) "++lambda++")"+ test "(__let__ let __let__ (let x 3 x))"+ test "(__let__ let __let__ (let x let (x y 3 y)))"+ test "(__let__ let __let__ (let x let (x x 3 x)))"+ test "(__lambda__ x x 7)"+ test "(__lambda__ \955 (\955 x 7 \955) __lambda__)"+ test "(__let__ \955 __lambda__ (\955 x (\955 x x) 2 7))"+ test "((__lambda__ __\955__ ((__\955__ \955 ((\955 x x) 7)) __\955__)) __lambda__)"++ --TODO MAYBE this stuff could be the real definitions of let/lambda, but I've already got them built-in to the start environment (__let__ for good reason)+ --test $ "("++lambda++" __\955__ (__\955__ \955 2) "++lambda++")"+ --test $ "("++lambda++" __\955__ (__\955__ \955 2 __\955__) "++lambda++")"+ --test $ "("++lambda++" __let__ (__let__ let __let__ 2) "++letin++")"+ test $ "("++letin++" let "++letin++" (let x 2 x))"+ test "[__lambda__ x x 3, __lambda__ y y 4]" --[3, 4]++ test "do \955: __lambda__\n x: 1 \n (\955 x x 3)\n y: 2\n [x, y];" --[1, 2]+ test "(__del__ [{x: 1, y: 2}, `y])"+ test "do \955: __lambda__\n\+ \ delete: (\955 ob (vau [{}, field] (__del__ [ob, field])))\n\+ \ (delete {x: 1, y: 2} x);"+ test "do x: do \955: __lambda__\n\+ \ (\955 y y 3);\n\+ \ x;"+ test "do defx: (__let__ x)\n\+ \ (defx 5 x);"+ test "do defx5: (__let__ x 5)\n\+ \ (defx5 x);"+ test "do [a, b, c]: [`there, `Bob, `hi] [c, a, b];"++ test "do x: (__add__ [1, 2])\n y: (__sub__ [1, 2])\n z: (__mul__ [2, 3])\n w: (__div__ [2, 3])\n [x, y, z, w];"+ test "do [a, b]: (__cut__ [[1, 2, 3, 4, 5], 3])\n [a, b, __len__ a];"+ test "do [a, b]: (__cut__ [\"hello\", 3])\n [a, b, __len__ a];"+ test "do y: (__ifz!__ [0, `y, `n])\n n: (__ifz!__ [1, `y, `n])\n [y, n];"++ test "do {\955: \955}: (__import__ \"./test/foo.oct\") (\955 x x 6);"+++lambda = "(vau [{}, var] (vau [static, ast] (vau arg (__eval__ [__extends__ [__match__ [var, __eval__ arg], static], ast ]))))"+letin = "(vau [{}, x] (vau val (vau [e, body] (__eval__ [__extends__ [__match__ [x, __eval__ val], e], body]))))"++++--TODO+--dot-infixing as normal+--colon-infixing also desugars into a getter++testParse input = case parseOctopusExpr "" input of+ Right val -> print val+ Left err -> print err+test input = do+ putStr $ input ++ " ===> "+ cache <- newMVar Map.empty+ case parseOctopusExpr "repl" input of+ Right val -> print =<< eval cache startData val+ Left err -> print err
+ octopus.cabal view
@@ -0,0 +1,52 @@+-- Initial octopus.cabal generated by cabal init. For further +-- documentation, see http://haskell.org/cabal/users-guide/++name: octopus+version: 0.0.1.0+synopsis: A 100-year language inspired by Kernel, JSON, Clojure, Arc and science.+description: Octopus is a highly dynamic programming language with an astounding (I think)+ power-to-weight ratio (expressivity-to-complexity). With just a handful of+ simple primitives, Octopus provides a complete programming environment. Its+ main focus is on complete programmer control, not on performance or static+ analysis. While the user can shoot themselves, the most natural methods will+ be the most reasonable.+homepage: https://github.com/Zankoku-Okuno/octopus/+license: GPL-3+license-file: LICENSE+author: Zankoku Okuno+maintainer: zankoku.okuno@gmail.com+-- copyright: +category: Language+build-type: Simple+cabal-version: >=1.8++library+ exposed-modules: Octopus,+ Octopus.Data,+ Octopus.Shortcut+ Octopus.Parser,+ Octopus.Basis,+ Octopus.Primitive,+ Octopus.Libraries+ build-depends: base ==4.6.*,+ bytestring ==0.10.*,+ text ==0.11.*,+ containers ==0.5.*,+ array ==0.4.*,+ symbol ==0.2.1,+ mtl ==2.1.*,+ parsec ==3.1.*,+ hexpr ==0.0.0.0++executable octopus+ main-is: main.hs+ -- other-modules: + build-depends: base ==4.6.*,+ bytestring ==0.10.*,+ text ==0.11.*,+ containers ==0.5.*,+ array ==0.4.*,+ symbol ==0.2.1,+ mtl ==2.1.*,+ parsec ==3.1.*,+ hexpr ==0.0.0.0