array-forth (empty) → 0.2.0.2
raw patch · 14 files changed
+1532/−0 lines, 14 filesdep +MonadRandomdep +OddWorddep +array-forthsetup-changed
Dependencies added: MonadRandom, OddWord, array-forth, base, mcmc-synthesis, split, vector
Files
- LICENSE +675/−0
- Setup.hs +2/−0
- array-forth.cabal +82/−0
- src/Language/ArrayForth/Distance.hs +32/−0
- src/Language/ArrayForth/Interpreter.hs +117/−0
- src/Language/ArrayForth/NativeProgram.hs +103/−0
- src/Language/ArrayForth/Opcode.hs +91/−0
- src/Language/ArrayForth/Parse.hs +29/−0
- src/Language/ArrayForth/Program.hs +137/−0
- src/Language/ArrayForth/Stack.hs +31/−0
- src/Language/ArrayForth/State.hs +78/−0
- src/Language/ArrayForth/Synthesis.hs +65/−0
- src/Main.hs +44/−0
- src/Run.hs +46/−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>.+
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ array-forth.cabal view
@@ -0,0 +1,82 @@+-- Initial arrayForth.cabal generated by cabal init. For further +-- documentation, see http://haskell.org/cabal/users-guide/++-- The name of the package.+name: array-forth++-- The package version. See the Haskell package versioning policy (PVP) +-- for standards guiding when and how versions should be incremented.+-- http://www.haskell.org/haskellwiki/Package_versioning_policy+-- PVP summary: +-+------- breaking API changes+-- | | +----- non-breaking API additions+-- | | | +--- code changes with no API change+version: 0.2.0.2++-- A short (one-line) description of the package.+synopsis: A simple interpreter for arrayForth, the language used on GreenArrays chips.++description: This is a package for working with arrayForth. This is a variant of Forth used by GreenArrays chips. This package contains an arrayForth simulator, two different representations of arrayForth programs and some utilities like parsing. ++ It also supports synthesizing arrayForth programs using MCMC. The basic idea is to find arrayForth programs by taking a simple prior distribution of programs and using a randomized hill-climbing algorithm to find a program fulfilling certain tests.++-- A longer description of the package.+-- description: ++-- The license under which the package is released.+license: GPL-3++-- The file containing the license text.+license-file: LICENSE++-- The package author(s).+author: Tikhon Jelvis <tikhon@jelv.is>++-- An email address to which users can send suggestions, bug reports, and +-- patches.+maintainer: tikhon@jelv.is++-- A copyright notice.+-- copyright: ++category: Language++build-type: Simple++-- Constraint on the version of Cabal needed to build this package.+cabal-version: >=1.8++source-repository head+ type: git+ location: git://github.com/TikhonJelvis/array-forth.git++library+ -- Modules exported by the library.+ exposed-modules: Language.ArrayForth.Distance, + Language.ArrayForth.Interpreter,+ Language.ArrayForth.NativeProgram,+ Language.ArrayForth.Opcode,+ Language.ArrayForth.Parse,+ Language.ArrayForth.Program,+ Language.ArrayForth.Stack,+ Language.ArrayForth.State,+ Language.ArrayForth.Synthesis+ + hs-source-dirs: src+ -- Modules included in this library but not exported.+ -- other-modules: + + -- Other library packages from which modules are imported.+ build-depends: base ==4.5.*, mcmc-synthesis >=0.1, MonadRandom ==0.1.*,+ OddWord >=1.0.0, split ==0.1.*, vector ==0.9.*+ GHC-options: -Wall -funbox-strict-fields -fno-warn-orphans -rtsopts++executable mcmc-demo+ Main-is: src/Main.hs+ build-depends: base ==4.5.*, mcmc-synthesis >=0.1, array-forth,+ MonadRandom ==0.1.*+ GHC-options: -Wall -rtsopts++executable array-forth+ Main-is: src/Run.hs+ build-depends: base ==4.5.*, vector ==0.9.*, split ==0.1.*, array-forth+ GHC-options: -Wall -rtsopts
+ src/Language/ArrayForth/Distance.hs view
@@ -0,0 +1,32 @@+module Language.ArrayForth.Distance where++import Data.Bits (Bits, popCount, xor)++import Language.ArrayForth.Opcode (F18Word)+import Language.ArrayForth.State++-- | A function that computes a measure of "distance" between two+-- states. The larger the returned number, the more different the+-- states.+type Distance = State -> State -> Double++-- | Counts the number of bits that differ between two numbers.+countBits :: (Integral n, Bits n) => n -> n -> Int+countBits n₁ n₂ = popCount $ (fromIntegral n₁ :: Int) `xor` fromIntegral n₂++-- | Return a distance function that counts the different bits between+-- the given registers. You could use it like `compareRegisters [s, t]`.+registers :: [State -> F18Word] -> Distance+registers regs s₁ s₂ = fromIntegral . sum $ zipWith countBits (go s₁) (go s₂)+ where go state = map ($ state) regs++-- | Returns a distance function that counts the different bits+-- between the given memory locations.+locations :: [F18Word] -> Distance+locations addresses s₁ s₂ = fromIntegral . sum $ zipWith countBits (go s₁) (go s₂)+ where go state = map (memory state !) addresses++-- | Combines multiple distance functions to create a new one, by+-- summing the different distances.+distances :: [Distance] -> Distance+distances dists s₁ s₂ = sum [dist s₁ s₂ | dist <- dists]
+ src/Language/ArrayForth/Interpreter.hs view
@@ -0,0 +1,117 @@+{-# LANGUAGE NamedFieldPuns #-}+module Language.ArrayForth.Interpreter where++import Data.Bits (bit, bitSize, complement,+ shift, testBit, xor, (.&.),+ (.|.))++import Language.ArrayForth.NativeProgram+import Language.ArrayForth.Opcode+import Language.ArrayForth.State++-- | Runs a single word's worth of instructions starting from the given state.+word :: Instrs -> State -> State+word (Instrs a b c d) state = let s₁ = execute a state+ s₂ = if endWord a then s₁ else execute b s₁+ s₃ = if endWord a || endWord b+ then s₂ else execute c s₂ in+ if endWord a || endWord b || endWord c then s₃ else execute d s₃+word (Jump3 a b c addr) state = let s₁ = execute a state+ s₂ = if endWord a then s₁ else execute b s₁ in+ if endWord a || endWord b then s₂ else jump c addr s₂+word (Jump2 a b addr) state = let s' = execute a state in+ if endWord a then s' else jump b addr s'+word (Jump1 a addr) state = jump a addr state+word (Constant _) _ = error "Cannot execute a constant!"++-- | Executes a single instruction in the given state, incrementing+-- the program counter.+step :: State -> State+step state@State {p} = word (next state) $ state {p = p + 1, i = toBits $ next state}++-- | Returns a trace of the program's execution. The trace is a list+-- of the state of the chip after each step.+traceProgram :: State -> [State]+traceProgram = iterate step++-- | Trace a program until it either hits four nops or all 0s.+stepProgram :: State -> [State]+stepProgram = takeWhile (not . done) . traceProgram+ where done state = i state == 0x39ce7 || i state == 0++-- | Runs the program unil it hits a terminal state, returning only+-- the resulting state.+eval :: State -> State+eval state = last $ state : stepProgram state++-- | Executes the specified program on the given state until it hits a+-- "terminal" word--a word made up of four nops or all 0s.+runNativeProgram :: State -> NativeProgram -> State+runNativeProgram start program = eval $ setProgram 0 program start++-- | Estimates the execution time of a program trace.+countTime :: [State] -> Double+countTime = runningTime . map (fromBits . i)++-- | Checks that the program trace terminated in at most n steps,+-- returning Nothing otherwise.+throttle :: Int -> [State] -> Either [State] [State]+throttle n state | null res = Right [startState]+ | length res == n = Left res+ | otherwise = Right res+ where res = take n state++-- | Does the given opcode cause the current word to stop executing?+endWord :: Opcode -> Bool+endWord = (`elem` [Ret, Exec, Jmp, Call, Unext, Next, If, MinusIf])++-- | Executes an opcode on the given state.+execute :: Opcode -> State -> State+execute op state@State {a, b, p, r, s, t, memory} = case op of+ Ret -> fst . rpop $ state {p = r}+ Exec -> state {r = p, p = r}+ Unext -> if r == 0 then fst $ rpop state else state {r = r - 1, p = p - 1}+ FetchP -> dpush (state {p = p + 1}) $ memory ! p+ FetchPlus -> dpush (state {a = a + 1}) $ memory ! a+ FetchB -> dpush state $ memory ! b+ Fetch -> dpush state $ memory ! a+ StoreP -> state' {p = p + 1, memory = set memory p top}+ StorePlus -> state' {a = a + 1, memory = set memory a top}+ StoreB -> state' {memory = set memory b top}+ Store -> state' {memory = set memory a top}+ MultiplyStep -> multiplyStep+ Times2 -> state {t = t `shift` 1}+ Div2 -> state {t = t `shift` (-1)}+ Not -> state {t = complement t}+ Plus -> state' {t = s + t}+ And -> state' {t = s .&. t}+ Or -> state' {t = s `xor` t}+ Drop -> fst $ dpop state+ Dup -> dpush state t+ Pop -> let (s', res) = rpop state in dpush s' res+ Over -> dpush state s+ ReadA -> dpush state a+ Nop -> state+ Push -> rpush state' top+ SetB -> state' {b = top}+ SetA -> state' {a = top}+ _ -> error "Cannot jump without an address!"+ where (state', top) = dpop state+ multiplyStep+ | even a = let t0 = (t .&. 1) `shift` (bitSize t - 1) in+ state { a = t0 .|. a `shift` (-1)+ , t = t .&. bit 17 .|. t `shift` (-1)}+ | otherwise = let sum0 = (s + t) `shift` (bitSize t - 1)+ sum17 = (s + t) .&. bit 17 in+ state { a = sum0 .|. a `shift` (-1)+ , t = sum17 .|. (s + t) `shift` (-1) }++-- | Execute a jump instruction to the given address.+jump :: Opcode -> F18Word -> State -> State+jump op addr state@State{p, r, t} = case op of+ Jmp -> state {p = addr}+ Call -> (rpush state p) {p = addr}+ Next -> if r == 0 then fst $ rpop state else state {r = r - 1, p = addr}+ If -> if t /= 0 then state {p = addr} else state+ MinusIf -> if t `testBit` pred (bitSize (0 :: F18Word)) then state else state {p = addr}+ _ -> error "Non-jump instruction given a jump address!"
+ src/Language/ArrayForth/NativeProgram.hs view
@@ -0,0 +1,103 @@+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE OverlappingInstances #-}+{-# LANGUAGE TypeSynonymInstances #-}+module Language.ArrayForth.NativeProgram where++import Control.Applicative ((<$>), (<*>))+import Control.Monad ((<=<))++import Data.Bits (shift, (.&.), (.|.))+import Data.List.Split (chunk, keepDelimsR, split, whenElt)+import Data.String (IsString, fromString)++import Language.ArrayForth.Opcode+import Language.ArrayForth.Parse++-- | Represents a word in memory. This word can either contain+-- opcodes, opcodes and a jump address or just a constant number.+data Instrs = Instrs Opcode Opcode Opcode Opcode+ | Jump3 Opcode Opcode Opcode F18Word+ | Jump2 Opcode Opcode F18Word+ | Jump1 Opcode F18Word+ | Constant F18Word deriving (Eq)++instance Show Instrs where+ show (Instrs a b c d) = unwords $ map show [a, b, c, d]+ show (Jump3 a b c addr) = unwords (map show [a, b, c]) ++ " " ++ show addr+ show (Jump2 a b addr) = unwords (map show [a, b]) ++ " " ++ show addr+ show (Jump1 a addr) = show a ++ " " ++ show addr+ show (Constant n) = show n+ showList = (++) . unwords . map show++-- | A program in the F18A instruction set.+type NativeProgram = [Instrs]++-- | Splits a list into chunks of at most four, breaking off a chunk+-- whenever it sees an element matching the given predicate. This is+-- useful for splitting a program along word boundaries, accounting+-- for jump addresses.+splitWords :: (a -> Bool) -> [a] -> [[a]]+splitWords isNum = chunk 4 <=< split (keepDelimsR $ whenElt isNum)++-- | Read a whole program, splitting instructions up into words.+readNativeProgram :: String -> Either ParseError NativeProgram+readNativeProgram = mapM go . splitWords isNumber . words+ where go [a, b, c, d] = do c' <- readOpcode c+ if not $ isJump c'+ then Instrs <$> op a <*> op b <*> op c <*> op3 d+ else Jump3 <$> op a <*> op b <*> jump c <*> readWord d+ go [a, b, c] = Jump2 <$> op a <*> jump b <*> readWord c+ go [a, b] = Jump1 <$> jump a <*> readWord b+ go [a] = Constant <$> readWord a+ go _ = error "Wrong number of instruction tokens!"+ wrap cond err str = do code <- readOpcode str+ if cond code then Right code else Left $ err code+ op = wrap (not . isJump) $ NoAddr . show+ op3 = wrap slot3 $ NotSlot3 . show+ jump = wrap isJump $ NotJump . show++instance Read NativeProgram where+ readsPrec _ str = [(result, "")]+ where result = case readNativeProgram str of+ Right res -> res+ Left err -> error $ show err++instance IsString NativeProgram where fromString = read++-- | Returns the given instructions as an actual word. This assumes+-- the address is sized appropriately.+toBits :: Instrs -> F18Word+toBits (Instrs a b c d) = fromOpcode a `shift` 13 .|. fromOpcode b `shift` 8 .|.+ fromOpcode c `shift` 3 .|. fromOpcode d `shift` (-2)+toBits (Jump3 a b c addr) = fromOpcode a `shift` 13 .|. fromOpcode b `shift` 8 .|.+ fromOpcode c `shift` 3 .|. addr+toBits (Jump2 a b addr) = fromOpcode a `shift` 13 .|. fromOpcode b `shift` 8 .|. addr+toBits (Jump1 a addr) = fromOpcode a `shift` 13 .|. addr+toBits (Constant n) = n++-- | Reads in a word as a set of opcodes.+fromBits :: F18Word -> Instrs+fromBits n | isJump a = Jump1 a $ n .&. 0x3FF+ | isJump b = Jump2 a b $ n .&. 0xFF+ | isJump c = Jump3 a b c $ n .&. 0x7+ | otherwise = Instrs a b c d+ where a = toOpcode $ n `shift` (-13)+ b = toOpcode $ n `shift` (-8) .&. 0x1F+ c = toOpcode $ n `shift` (-3) .&. 0x1F+ d = toOpcode $ (n .&. 0x7) `shift` 2++-- | Returns the opcodes in the given instruction word. A constant+-- corresponds to not having any opcodes.+toOpcodes :: Instrs -> [Opcode]+toOpcodes (Instrs a b c d) = [a, b, c, d]+toOpcodes (Jump3 a b c _) = [a, b, c]+toOpcodes (Jump2 a b _) = [a, b]+toOpcodes (Jump1 a _) = [a]+toOpcodes Constant{} = []++-- | Estimates the running time of the program in nanoseconds. This is+-- based on the numbers provided in the manual: faster instructions+-- take 1.5 nanoseconds and slower ones take 5. For now, this estimate+-- ignores control flow like ifs and loops.+runningTime :: NativeProgram -> Double+runningTime = sum . map opcodeTime . reverse . dropWhile (== Nop) . reverse . concatMap toOpcodes
+ src/Language/ArrayForth/Opcode.hs view
@@ -0,0 +1,91 @@+module Language.ArrayForth.Opcode where++import Data.List (elemIndex)+import Data.Word.Odd (Word18)++import Language.ArrayForth.Parse (ParseError (..))++-- | The 18-bit word type used by Greenarrays chips.+type F18Word = Word18++-- | Each F18A instruction, ordered by opcode.+data Opcode = Ret -- ;+ | Exec -- ex+ | Jmp -- name ;+ | Call -- name+ | Unext -- unext+ | Next -- next+ | If -- if+ | MinusIf -- -if+ | FetchP -- @p+ | FetchPlus -- @++ | FetchB -- @b+ | Fetch -- @+ | StoreP -- !p+ | StorePlus -- !++ | StoreB -- !b+ | Store -- !+ | MultiplyStep -- +*+ | Times2 -- 2*+ | Div2 -- 2/+ | Not -- -+ | Plus -- ++ | And -- and+ | Or -- or+ | Drop -- drop+ | Dup -- dup+ | Pop -- pop+ | Over -- over+ | ReadA -- a+ | Nop -- .+ | Push -- push+ | SetB -- b!+ | SetA -- a!+ deriving (Eq, Bounded, Enum)++-- | The names of the different instructions, ordered by opcode.+names :: [String]+names = [";", "ex", "jump", "call", "unext", "next", "if", "-if", "@p", "@+", "@b", "@",+ "!p", "!+", "!b", "!", "+*", "2*", "2/", "-", "+", "and", "or", "drop", "dup",+ "pop", "over", "a", ".", "push", "b!", "a!"]++-- | All of the opcodes, in order.+opcodes :: [Opcode]+opcodes = [minBound..maxBound]++instance Show Opcode where show op = names !! fromEnum op++-- | Tries to read a given string as an opcode from the list of names.+readOpcode :: String -> Either ParseError Opcode+readOpcode token = case elemIndex token names of+ Just res -> Right $ toEnum res+ Nothing -> Left $ BadOpcode token++instance Read Opcode where readsPrec _ str = case readOpcode str of+ Left err -> error $ show err+ Right r -> [(r, "")]++-- | Converts a word to an opcode. The word has to be < 32.+toOpcode :: F18Word -> Opcode+toOpcode = toEnum . fromIntegral++-- | Converts an Opcode to its 18-bit word representation.+fromOpcode :: Opcode -> F18Word+fromOpcode = fromIntegral . fromEnum++-- | Returns whether the given opcode is a jump instruction expecting+-- an address.+isJump :: Opcode -> Bool+isJump = (`elem` [Jmp, Call, Next, If, MinusIf])++-- | Can the given opcode go in the last slot?+slot3 :: Opcode -> Bool+slot3 = (`elem` [Ret, MultiplyStep, Unext, Plus, FetchP, Dup, StoreP, Nop])++-- | Estimates how long a given opcode will take to execute. Normal+-- opcodes take 1.5 nanoseconds where ones that access the memory take+-- 5 nanoseconds.+opcodeTime :: Opcode -> Double+opcodeTime op = if memoryOp op then 5 else 1.5+ where memoryOp = (`elem` [FetchP, FetchPlus, FetchB, Fetch, StoreP,+ StorePlus, StoreB, Store])
+ src/Language/ArrayForth/Parse.hs view
@@ -0,0 +1,29 @@+module Language.ArrayForth.Parse (ParseError (..), isNumber, readWord) where++import Text.Printf (printf)++-- | Possible ways the input string can be malformed.+data ParseError = BadOpcode String+ | NotSlot3 String+ | NotJump String+ | NoAddr String+ | BadNumber String++instance Show ParseError where+ show (BadOpcode op) = printf "Invalid opcode `%s'." op+ show (NotSlot3 op) = printf "`%s' cannot go into the last slot." op+ show (NotJump op) =+ printf "`%s' is not a jump instruction and cannot get an address." op+ show (NoAddr op) = printf "Missing a jump address for `%s'" op+ show (BadNumber n) = printf "`%s' is not a valid number." n++-- | Is the given string a valid number with no other tokens?+isNumber :: String -> Bool+isNumber str = let asNumber = reads str :: [(Integer, String)] in+ not (null asNumber) && (null . snd $ head asNumber)++-- | Tries to read a word, giving an error if it fails.+readWord :: Read a => String -> Either ParseError a+readWord str = case reads str of+ (x, _) : _ -> Right x+ [] -> Left $ BadNumber str
+ src/Language/ArrayForth/Program.hs view
@@ -0,0 +1,137 @@+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE OverlappingInstances #-}+{-# LANGUAGE TypeSynonymInstances #-}+module Language.ArrayForth.Program where++import Control.Monad ((<=<))++import Data.Functor ((<$>))+import Data.List (find, (\\))+import Data.String (IsString, fromString)++import Language.ArrayForth.Interpreter+import Language.ArrayForth.NativeProgram+import Language.ArrayForth.Opcode+import qualified Language.ArrayForth.Parse as P+import Language.ArrayForth.State (State, setProgram)++data Addr = Concrete F18Word | Abstract String deriving Eq++instance Show Addr where+ show (Concrete n) = show n+ show (Abstract s) = ':' : s++-- | Represents a single instruction as viewed by the+-- synthesizer. This can be an opcode, a numeric literal or a token+-- representing an unused slot.+data Instruction = Opcode Opcode+ | Jump Opcode Addr+ | Number F18Word+ | Label String+ | Unused deriving Eq++-- | A program to be manipulated by the MCMC synthesizer+type Program = [Instruction]++instance Show Instruction where+ show (Opcode op) = show op+ show (Jump op addr) = show op ++ " " ++ show addr+ show (Number n) = show n+ show (Label s) = ':' : s+ show Unused = "_"+ showList = (++) . unwords . map show++-- | Tries to parse the given string as an instruction, which can+-- either be a number, an opcode or "_" representing Unused.+readInstruction :: String -> Either P.ParseError Instruction+readInstruction "_" = Right Unused+readInstruction (':':label) = Right $ Label label+readInstruction str | P.isNumber str = Number <$> P.readWord str+ | otherwise = Opcode <$> readOpcode str++-- | Reads a program in the synthesizer's format.+readProgram :: String -> Either P.ParseError Program+readProgram = fixJumps <=< mapM readInstruction . words+ where fixJumps [] = Right []+ fixJumps (Opcode op : rest) | isJump op = case rest of+ Number n : program -> (Jump op (Concrete n) :) <$> fixJumps program+ Label s : program -> (Jump op (Abstract s) :) <$> fixJumps program+ _ -> Left . P.NoAddr $ show op+ fixJumps (good : rest) = (good :) <$> fixJumps rest++instance Read Program where+ readsPrec _ str = [(result, "")]+ where result = case readProgram str of+ Right res -> res+ Left err -> error $ show err++instance IsString Program where fromString = read++-- | Takes a program as handled by the synthesizer and makes it native+-- by turning literal numbers into @p and fixing any issues with+-- instructions going into the last slot as well as prepending+-- nops before + instructions.+toNative :: Program -> NativeProgram+toNative = (>>= toInstrs) . splitWords bound . fixSlot3 . (>>= nopsPlus) . labels . filter (/= Unused)+ where labels program = map convert $ filter (not . label) program+ where label Label{} = True+ label _ = False+ values = go 0 program+ go _ [] = []+ go n (Label name : rest) = (name, n) : go n rest+ go n (_ : rest) = go (n + 1) rest+ convert (Jump op (Abstract l)) = maybe (error $ "Unknown label " ++ l)+ (Jump op . Concrete) $ lookup l values+ convert x = x+ nop = Opcode Nop+ bound Jump{} = True+ bound _ = False+ nopsPlus (Opcode Plus) = [nop, Opcode Plus]+ nopsPlus x = [x]+ fixSlot3 program+ | length program < 4 = program+ | validOp4 = take 4 program ++ fixSlot3 (drop 4 program)+ | otherwise = take 3 program ++ [nop] ++ fixSlot3 (drop 3 program)+ where validOp4 = case program !! 3 of Opcode op -> slot3 op+ Number{} -> True+ _ -> False+ toInstrs ls = let (ops, numbers) = addFetchP ls in+ convert ops : map (\ (Number n) -> Constant n) numbers+ addFetchP [] = ([], [])+ addFetchP (n@Number{} : rest) =+ let (instrs, consts) = addFetchP rest in (Opcode FetchP : instrs, n : consts)+ addFetchP (instr : rest) =+ let (instrs, consts) = addFetchP rest in (instr : instrs, consts)+ convert [Opcode a, Opcode b, Opcode c, Opcode d] = Instrs a b c d+ convert [Opcode a, Opcode b, Jump c addr] = Jump3 a b c $ concrete addr+ convert [Opcode a, Jump b addr] = Jump2 a b $ concrete addr+ convert [Jump a addr] = Jump1 a $ concrete addr+ convert instrs = convert . take 4 $ instrs ++ repeat nop+ concrete Abstract{} = error "Need concrete address at this stage."+ concrete (Concrete addr) = addr++-- | Gets a synthesizer program from a native program. Currently does+-- not support jumps.+fromNative :: NativeProgram -> Program+fromNative = fixNumbers . concatMap extract+ where extract (Instrs a b c d) = [Opcode a, Opcode b, Opcode c, Opcode d]+ extract (Jump3 a b c addr) = [Opcode a, Opcode b, Jump c $ Concrete addr]+ extract (Jump2 a b addr) = [Opcode a, Jump b $ Concrete addr]+ extract (Jump1 a addr) = [Jump a $ Concrete addr]+ extract (Constant n) = [Number n]+ fixNumbers [] = []+ fixNumbers (Opcode FetchP : rest) = case find isNumber rest of+ Just n -> n : (fixNumbers $ rest \\ [n])+ Nothing -> Opcode FetchP : fixNumbers rest+ fixNumbers (x : rest) = x : fixNumbers rest+ isNumber Number{} = True+ isNumber _ = False++-- | Runs a given program from the default starting state.+runProgram :: State -> Program -> State+runProgram start = runNativeProgram start . toNative++-- | Loads the given synthesizer-friendly program into the given+-- state.+load :: Program -> State -> State+load prog state = setProgram 0 (toNative prog) state
+ src/Language/ArrayForth/Stack.hs view
@@ -0,0 +1,31 @@+{-# LANGUAGE BangPatterns #-}+module Language.ArrayForth.Stack (empty, push, pop, fill, Stack) where++import Prelude hiding ((++))++import Data.List (foldl')+import Data.Vector.Unboxed ((!), (++))+import qualified Data.Vector.Unboxed as V++import Language.ArrayForth.Opcode (F18Word)++newtype Stack = Stack (V.Vector Int) deriving (Eq)++instance Show Stack where show (Stack body) = unwords . map show $ V.toList body++-- | A stack containing only 0s.+empty :: Stack+empty = Stack $ V.replicate 8 0++-- | Pushes the given element on top of the stack, discarding the last element.+push :: Stack -> F18Word -> Stack+push !(Stack body) word = Stack . V.cons (fromIntegral word) $ V.init body++-- | Pops the top of the stack, returning the value and the new stack.+pop :: Stack -> (Stack, F18Word)+pop !(Stack body) = let x = V.take 1 body in (Stack $ V.tail body ++ x, fromIntegral $ x ! 0)++-- | Push the given elements onto the stack one-by-one.+fill :: Stack -> [F18Word] -> Stack+fill = foldl' push+
+ src/Language/ArrayForth/State.hs view
@@ -0,0 +1,78 @@+{-# LANGUAGE NamedFieldPuns #-}+module Language.ArrayForth.State where++import Data.Functor ((<$>))+import Data.Vector.Unboxed (Vector, (//))+import qualified Data.Vector.Unboxed as V++import Text.Printf (printf)++import Language.ArrayForth.NativeProgram+import Language.ArrayForth.Opcode (F18Word)+import Language.ArrayForth.Stack++-- | The chip's RAM and ROM+type Memory = Vector Int++emptyMem :: Memory+emptyMem = V.replicate 64 0++-- | A state representing the registers, stacks and memory of a core.+data State =+ State { a, b, i, p, r, s, t :: !F18Word+ , dataStack, returnStack :: !Stack+ , memory :: !Memory }++instance Show State where+ show State {p, a, b, r, s, t, dataStack} =+ printf "p:%s a:%s b:%s r:%s\n %s %s %s" p' a' b' r' t' s' (show dataStack)+ where [p', a', b', r', s', t'] = map show [p, a, b, r, s, t]++-- | The state corresponding to a core with no programs loaded and no+-- instructions executed.+startState :: State+startState = State 0 0 0 0 0 0 0 empty empty emptyMem++-- | The next word of instructions to execute in the given state.+next :: State -> Instrs+next State {memory, p} = fromBits $ memory ! p++-- | Pops the data stack of the given state, updating s and t.+dpop :: State -> (State, F18Word)+dpop state@State {s, t, dataStack} =+ let (ds', res) = pop dataStack in (state {t = s, s = res, dataStack = ds'}, t)++-- | Push a word onto the data stack, updating s and t.+dpush :: State -> F18Word -> State+dpush state@State {s, t, dataStack} word =+ state {t = word, s = t, dataStack = push dataStack s}++-- | Pops the return stack of the given state, updating r.+rpop :: State -> (State, F18Word)+rpop state@State {r, returnStack} =+ let (rs', res) = pop returnStack in (state {r = res, returnStack = rs'}, r)++-- | Push a word onto the return stack, updating r.+rpush :: State -> F18Word -> State+rpush state@State {r, returnStack} word =+ state {r = word, returnStack = push returnStack r}++-- | Force an address to be in range of memory: [0,64).+toMem :: (Integral a, Integral b) => a -> b+toMem = fromIntegral . (`mod` 64)++-- | Read the memory at a location given by a Forth word.+(!) :: Memory -> F18Word -> F18Word+memory ! i | toMem i < V.length memory = fromIntegral $ memory V.! toMem i+ | otherwise = error "Memory out of bounds."++-- | Set the memory using Forth words.+set :: Memory -> F18Word -> F18Word -> Memory+set mem index value = mem // [(toMem index, fromIntegral $ value)]++-- | Loads the given program into memory at the given starting+-- position.+setProgram :: F18Word -> NativeProgram -> State -> State+setProgram start program state@State {memory} = state' {i = toBits $ next state'}+ where state' = state {memory = memory // prog}+ prog = zip [toMem start..] (fromIntegral . toBits <$> program)
+ src/Language/ArrayForth/Synthesis.hs view
@@ -0,0 +1,65 @@+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE NamedFieldPuns #-}+{-# LANGUAGE OverlappingInstances #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeSynonymInstances #-}+module Language.ArrayForth.Synthesis where++import Control.Arrow (first)+import Control.Monad.Random (Random, random, randomR)++import Data.Functor ((<$>))+import Data.List (genericLength, (\\))++import Language.ArrayForth.Distance+import Language.ArrayForth.Interpreter+import Language.ArrayForth.Opcode+import Language.ArrayForth.Program+import Language.ArrayForth.State++import Language.Synthesis.Distribution (Distr (..), mix,+ negativeInfinity, randInt,+ uniform)+import Language.Synthesis.Mutations hiding (mix)+import qualified Language.Synthesis.Mutations as M++-- | Given a specification program and some inputs, evaluate a program+-- against the specification for both performance and correctness.+evaluate :: Program -> [State] -> Distance -> Program -> Double+evaluate spec inputs score program =+ 0.1 * (10 * sum correctness + sum performance / genericLength inputs)+ where specs = stepProgram . load spec <$> inputs+ progs = stepProgram . load program <$> inputs+ cases = zip3 (last <$> specs) (length <$> specs) (countTime <$> specs)+ (correctness, performance) = unzip $ zipWith test progs cases+ test prog (output, steps, time) = case throttle steps prog of+ Right res -> calc res+ Left res -> let (a, b) = calc res in (a - 1e10, b - 1e10)+ where calc res = (-score output (last res), time - countTime res)++-- I need this so that I can get a distribution over Forth words.+instance Random F18Word where+ randomR (start, end) gen =+ first fromInteger $ randomR (fromIntegral start, fromIntegral end) gen+ random = randomR (0, maxBound)++-- | The default distribution of instructions. For now, we do not+-- support any sort of jumps. All the other possible instructions+-- along with constant numbers and unused slots are equally+-- likely. The numeric value of constants is currently a uniform+-- distribution over 18-bit words.+defaultOps :: Distr Instruction+defaultOps = mix [(constants, 1.0), (uniform [Unused], 1.0),+ (uniform instrs, genericLength instrs)]+ where instrs = map Opcode $ filter (not . isJump) opcodes \\ [Unext, Exec, Ret]+ constants = let Distr {sample, logProbability} = randInt (0, maxBound)+ logProb (Number n) = logProbability n+ logProb _ = negativeInfinity in+ Distr { sample = Number <$> sample+ , logProbability = logProb }++-- | The default mutations to try. For now, this will either change an+-- instruction or swap two instructions in the program, with equal+-- probability.+defaultMutations :: Mutation Program+defaultMutations = M.mix [(mutateInstruction defaultOps, 1), (swapInstructions, 1)]
+ src/Main.hs view
@@ -0,0 +1,44 @@+module Main where++import Control.Monad.Random (evalRandIO)++import Data.List (find)++import Language.ArrayForth.Distance (Distance, registers)+import Language.ArrayForth.Interpreter (eval)+import Language.ArrayForth.Parse ()+import Language.ArrayForth.Program (Program, load)+import Language.ArrayForth.State (State (..), startState)+import Language.ArrayForth.Synthesis (defaultMutations, defaultOps,+ evaluate)++import qualified Language.Synthesis.Distribution as Distr+import Language.Synthesis.Synthesis (Problem (..), runningBest,+ synthesizeMhList)++main :: IO ()+main = verbose++good :: (Program, Double) -> Bool+good (_, val) = val >= 0.5++verbose :: IO ()+verbose = do ls <- evalRandIO (synthesizeMhList inclusiveOr)+ mapM_ print . zip ls . takeWhile (not . good) $ runningBest ls++run :: IO ()+run = evalRandIO (synthesizeMhList inclusiveOr) >>= print . find good . runningBest++test :: Distance -> String -> String -> State -> Double+test distance p₁ p₂ input = let r₁ = eval $ load (read p₁) input+ r₂ = eval $ load (read p₂) input in+ distance r₁ r₂++inclusiveOr :: Problem Program+inclusiveOr = Problem { score = evaluate program cases distance+ , prior = Distr.replicate 8 defaultOps+ , jump = defaultMutations }+ where program = read "over over or a! and a or"+ cases = [startState {t = 0, s = 123}, startState {t = maxBound, s = 123},+ startState {t = 1, s = 123}, startState {t = maxBound - 1, s = 123}]+ distance = registers [t]
+ src/Run.hs view
@@ -0,0 +1,46 @@+{-# LANGUAGE NamedFieldPuns #-}+module Main where++import Data.Functor ((<$))+import Data.List.Split (chunk)+import qualified Data.Vector.Unboxed as V++import Language.ArrayForth.Interpreter (eval, runNativeProgram)+import Language.ArrayForth.Parse (isNumber)+import Language.ArrayForth.Program (toNative, readProgram)+import Language.ArrayForth.State (State (..), setProgram,+ startState)++import System.Environment (getArgs)+import System.IO (hFlush, stdout)++import Text.Printf (printf)++main :: IO ()+main = do args <- getArgs+ case args of+ [] -> repl+ [file] -> readFile file >>= print . runNativeProgram startState . read+ _ -> putStrLn $ "Too many arguments!"++repl :: IO ()+repl = go 0 startState+ where go loc state =+ do inp <- putStr "λ>" >> hFlush stdout >> getLine+ case inp of+ [':'] -> putStrLn "Please specify a command!" >> go loc state+ ':' : commands -> let command : args = words commands in+ run command args >>= uncurry go+ program -> execute $ readProgram program+ where execute (Left err) = print err >> go loc state+ execute (Right program) = print res >> go p res+ where res@State {p} = eval $ setProgram loc (toNative program) state+ run "reset" _ = (0, startState) <$ print startState+ run "p" args+ | null args || not (isNumber $ head args) =+ (loc, state) <$ putStrLn "Invalid arguments!"+ | otherwise = let n = read $ head args in+ (n, state { p = n }) <$ print state { p = n }+ run cmd args = (loc, state) <$ continue cmd args+ continue "memory" _ = mapM_ print . chunk 8 . V.toList $ memory state+ continue cmd _ = printf "Unknown command `%s'!\n" cmd