comonad-coactions 0.1.0.0 → 0.1.0.1
raw patch · 11 files changed
+678/−840 lines, 11 filesdep +monad-actionsdep +mtldep +optparse-applicativedep ~adjunctionsdep ~basedep ~comonadnew-component:exe:elementarynew-component:exe:higher-rangePVP ok
version bump matches the API change (PVP)
Dependencies added: monad-actions, mtl, optparse-applicative, text
Dependency ranges changed: adjunctions, base, comonad, ghc-typelits-knownnat, template-haskell
API changes (from Hackage documentation)
Files
- LICENSE +125/−621
- comonad-coactions.cabal +99/−72
- examples/ElementaryCA.hs +9/−8
- examples/HigherRange.hs +73/−0
- examples/Life.hs +265/−75
- src/Control/Comonad/Coaction.hs +53/−40
- src/Control/Comonad/Coaction/Left.hs +11/−2
- src/Control/Comonad/Coaction/Right.hs +10/−3
- src/Control/Comonad/Coaction/TH.hs +9/−3
- src/Control/Comonad/TransformerStack.hs +22/−13
- test/Main.hs +2/−3
LICENSE view
@@ -1,661 +1,165 @@- GNU AFFERO GENERAL PUBLIC LICENSE- Version 3, 19 November 2007+ GNU LESSER 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 Affero General Public License is a free, copyleft license for-software and other kinds of works, specifically designed to ensure-cooperation with the community in the case of network server software.-- The licenses for most software and other practical works are designed-to take away your freedom to share and change the works. By contrast,-our General Public Licenses are 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.-- 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.-- Developers that use our General Public Licenses protect your rights-with two steps: (1) assert copyright on the software, and (2) offer-you this License which gives you legal permission to copy, distribute-and/or modify the software.-- A secondary benefit of defending all users' freedom is that-improvements made in alternate versions of the program, if they-receive widespread use, become available for other developers to-incorporate. Many developers of free software are heartened and-encouraged by the resulting cooperation. However, in the case of-software used on network servers, this result may fail to come about.-The GNU General Public License permits making a modified version and-letting the public access it on a server without ever releasing its-source code to the public.-- The GNU Affero General Public License is designed specifically to-ensure that, in such cases, the modified source code becomes available-to the community. It requires the operator of a network server to-provide the source code of the modified version running there to the-users of that server. Therefore, public use of a modified version, on-a publicly accessible server, gives the public access to the source-code of the modified version.-- An older license, called the Affero General Public License and-published by Affero, was designed to accomplish similar goals. This is-a different license, not a version of the Affero GPL, but Affero has-released a new version of the Affero GPL which permits relicensing under-this license.-- 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 Affero 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".+ This version of the GNU Lesser General Public License incorporates+the terms and conditions of version 3 of the GNU General Public+License, supplemented by the additional permissions listed below. - 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.+ 0. Additional Definitions. - 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.+ As used herein, "this License" refers to version 3 of the GNU Lesser+General Public License, and the "GNU GPL" refers to version 3 of the GNU+General Public License. - 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.+ "The Library" refers to a covered work governed by this License,+other than an Application or a Combined Work as defined below. - 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.+ An "Application" is any work that makes use of an interface provided+by the Library, but which is not otherwise based on the Library.+Defining a subclass of a class defined by the Library is deemed a mode+of using an interface provided by the Library. - 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 "Combined Work" is a work produced by combining or linking an+Application with the Library. The particular version of the Library+with which the Combined Work was made is also called the "Linked+Version". - 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.+ The "Minimal Corresponding Source" for a Combined Work means the+Corresponding Source for the Combined Work, excluding any source code+for portions of the Combined Work that, considered in isolation, are+based on the Application, and not on the Linked Version. - 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.+ The "Corresponding Application Code" for a Combined Work means the+object code and/or source code for the Application, including any data+and utility programs needed for reproducing the Combined Work from the+Application, but excluding the System Libraries of the Combined Work. - 12. No Surrender of Others' Freedom.+ 1. Exception to Section 3 of the GNU GPL. - 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.+ You may convey a covered work under sections 3 and 4 of this License+without being bound by section 3 of the GNU GPL. - 13. Remote Network Interaction; Use with the GNU General Public License.+ 2. Conveying Modified Versions. - Notwithstanding any other provision of this License, if you modify the-Program, your modified version must prominently offer all users-interacting with it remotely through a computer network (if your version-supports such interaction) an opportunity to receive the Corresponding-Source of your version by providing access to the Corresponding Source-from a network server at no charge, through some standard or customary-means of facilitating copying of software. This Corresponding Source-shall include the Corresponding Source for any work covered by version 3-of the GNU General Public License that is incorporated pursuant to the-following paragraph.+ If you modify a copy of the Library, and, in your modifications, a+facility refers to a function or data to be supplied by an Application+that uses the facility (other than as an argument passed when the+facility is invoked), then you may convey a copy of the modified+version: - 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 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 work with which it is combined will remain governed by version-3 of the GNU General Public License.+ a) under this License, provided that you make a good faith effort to+ ensure that, in the event an Application does not supply the+ function or data, the facility still operates, and performs+ whatever part of its purpose remains meaningful, or - 14. Revised Versions of this License.+ b) under the GNU GPL, with none of the additional permissions of+ this License applicable to that copy. - The Free Software Foundation may publish revised and/or new versions of-the GNU Affero 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.+ 3. Object Code Incorporating Material from Library Header Files. - Each version is given a distinguishing version number. If the-Program specifies that a certain numbered version of the GNU Affero 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 Affero General Public License, you may choose any version ever published-by the Free Software Foundation.+ The object code form of an Application may incorporate material from+a header file that is part of the Library. You may convey such object+code under terms of your choice, provided that, if the incorporated+material is not limited to numerical parameters, data structure+layouts and accessors, or small macros, inline functions and templates+(ten or fewer lines in length), you do both of the following: - If the Program specifies that a proxy can decide which future-versions of the GNU Affero 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.+ a) Give prominent notice with each copy of the object code that the+ Library is used in it and that the Library and its use are+ covered by this License. - 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.+ b) Accompany the object code with a copy of the GNU GPL and this license+ document. - 15. Disclaimer of Warranty.+ 4. Combined Works. - 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.+ You may convey a Combined Work under terms of your choice that,+taken together, effectively do not restrict modification of the+portions of the Library contained in the Combined Work and reverse+engineering for debugging such modifications, if you also do each of+the following: - 16. Limitation of Liability.+ a) Give prominent notice with each copy of the Combined Work that+ the Library is used in it and that the Library and its use are+ covered by this License. - 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.+ b) Accompany the Combined Work with a copy of the GNU GPL and this license+ document. - 17. Interpretation of Sections 15 and 16.+ c) For a Combined Work that displays copyright notices during+ execution, include the copyright notice for the Library among+ these notices, as well as a reference directing the user to the+ copies of the GNU GPL and this license document. - 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.+ d) Do one of the following: - END OF TERMS AND CONDITIONS+ 0) Convey the Minimal Corresponding Source under the terms of this+ License, and the Corresponding Application Code in a form+ suitable for, and under terms that permit, the user to+ recombine or relink the Application with a modified version of+ the Linked Version to produce a modified Combined Work, in the+ manner specified by section 6 of the GNU GPL for conveying+ Corresponding Source. - How to Apply These Terms to Your New Programs+ 1) Use a suitable shared library mechanism for linking with the+ Library. A suitable mechanism is one that (a) uses at run time+ a copy of the Library already present on the user's computer+ system, and (b) will operate properly with a modified version+ of the Library that is interface-compatible with the Linked+ Version. - 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.+ e) Provide Installation Information, but only if you would otherwise+ be required to provide such information under section 6 of the+ GNU GPL, and only to the extent that such information is+ necessary to install and execute a modified version of the+ Combined Work produced by recombining or relinking the+ Application with a modified version of the Linked Version. (If+ you use option 4d0, the Installation Information must accompany+ the Minimal Corresponding Source and Corresponding Application+ Code. If you use option 4d1, you must provide the Installation+ Information in the manner specified by section 6 of the GNU GPL+ for conveying Corresponding Source.) - 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.+ 5. Combined Libraries. - <one line to give the program's name and a brief idea of what it does.>- Copyright (C) <year> <name of author>+ You may place library facilities that are a work based on the+Library side by side in a single library together with other library+facilities that are not Applications and are not covered by this+License, and convey such a combined library under terms of your+choice, if you do both of the following: - This program is free software: you can redistribute it and/or modify- it under the terms of the GNU Affero General Public License as published by- the Free Software Foundation, either version 3 of the License, or- (at your option) any later version.+ a) Accompany the combined library with a copy of the same work based+ on the Library, uncombined with any other library facilities,+ conveyed under the terms of this License. - 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 Affero General Public License for more details.+ b) Give prominent notice with the combined library that part of it+ is a work based on the Library, and explaining where to find the+ accompanying uncombined form of the same work. - You should have received a copy of the GNU Affero General Public License- along with this program. If not, see <http://www.gnu.org/licenses/>.+ 6. Revised Versions of the GNU Lesser General Public License. -Also add information on how to contact you by electronic and paper mail.+ The Free Software Foundation may publish revised and/or new versions+of the GNU Lesser 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. - If your software can interact with users remotely through a computer-network, you should also make sure that it provides a way for users to-get its source. For example, if your program is a web application, its-interface could display a "Source" link that leads users to an archive-of the code. There are many ways you could offer source, and different-solutions will be better for different programs; see section 13 for the-specific requirements.+ Each version is given a distinguishing version number. If the+Library as you received it specifies that a certain numbered version+of the GNU Lesser General Public License "or any later version"+applies to it, you have the option of following the terms and+conditions either of that published version or of any later version+published by the Free Software Foundation. If the Library as you+received it does not specify a version number of the GNU Lesser+General Public License, you may choose any version of the GNU Lesser+General Public License ever published by the Free Software Foundation. - 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 AGPL, see-<http://www.gnu.org/licenses/>.+ If the Library as you received it specifies that a proxy can decide+whether future versions of the GNU Lesser General Public License shall+apply, that proxy's public statement of acceptance of any version is+permanent authorization for you to choose that version for the+Library.
comonad-coactions.cabal view
@@ -1,6 +1,5 @@-cabal-version: 3.4-name: comonad-coactions-+cabal-version: 3.4+name: comonad-coactions -- The package version. -- See the Haskell package versioning policy (PVP) for standards -- guiding when and how versions should be incremented.@@ -8,107 +7,135 @@ -- PVP summary: +-+------- breaking API changes -- | | +----- non-breaking API additions -- | | | +--- code changes with no API change-version: 0.1.0.0-+version: 0.1.0.1 synopsis: Coactions of comonads on functors- description: This package defines classes for left and right coactions of comonads on functors. -license: AGPL-3.0-or-later-license-file: LICENSE-author: noiioiu-maintainer: noiioiu@cocaine.ninja-+license: LGPL-2.0-or-later+license-file: LICENSE+author: noiioiu+maintainer: noiioiu@cocaine.ninja homepage: https://codeberg.org/noiioiu/comonad-coactions--category: Control,- Comonads-build-type: Simple+category:+ Control,+ Comonads -extra-doc-files: CHANGELOG.md+build-type: Simple+extra-doc-files: CHANGELOG.md common warnings- ghc-options: -Wall+ ghc-options: -Wall source-repository head type: git location: ssh://git@codeberg.org/noiioiu/comonad-coactions.git library- import: warnings- exposed-modules: Control.Comonad.Coaction,- Control.Comonad.TransformerStack,- Control.Comonad.Coaction.Left,- Control.Comonad.Coaction.Right,- other-modules: Control.Comonad.Coaction.TH- build-depends: base >= 4.20.2 && < 4.21,- comonad >= 5.0.10 && < 5.1,- kan-extensions >= 5.2.8 && < 5.3,- free >= 5.2 && < 5.3,- template-haskell >= 2.22.0 && < 2.23,- adjunctions >= 4.4.4 && < 4.5,- - hs-source-dirs: src- default-language: GHC2021+ import: warnings+ exposed-modules:+ Control.Comonad.Coaction+ Control.Comonad.Coaction.Left+ Control.Comonad.Coaction.Right+ Control.Comonad.TransformerStack + other-modules: Control.Comonad.Coaction.TH+ build-depends:+ adjunctions >=4.4.4 && <4.5,+ base >=4.20.2 && <4.23,+ comonad >=5.0.10 && <5.1,+ free >=5.2 && <5.3,+ kan-extensions >=5.2.8 && <5.3,+ template-haskell >=2.23.0 && <2.25,++ hs-source-dirs: src+ default-language: GHC2024+ flag examples description: Build examples- default: False- manual: True+ default: False+ manual: True -executable ca+executable elementary import: warnings+ if !flag(examples) buildable: False- default-language: GHC2021+ default-language: GHC2024 hs-source-dirs: examples main-is: ElementaryCA.hs build-depends:- comonad-coactions,- base >= 4.20.2 && < 4.21,- comonad >= 5.0.10 && < 5.1,- finite-typelits >= 0.2.1 && < 0.3,- random >= 1.3.1 && < 1.4,- terminal-size >= 0.3.4 && < 0.4,- vector-sized >= 1.6.1 && < 1.7,+ base,+ comonad,+ comonad-coactions,+ finite-typelits >=0.2.1 && <0.3,+ random >=1.3.1 && <1.4,+ terminal-size >=0.3.4 && <0.4,+ vector-sized >=1.6.1 && <1.7, +executable higher-range+ import: warnings++ if !flag(examples)+ buildable: False+ default-language: GHC2024+ hs-source-dirs: examples+ main-is: HigherRange.hs+ build-depends:+ base,+ comonad,+ comonad-coactions,+ finite-typelits >=0.2.1 && <0.3,+ random >=1.3.1 && <1.4,+ terminal-size >=0.3.4 && <0.4,+ vector-sized >=1.6.1 && <1.7,+ executable life import: warnings+ if !flag(examples) buildable: False- default-language: GHC2021+ default-language: GHC2024 hs-source-dirs: examples main-is: Life.hs- ghc-options: -threaded -rtsopts -fplugin GHC.TypeLits.KnownNat.Solver+ ghc-options:+ -threaded+ -rtsopts+ -fplugin+ GHC.TypeLits.KnownNat.Solver+ build-depends:- comonad-coactions,- adjunctions >= 4.4.4 && < 4.5,- base >= 4.20.2 && < 4.21,- clock >= 0.8.4 && < 0.9,- comonad >= 5.0.10 && < 5.1,- constraints >= 0.14.4 && < 0.15,- distributive >= 0.6.3 && < 0.7,- finite-typelits >= 0.2.1 && < 0.3,- ghc-typelits-knownnat >= 0.8.2 && < 0.9,- ki >= 1.0.1 && < 1.1,- random >= 1.3.1 && < 1.4,- termbox-tea >= 1.0.0 && < 1.1,- vector-sized >= 1.6.1 && < 1.7,+ adjunctions,+ base,+ clock >=0.8.4 && <0.9,+ comonad,+ comonad-coactions,+ constraints >=0.14.4 && <0.15,+ distributive >=0.6.3 && <0.7,+ finite-typelits >=0.2.1 && <0.3,+ ghc-typelits-knownnat >=0.8.3 && <0.9,+ ki >=1.0.1 && <1.1,+ monad-actions >=2.0.1 && <2.1,+ mtl >=2.3.1 && <2.4,+ optparse-applicative >=0.19.0 && <0.20,+ random >=1.3.1 && <1.4,+ termbox-tea >=1.0.0 && <1.1,+ text >=2.1.2 && <2.2,+ vector-sized >=1.6.1 && <1.7, test-suite comonad-coactions-test- import: warnings- default-language: GHC2021- type: exitcode-stdio-1.0- hs-source-dirs: test- main-is: Main.hs- build-depends:- base,- comonad,- comonad-coactions,- containers,- QuickCheck,- checkers,- tasty,- tasty-quickcheck+ import: warnings+ default-language: GHC2024+ type: exitcode-stdio-1.0+ hs-source-dirs: test+ main-is: Main.hs+ build-depends:+ QuickCheck,+ base,+ checkers,+ comonad,+ comonad-coactions,+ containers,+ tasty,+ tasty-quickcheck,
examples/ElementaryCA.hs view
@@ -1,6 +1,6 @@ {-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE BlockArguments #-} {-# LANGUAGE DataKinds #-}-{-# LANGUAGE LambdaCase #-} {-# LANGUAGE PatternSynonyms #-} module Main where@@ -13,6 +13,7 @@ import Data.Bits import Data.Finite import Data.Vector.Sized qualified as V+import Data.Word import GHC.TypeLits import System.Console.Terminal.Size import System.IO@@ -41,30 +42,30 @@ {-# COMPLETE Store #-} -rule :: (KnownNat n) => Int -> V.Vector n Cell -> V.Vector n Cell+rule :: (KnownNat n) => Word8 -> V.Vector n Cell -> V.Vector n Cell rule rn =- rextend $ \(Store f i) ->+ rextend \(Store f i) -> let i' = getFinite i nbhd = foldl ((+) . (* 2)) 0 $ fromEnum . f . modulo . (+ i') <$> [-1, 0, 1] in testBit rn nbhd -mainLoop :: forall n. Maybe (SNat n) -> Int -> IO ()-mainLoop (Just sn) rn = withKnownNat sn $+mainLoop :: forall n. Maybe (SNat n) -> Word8 -> IO ()+mainLoop (Just SNat) rn = do x <- sequence . V.replicate @n $ randomIO forever $ go x where go x = do putStrLn $ cellsToString x- threadDelay 25000+ threadDelay 30_000 go $ rule rn x mainLoop Nothing _ = pure () main :: IO () main = do- putStr "Enter rule number: "+ putStr "Enter rule number (0 to 255): " hFlush stdout ruleNumber <- readLn- Just Window {width} <- size+ Just Window{width} <- size let loop = withSomeSNat width mainLoop loop ruleNumber
+ examples/HigherRange.hs view
@@ -0,0 +1,73 @@+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE BlockArguments #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE PatternSynonyms #-}++module Main where++import Control.Comonad.Coaction+import Control.Comonad.Identity+import Control.Comonad.Store+import Control.Concurrent+import Control.Monad+import Data.Bits+import Data.Finite+import Data.Vector.Sized qualified as V+import GHC.TypeLits+import System.Console.Terminal.Size+import System.IO+import System.Random++type Cell = Bool++pattern Off :: Cell+pattern Off = False++pattern On :: Cell+pattern On = True++{-# COMPLETE On, Off #-}++cellToChar :: Cell -> Char+cellToChar = \case+ Off -> ' '+ On -> '█'++cellsToString :: (Foldable f) => f Cell -> String+cellsToString = foldr ((:) . cellToChar) ""++pattern Store :: (s -> a) -> s -> Store s a+pattern Store a b = StoreT (Identity a) b++{-# COMPLETE Store #-}++rule :: (KnownNat n) => Integer -> Integer -> V.Vector n Cell -> V.Vector n Cell+rule radius rn =+ rextend \(Store f i) ->+ let i' = getFinite i+ nbhd = foldl ((+) . (* 2)) 0 $ fromEnum . f . modulo . (+ i') <$> [-radius .. radius]+ in testBit rn nbhd++mainLoop :: forall n. Maybe (SNat n) -> Integer -> Integer -> IO ()+mainLoop (Just SNat) radius rn =+ do+ x <- sequence . V.replicate @n $ randomIO+ forever $ go x+ where+ go x = do+ putStrLn $ cellsToString x+ threadDelay 30_000+ go $ rule radius rn x+mainLoop Nothing _ _ = pure ()++main :: IO ()+main = do+ putStr "Enter radius: "+ hFlush stdout+ radius <- readLn+ putStr $ "Enter rule number (from 0 to " ++ show @Integer (2 ^ (2 ^ (2 * radius + 1) :: Integer) - 1) ++ "): "+ hFlush stdout+ ruleNumber <- readLn+ Just Window{width} <- size+ let loop = withSomeSNat width mainLoop+ loop radius ruleNumber
examples/Life.hs view
@@ -1,6 +1,7 @@ {-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE BlockArguments #-} {-# LANGUAGE DataKinds #-}-{-# LANGUAGE LambdaCase #-}+{-# LANGUAGE MultiWayIf #-} {-# LANGUAGE PatternSynonyms #-} {-# LANGUAGE QualifiedDo #-} {-# LANGUAGE RecordWildCards #-}@@ -8,29 +9,41 @@ {-# LANGUAGE UndecidableInstances #-} {-# LANGUAGE ViewPatterns #-} {-# LANGUAGE NoStarIsType #-}-{-# OPTIONS_GHC -fplugin GHC.TypeLits.KnownNat.Solver -threaded -rtsopts #-}+{-# OPTIONS_GHC -fplugin GHC.TypeLits.KnownNat.Solver -threaded -with-rtsopts=-N -O2 #-} module Main (main) where +import Control.Applicative import Control.Comonad.Coaction-import Control.Comonad.Coaction.Right qualified as R+import Control.Comonad.Coaction.Right qualified as RC import Control.Comonad.Identity hiding ((<@>)) import Control.Comonad.Store hiding (pos, (<@>)) import Control.Concurrent import Control.Monad-import Data.Bifunctor+import Control.Monad.Action.Left qualified as LA+import Control.Monad.Action.Right qualified as RA+import Control.Monad.State+import Data.Bits+import Data.Char import Data.Constraint import Data.Distributive import Data.Finite import Data.Foldable+import Data.Functor ((<&>)) import Data.Functor.Rep+import Data.Maybe+import Data.Proxy+import Data.Text qualified as T import Data.Vector.Sized qualified as V+import Data.Word import GHC.TypeLits import Ki qualified+import Options.Applicative qualified as Opt import System.Clock import System.IO import System.Random hiding (Finite) import Termbox.Tea qualified as TB+import Text.Read hiding (get) import Prelude hiding (replicate) newtype Array2D (m :: Nat) (n :: Nat) a = Array2D {getArray2D :: V.Vector (m * n) a}@@ -48,7 +61,7 @@ instance (KnownNat m, KnownNat n) => Representable (Array2D m n) where type Rep (Array2D m n) = (Finite m, Finite n)- index Array2D {getArray2D} = index getArray2D . combineProduct+ index Array2D{getArray2D} = index getArray2D . combineProduct tabulate f = Array2D . tabulate $ f . separateProduct replicate :: (KnownNat (m * n)) => a -> Array2D m n a@@ -57,114 +70,291 @@ imap :: (KnownNat m) => ((Finite m, Finite n) -> a -> b) -> Array2D m n a -> Array2D m n b imap f = Array2D . V.imap (f . separateProduct) . getArray2D -type Cell = Bool--pattern Off :: Cell-pattern Off = False--pattern On :: Cell-pattern On = True--{-# COMPLETE On, Off #-}+type Cell = Word8 -cellArray :: (KnownNat m) => Array2D m n Cell -> TB.Image-cellArray =+cellArray :: (KnownNat m) => Settings -> Array2D m n Cell -> TB.Image+cellArray Settings{} = fold . imap- ( \(i, j) c ->- if c- then- TB.atRow (fromInteger $ getFinite i)- . TB.atCol (fromInteger $ 2 * getFinite j)- . ap mappend (TB.atCol 1)- $ TB.char '█'- else mempty- )+ \(i, j) c ->+ case c of+ 0 -> mempty+ _ ->+ TB.fg (TB.color . fromIntegral . (`mod` 216) . (+ 100) . (* 2) $ c)+ . TB.atRow (fromInteger $ getFinite i)+ . TB.atCol (fromInteger $ 2 * getFinite j)+ . ap mappend (TB.atCol 1)+ $ TB.char '█' pattern Store :: (s -> a) -> s -> Store s a pattern Store a b = StoreT (Identity a) b {-# COMPLETE Store #-} -life :: (KnownNat m, KnownNat n, KnownNat (m * n)) => Array2D m n Cell -> Array2D m n Cell-life = rextend $ \(Store grid (i, j)) ->- let s =- sum . fmap (fromEnum . grid . bimap modulo modulo) $- (,)- <$> fmap (getFinite i +) [-1, 0, 1]- <*> fmap (getFinite j +) [-1, 0, 1]- in s == 3 || (s == 4 && grid (i, j))+wrapBoundary :: forall m n. (KnownNat m, KnownNat n) => Surface -> Integer -> Integer -> Maybe (Finite m, Finite n)+wrapBoundary Rectangle a b = (,) <$> packFinite a <*> packFinite b+wrapBoundary Torus a b = Just (modulo a, modulo b)+wrapBoundary Cylinder a b = packFinite a <&> (,modulo b)+wrapBoundary Moebius a b = do+ a' <- packFinite a+ let b' = modulo b+ Just (case packFinite @n b of Nothing -> -a'; _ -> a', b')+wrapBoundary Klein a b =+ let a' = modulo a+ b' = modulo b+ in Just (case packFinite @n b of Nothing -> -a'; _ -> a', b')+wrapBoundary Projective a b =+ let a' = modulo a+ b' = modulo b+ in Just (case packFinite @n b of Nothing -> -a'; _ -> a', case packFinite @m a of Nothing -> -b'; _ -> b')+wrapBoundary Sphere a b =+ let m = natVal $ Proxy @m+ a' = a `mod` (2 * m)+ b' = b `mod` (2 * m)+ in if+ | a' < m && b' < m -> Just (modulo a', modulo b')+ | a' >= m && b' < m -> Just (modulo b', modulo $ -a' - 1)+ | a' < m && b' >= m -> Just (modulo $ -b' - 1, modulo a')+ | otherwise -> Just (modulo $ -b' - 1, modulo $ -a' - 1) +life :: (KnownNat m, KnownNat n) => Settings -> Array2D m n Cell -> Array2D m n Cell+life Settings{rule = Rule{..}, ..} = rextend $ \s@(Store grid (i, j)) ->+ let t = sum+ $ LA.do+ a <- [-radius .. radius]+ b <-+ let r = case neighbourhood of+ Moore -> radius+ VonNeumann -> radius - abs a+ Circular -> ceiling @Double . sqrt . fromIntegral $ radius * radius - a * a+ Cross -> if a == 0 then radius else 0+ Custom _ -> radius+ in [-r .. r]+ (a', b') <- wrapBoundary surface (getFinite i + fromIntegral a) (getFinite j + fromIntegral b)+ let weight = case neighbourhood of+ Custom c ->+ let ix = (((radius - b) * (2 * radius + 1)) + radius - a)+ centre = radius * (2 * radius + 1) + radius+ in fromEnum $ ix /= centre && if ix < centre then c `testBit` ix else c `testBit` (ix - 1)+ _ -> fromEnum $ (a, b) /= (0, 0)+ pure @[] . (* weight) . fromEnum . (== 1) $ grid (a', b')+ in case extract s of+ 0 -> if birth `testBit` t then 1 else 0+ 1 -> if survival `testBit` t then 1 else 2 `mod` nStates+ x -> succ x `mod` nStates+ data SomeBoard where SomeBoard :: (KnownNat m, KnownNat n) => SNat m -> SNat n -> Array2D m n Cell -> SomeBoard data LifeState = LifeState { board :: !SomeBoard, running :: !Bool, time :: !TimeSpec,- done :: !Bool,+ finished :: !Bool, delay :: !TimeSpec, drawing :: !(Maybe Cell), steps :: !Int } +data Neighbourhood = Moore | VonNeumann | Circular | Cross | Custom Integer++data Surface = Torus | Cylinder | Rectangle | Moebius | Klein | Projective | Sphere++data Rule = Rule+ { birth :: !Integer,+ survival :: !Integer,+ nStates :: !Word8,+ neighbourhood :: !Neighbourhood,+ radius :: !Int+ }++data Settings = Settings+ { rule :: Rule,+ surface :: !Surface+ }+ snatDict :: SNat n -> Dict (KnownNat n) snatDict sn = withKnownNat sn Dict -initialize :: TimeSpec -> TB.Size -> LifeState-initialize time = \TB.Size {width, height} ->- withSomeSNat (fromIntegral $ width `div` 2) $- withSomeSNat (fromIntegral height) $- \case- Nothing -> error "Unknown nat"- Just sm -> \case+initialize :: Settings -> TimeSpec -> TB.Size -> LifeState+initialize Settings{..} time TB.Size{width, height} =+ let h = fromIntegral height+ w = fromIntegral $ width `div` 2+ (h', w') = case surface of+ Sphere -> (min h w, min h w)+ _ -> (h, w)+ in withSomeSNat w'+ $ withSomeSNat h'+ $ \case Nothing -> error "Unknown nat"- Just sn -> case (snatDict sm, snatDict sn) of- (Dict, Dict) ->- LifeState- { board = SomeBoard sm sn $ replicate Off,- running = True,- time,- done = False,- delay = TimeSpec {sec = 0, nsec = 100_000_000},- drawing = Nothing,- steps = 0- }+ Just sm -> \case+ Nothing -> error "Unknown nat"+ Just sn -> case (snatDict sm, snatDict sn) of+ (Dict, Dict) ->+ LifeState+ { board = SomeBoard sm sn $ replicate 0,+ running = False,+ time,+ finished = False,+ delay = TimeSpec{sec = 0, nsec = 100_000_000},+ drawing = Nothing,+ steps = 0+ } pollEvent :: MVar TimeSpec -> Maybe (IO TimeSpec) pollEvent m = Just $ takeMVar m -handleEvent :: LifeState -> TB.Event TimeSpec -> IO LifeState-handleEvent s@(LifeState {board = SomeBoard (sm :: SNat m) (sn :: SNat n) b, ..}) =+handleEvent :: Settings -> LifeState -> TB.Event TimeSpec -> IO LifeState+handleEvent settings@Settings{rule = Rule{..}} s@(LifeState{board = SomeBoard (sm :: SNat m) (sn :: SNat n) b, ..}) = \case TB.EventKey (TB.KeyChar 'r') -> do- randomBoard <- sequence $ replicate randomIO- pure $ s {board = SomeBoard sm sn randomBoard, steps = 0}- TB.EventKey (TB.KeyChar 'c') -> pure $ s {board = SomeBoard sm sn $ replicate Off, steps = 0}- TB.EventKey (TB.KeyChar 'q') -> pure $ s {done = True}- TB.EventKey (TB.KeyChar '+') -> pure $ s {delay = max 0 $ delay - TimeSpec {sec = 0, nsec = 20_000_000}}- TB.EventKey (TB.KeyChar '-') -> pure $ s {delay = delay + TimeSpec {sec = 0, nsec = 20_000_000}}- TB.EventKey TB.KeySpace -> pure $ s {running = not running}- TB.EventMouse TB.Mouse {button = TB.LeftClick, pos = TB.Pos {..}} ->+ randomBoard <- sequence . replicate $ fmap (`mod` 2) randomIO+ pure $ s{board = SomeBoard sm sn randomBoard, steps = 0}+ TB.EventKey (TB.KeyChar 'c') -> pure s{board = SomeBoard sm sn $ replicate 0, running = False, steps = 0}+ TB.EventKey (TB.KeyChar 'q') -> pure s{finished = True}+ TB.EventKey (TB.KeyChar '+') -> pure s{delay = max 0 $ delay - TimeSpec{sec = 0, nsec = 20_000_000}}+ TB.EventKey (TB.KeyChar '-') -> pure s{delay = delay + TimeSpec{sec = 0, nsec = 20_000_000}}+ TB.EventKey TB.KeySpace -> pure s{running = not running}+ TB.EventMouse TB.Mouse{button = TB.LeftClick, pos = TB.Pos{..}} -> let r = modulo $ fromIntegral row c = modulo $ fromIntegral $ col `div` 2 in case drawing of Nothing ->- let b' = b R.=>> \(Store grid (i, j)) -> if (i, j) == (r, c) then not $ grid (i, j) else grid (i, j)- in pure s {board = SomeBoard sm sn b', drawing = Just $ index b' (r, c)}+ let b' = b RC.=>> \(Store grid (i, j)) -> if (i, j) == (r, c) then (grid (i, j) + 1) `mod` nStates else grid (i, j)+ in pure s{board = SomeBoard sm sn b', drawing = Just $ index b' (r, c)} Just cell ->- let b' = b R.=>> \(Store grid (i, j)) -> if (i, j) == (r, c) then cell else grid (i, j)- in pure s {board = SomeBoard sm sn b'}- TB.EventMouse TB.Mouse {button = TB.ReleaseClick} -> pure s {drawing = Nothing}- TB.EventUser t -> if t - time >= delay && running then pure s {board = SomeBoard sm sn $ life b, time = t, steps = steps + 1} else pure s+ let b' = b RC.=>> \(Store grid (i, j)) -> if (i, j) == (r, c) then cell else grid (i, j)+ in pure s{board = SomeBoard sm sn b'}+ TB.EventMouse TB.Mouse{button = TB.ReleaseClick} -> pure s{drawing = Nothing}+ TB.EventUser t -> if t - time >= delay && running then pure s{board = SomeBoard sm sn $ life settings b, time = t, steps = steps + 1} else pure s _ -> pure s -render :: LifeState -> TB.Scene-render = TB.image . (\(SomeBoard _ _ b) -> cellArray b) . board+render :: Settings -> LifeState -> TB.Scene+render settings = TB.image . (\(SomeBoard _ _ b) -> cellArray settings b) . board +type Parser = StateT T.Text Maybe++getT :: Parser T.Text+getT = get++putT :: T.Text -> Parser ()+putT = put++satisfy :: (Char -> Bool) -> Parser Char+satisfy p = LA.do+ t <- getT+ (c, t') <- T.uncons t+ putT t'+ if p c then pure c else empty++parseChar :: Char -> Parser ()+parseChar = void . satisfy . (==)++parseNat :: (Integral a, Read a) => Parser a+parseNat = LA.do+ d <- some $ satisfy isDigit+ n <- readMaybe d+ pure $ fromInteger n++parseRange :: (Integral a, Read a) => Parser [a]+parseRange = LA.do+ m <- some (satisfy isDigit) RA.>>= readMaybe+ parseChar '-'+ n <- some (satisfy isDigit) RA.>>= readMaybe+ pure [fromInteger m .. fromInteger n]++eof :: Parser ()+eof = do+ t <- getT+ unless (T.null t) empty++sepBy :: Parser a -> Parser b -> Parser [b]+sepBy sep p = liftM2 (:) p (many (sep *> p)) <|> pure []++parseNbhd :: Parser Neighbourhood+parseNbhd =+ (Moore <$ parseChar 'M')+ <|> (VonNeumann <$ parseChar 'N')+ <|> (Circular <$ parseChar 'C')+ <|> (Cross <$ parseChar '+')+ <|> ( LA.do+ parseChar '@'+ s <- ("0x" ++) <$> many (satisfy isHexDigit)+ n <- readMaybe s+ pure $ Custom n+ )++-- | Higher-range outer totalistic notation for larger than life rules.+parseHROT :: Parser Rule+parseHROT = do+ parseChar 'R'+ radius <- parseNat+ parseChar ','+ parseChar 'C'+ nStates <- parseNat+ parseChar ','+ parseChar 'S'+ survival <- fmap (sum . fmap bit . join) . sepBy (parseChar ',') $ parseRange <|> fmap pure parseNat+ parseChar ','+ parseChar 'B'+ birth <- fmap (sum . fmap bit . join) . sepBy (parseChar ',') $ parseRange <|> fmap pure parseNat+ neighbourhood <- optional $ parseChar ',' *> parseChar 'N' *> parseNbhd+ eof+ pure Rule{neighbourhood = fromMaybe Moore neighbourhood, ..}++-- Birth/survival/states for generations rules.+parseBSC :: Parser Rule+parseBSC = do+ parseChar 'B'+ birth <- fmap (sum . fmap (bit . subtract (fromEnum '0') . fromEnum)) $ many $ satisfy isDigit+ parseChar '/'+ parseChar 'S'+ survival <- fmap (sum . fmap (bit . subtract (fromEnum '0') . fromEnum)) $ many $ satisfy isDigit+ nStates <- fmap (fromMaybe 2) . optional $ parseChar '/' >> optional (parseChar 'C') >> parseNat+ eof+ pure Rule{neighbourhood = Moore, radius = 1, ..}++-- Survival/birth/states for generations rules.+parseSBC :: Parser Rule+parseSBC = do+ survival :: Integer <- fmap (sum . fmap (bit . subtract (fromEnum '0') . fromEnum)) $ many $ satisfy isDigit+ parseChar '/'+ birth <- fmap (sum . fmap (bit . subtract (fromEnum '0') . fromEnum)) $ many $ satisfy isDigit+ nStates <- fmap (fromMaybe 2) . optional $ parseChar '/' >> parseNat+ eof+ pure Rule{neighbourhood = Moore, radius = 1, ..}++parseRulestring :: Parser Rule+parseRulestring = parseHROT <|> parseBSC <|> parseSBC++parseSettings :: Opt.ParserInfo (Maybe T.Text, Maybe Surface)+parseSettings =+ let parser =+ (,)+ <$> ( optional . Opt.strOption+ $ Opt.short 'r' <> Opt.long "rule" <> Opt.metavar "RULESTRING" <> Opt.help "Rule string"+ )+ <*> Opt.optional+ ( Opt.flag' Rectangle (Opt.long "rectangle" <> Opt.help "Run cellular automaton in a rectangle (topologically a disk)")+ <|> Opt.flag' Torus (Opt.long "torus" <> Opt.help "Run cellular automaton in a torus")+ <|> Opt.flag' Cylinder (Opt.long "cylinder" <> Opt.help "Run cellular automaton in a cylinder")+ <|> Opt.flag' Moebius (Opt.long "moebius" <> Opt.help "Run cellular automaton in a Moebius strip")+ <|> Opt.flag' Klein (Opt.long "klein" <> Opt.help "Run cellular automaton in a Klein bottle")+ <|> Opt.flag' Projective (Opt.long "projective" <> Opt.help "Run cellular automaton in a real projective plane with singular points at the corners (orbifold symbol 22×)")+ <|> Opt.flag' Sphere (Opt.long "sphere" <> Opt.help "Run cellular automaton in a sphere with singular points at the corners (orbifold symbol 442)")+ )+ in Opt.info (parser Opt.<**> Opt.helper) (Opt.fullDesc <> Opt.progDesc "Larger than life cellular automaton")+ main :: IO () main = do+ (mRulestring, mSurface) <- Opt.execParser parseSettings+ let rule = case mRulestring of+ Nothing -> Rule{radius = 1, neighbourhood = Moore, birth = 8, survival = 12, nStates = 2} -- Default rule: Conway's life+ Just rulestring -> fromMaybe (error "Failed to parse rulestring") $ evalStateT parseRulestring rulestring+ let surface = fromMaybe Rectangle mSurface t0 <- getTime Monotonic+ let settings =+ Settings{..} result <- Ki.scoped $ \scope -> do timeVar <- newEmptyMVar@@ -175,12 +365,12 @@ >>= putMVar timeVar TB.run TB.Program- { initialize = initialize t0,+ { initialize = initialize settings t0, pollEvent = pollEvent timeVar,- handleEvent,- render,- finished = done+ handleEvent = handleEvent settings,+ render = render settings,+ finished } case result of Left err -> hPutStrLn stderr $ "Failed to initialize: " ++ show err- Right LifeState {steps} -> putStrLn $ "Ran for " ++ show steps ++ " steps"+ Right LifeState{steps} -> putStrLn $ "Ran for " ++ show steps ++ " steps"
src/Control/Comonad/Coaction.hs view
@@ -2,20 +2,29 @@ {-# LANGUAGE LambdaCase #-} {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE UndecidableInstances #-}+{-# OPTIONS_HADDOCK show-extensions #-} --- | Given a comonad \(W\) on a category \(\mathcal{D}\) with counit \(\varepsilon\) and--- comultiplication \(\Delta\) and a functor \(F\) from \(\mathcal{C}\) to \(\mathcal{D}\),--- a left (or outer) comonad coaction of \(W\) on \(F\) is a natural transformation--- \(\Sigma: F \to W \circ F\) such that the following two laws hold:------ * \((\varepsilon \circ F) \cdot \Sigma = \mathrm{id}_F\)--- * \((\Delta \circ F) \cdot \Sigma = (W \circ \Sigma) \cdot \Sigma\)------ We also say that \(F\) is a left comodule over \(W\). In the case--- \(\mathcal{C} = \mathcal{D}\), a left comonad comodule is a left comonoid comodule--- object in the category of endofunctors on \(\mathcal{C}\).------ Right (or inner) comonad coactions are defined similarly.+{-|+Module : Control.Comonad.Coaction+Description : comonad coactions+Copyright : © noiioiu+License : LGPL-2+Maintainer : noiioiu@cocaine.ninja+Stability : experimental++Given a comonad \(W\) on a category \(\mathcal{D}\) with counit \(\varepsilon\) and+comultiplication \(\Delta\) and a functor \(F\) from \(\mathcal{C}\) to \(\mathcal{D}\),+a left (or outer) comonad coaction of \(W\) on \(F\) is a natural+transformation \(\Sigma: F \to W \circ F\) such that the following two laws hold:++* \((\varepsilon \circ F) \cdot \Sigma = \mathrm{id}_F\)+* \((\Delta \circ F) \cdot \Sigma = (W \circ \Sigma) \cdot \Sigma\)++We also say that \(F\) is a left comodule over \(W\). In the+case \(\mathcal{C} = \mathcal{D}\), a left comonad comodule is a left comonoid+comodule object in the category of endofunctors on \(\mathcal{C}\). Right+(or inner) comonad coactions are defined similarly.+-} module Control.Comonad.Coaction ( LeftComodule (..), RightComodule (..),@@ -38,11 +47,12 @@ import Data.Functor.Rep (Representable (..)) import Data.Functor.Sum (Sum (..)) --- | Instances must satisfy the following laws:------ * @'duplicate' '.' 'lduplicate' = 'fmap' 'lduplicate' '.' 'lduplicate'@------ * @'extract' '.' 'lduplicate' = 'id'@+{-| Instances must satisfy the following laws:++* @'duplicate' '.' 'lduplicate' = 'fmap' 'lduplicate' '.' 'lduplicate'@++* @'extract' '.' 'lduplicate' = 'id'@+-} class (Comonad w, Functor f) => LeftComodule w f where lduplicate :: f a ->@@ -53,11 +63,12 @@ lextend f = fmap f . lduplicate {-# MINIMAL lduplicate | lextend #-} --- | Instances must satisfy the following laws:------ * @'fmap' 'duplicate' '.' 'rduplicate' = 'rduplicate' '.' 'rduplicate'@------ * @'fmap' 'extract' '.' 'lduplicate' = 'id'@+{-| Instances must satisfy the following laws:++* @'fmap' 'duplicate' '.' 'rduplicate' = 'rduplicate' '.' 'rduplicate'@++* @'fmap' 'extract' '.' 'lduplicate' = 'id'@+-} class (Comonad w, Functor f) => RightComodule w f where rduplicate :: f a ->@@ -68,10 +79,11 @@ rextend f = fmap f . rduplicate {-# MINIMAL rduplicate | rextend #-} --- | Given two comonads r and s, an (r, s) bicomodule is a functor that is a left comodule over r and a right comodule over s, where the two coactions are compatible.--- Instances must satisfy the following law in addition to the laws for @'LeftComodule'@ and @'RightComodule'@:------ * @'lduplicate' '.' 'rduplicate' = 'fmap' 'rduplicate' '.' 'lduplicate' = 'biduplicate'@+{-| Given two comonads @r@ and @s@, an @(r, s)@ bicomodule is a functor that is a left comodule over @r@ and a right comodule over @s@, where the two coactions are compatible.+ Instances must satisfy the following law in addition to the laws for @'LeftComodule'@ and @'RightComodule'@:++* @'lduplicate' '.' 'rduplicate' = 'fmap' 'rduplicate' '.' 'lduplicate' = 'biduplicate'@+-} class (LeftComodule r f, RightComodule s f) => BiComodule r s f where biduplicate :: f a ->@@ -98,28 +110,29 @@ instance {-# INCOHERENT #-} (Comonad s, Comonad t, Functor f, LeftComodule s u, RightComodule t v) => BiComodule s t (Compose u (Compose f v)) --- | Proof that @f@ is always a left comodule over @t'Density' f@:------ * @ 'duplicate' ('lduplicate' w)--- = 'duplicate' ('Density' 'id' w)--- = 'Density' ('Density' 'id') w--- = 'Density' 'lduplicate' w--- = 'fmap' 'lduplicate' ('Density' 'id' w)--- = 'fmap' 'lduplicate' ('lduplicate' w)@------ * @'extract' ('lduplicate' w) = 'extract' ('Density' 'id' w) = w@+{-| Proof that @f@ is always a left comodule over @t'Density' f@:++ * @ 'duplicate' ('lduplicate' w)+ = 'duplicate' ('Density' 'id' w)+ = 'Density' ('Density' 'id') w+ = 'Density' 'lduplicate' w+ = 'fmap' 'lduplicate' ('Density' 'id' w)+ = 'fmap' 'lduplicate' ('lduplicate' w)@++ * @'extract' ('lduplicate' w) = 'extract' ('Density' 'id' w) = w@+-} instance (Functor f) => LeftComodule (Density f) f where lduplicate = Density id -instance {-# OVERLAPS #-} (Comonad q, Comonad w, ComonadTransStack w q) => LeftComodule w q where+instance {-# INCOHERENT #-} (Comonad q, Comonad w, ComonadTransStack w q) => LeftComodule w q where lduplicate = lowerStack . duplicate lextend f = lowerStack . extend f -instance {-# OVERLAPS #-} (Comonad q, Comonad w, ComonadTransStack w q) => RightComodule w q where+instance {-# INCOHERENT #-} (Comonad q, Comonad w, ComonadTransStack w q) => RightComodule w q where rduplicate = lextend lowerStack rextend f = extend $ f . lowerStack -instance {-# OVERLAPS #-} (Comonad q, Comonad w, ComonadTransStack w q) => BiComodule w w q+instance {-# INCOHERENT #-} (Comonad q, Comonad w, ComonadTransStack w q) => BiComodule w w q instance {-# INCOHERENT #-} (ComonadStore s w) => LeftComodule (Store s) w where lduplicate = liftM2 store (flip peek) pos . duplicate
src/Control/Comonad/Coaction/Left.hs view
@@ -1,5 +1,14 @@--- | Operators for left comonad coactions.--- This module should be imported qualified.+{-|+Module : Control.Comonad.Coaction.Left+Description : operators for left comonad coactions+Copyright : © noiioiu+License : LGPL-2+Maintainer : noiioiu@cocaine.ninja+Stability : experimental++Operators for left comonad coactions.+This module should be imported qualified.+-} module Control.Comonad.Coaction.Left ( (<<=), (=>>),
src/Control/Comonad/Coaction/Right.hs view
@@ -1,7 +1,14 @@-{-# LANGUAGE MonoLocalBinds #-}+{-|+Module : Control.Comonad.Coaction.Right+Description : operators for right comonad coactions+Copyright : © noiioiu+License : LGPL-2+Maintainer : noiioiu@cocaine.ninja+Stability : experimental --- | Operators for left comonad coactions.--- This module should be imported qualified.+Operators for left comonad coactions.+This module should be imported qualified.+-} module Control.Comonad.Coaction.Right ( (<<=), (=>>),
src/Control/Comonad/Coaction/TH.hs view
@@ -1,7 +1,13 @@-{-# LANGUAGE LambdaCase #-} {-# LANGUAGE TemplateHaskellQuotes #-} {-# LANGUAGE TypeData #-} +{-|+Module : Control.Comonad.Coaction.TH+Copyright : © noiioiu+License : LGPL-2+Maintainer : noiioiu@cocaine.ninja+Stability : experimental+-} module Control.Comonad.Coaction.TH (mkLowerBy) where import Control.Comonad@@ -60,8 +66,8 @@ let inductiveInstances = instances >>= \case InstanceD ov ct (AppT (ConT _) t) _ ->- pure $- InstanceD+ pure+ $ InstanceD ov (ct ++ [ConT (mkName "LowerBy") # VarT k # VarT w # VarT q, ConT ''Comonad # (t # VarT q)]) (ConT (mkName "LowerBy") # (ConT (mkName "S") # VarT k) # VarT w # (t # VarT q))
src/Control/Comonad/TransformerStack.hs view
@@ -5,6 +5,14 @@ {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE UndecidableInstances #-} +{-|+Module : Control.Comonad.TransformerStack+Description : stacks of comonad transformers+Copyright : © noiioiu+License : LGPL-2+Maintainer : noiioiu@cocaine.ninja+Stability : experimental+-} module Control.Comonad.TransformerStack (ComonadTransStack (..)) where import Control.Comonad.Coaction.TH@@ -16,19 +24,20 @@ $mkLowerBy --- | All @'ComonadTransStack'@ instances are defined inductively using @'Control.Comonad.Trans.Class.ComonadTrans'@ instances.------ No laws are given in the documentation for @'Control.Comonad.Trans.Class.ComonadTrans'@,--- but all instances should satisfy the following laws, dual to the laws for--- @'Control.Monad.Trans.Class.MonadTrans'@, which state that @'Control.Comonad.Trans.Class.lower'@ is a comonad homomorphism:------ * @'Control.Comonad.extract' '.' 'Control.Comonad.Trans.Class.lower' = 'Control.Comonad.extract'@------ * @'Control.Comonad.duplicate' '.' 'Control.Comonad.Trans.Class.lower' = 'Control.Comonad.Trans.Class.lower' '.' 'fmap' 'Control.Comonad.Trans.Class.lower' . 'Control.Comonad.duplicate'@------ It follows by induction that @'lowerStack'@ is a comonad homomorphism.--- The proofs of the comodule laws may be obtained by looking at the corresponding--- proofs of the module laws in a mirror.+{-| All @'ComonadTransStack'@ instances are defined inductively using @'Control.Comonad.Trans.Class.ComonadTrans'@ instances.++ No laws are given in the documentation for @'Control.Comonad.Trans.Class.ComonadTrans'@,+ but all instances should satisfy the following laws, dual to the laws for+ @'Control.Monad.Trans.Class.MonadTrans'@, which state that @'Control.Comonad.Trans.Class.lower'@ is a comonad homomorphism:++ * @'Control.Comonad.extract' '.' 'Control.Comonad.Trans.Class.lower' = 'Control.Comonad.extract'@++ * @'Control.Comonad.duplicate' '.' 'Control.Comonad.Trans.Class.lower' = 'Control.Comonad.Trans.Class.lower' '.' 'fmap' 'Control.Comonad.Trans.Class.lower' . 'Control.Comonad.duplicate'@++ It follows by induction that @'lowerStack'@ is a comonad homomorphism.+ The proofs of the comodule laws may be obtained by looking at the corresponding+ proofs of the module laws in a mirror.+-} class (LowerBy (Steps w q) w q) => ComonadTransStack w q where lowerStack :: forall a. q a -> w a
test/Main.hs view
@@ -1,5 +1,4 @@ {-# LANGUAGE AllowAmbiguousTypes #-}-{-# LANGUAGE MonoLocalBinds #-} {-# LANGUAGE ScopedTypeVariables #-} {-# OPTIONS_GHC -Wno-orphans #-} {-# OPTIONS_GHC -Wno-unrecognised-pragmas #-}@@ -191,8 +190,8 @@ main :: IO () main = defaultMain- ( testGroup "monad action laws" $- uncurry testProperties+ ( testGroup "monad action laws"+ $ uncurry testProperties <$> [ leftcomodule @NE.NonEmpty @(Compose NE.NonEmpty Maybe) @Int, rightcomodule @NE.NonEmpty @(Compose Maybe NE.NonEmpty) @Int, rightcomodulestore @NE.NonEmpty @Bool @Int,