sylvia (empty) → 0.2.0.1
raw patch · 13 files changed
+1724/−0 lines, 13 filesdep +basedep +cairodep +data-defaultsetup-changed
Dependencies added: base, cairo, data-default, gtk, parsec, smallcheck, test-framework, test-framework-smallcheck, transformers, void
Files
- LICENSE +674/−0
- Main.hs +17/−0
- README.mkd +26/−0
- Setup.hs +2/−0
- Sylvia/Model.hs +236/−0
- Sylvia/Renderer/Impl.hs +222/−0
- Sylvia/Renderer/Impl/Cairo.hs +161/−0
- Sylvia/Renderer/Pair.hs +71/−0
- Sylvia/Text/Parser.hs +61/−0
- Sylvia/Text/PrettyPrint.hs +42/−0
- Sylvia/UI/GTK.hs +70/−0
- sylvia.cabal +71/−0
- tests/Properties.hs +71/−0
+ LICENSE view
@@ -0,0 +1,674 @@+ 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>.
+ Main.hs view
@@ -0,0 +1,17 @@+module Main+ ( main+ ) where++import System.Environment ( getArgs )++import Sylvia.Text.Parser+import Sylvia.UI.GTK++main :: IO ()+main = do+ args <- getArgs+ case args of+ [input] -> case parseExp input of+ Left err -> putStrLn $ show err+ Right res -> showInWindow res+ _ -> putStrLn "Usage: sylvia 'expression'"
+ README.mkd view
@@ -0,0 +1,26 @@+Sylvia+======++**Sylvia** is a logical puzzle game, based on a field of mathematics+called *lambda calculus*. You start with a library of functions, and+combine them together in various ways.++See the [wiki][] for documentation.+++Quick start+-----------++ git clone git://github.com/chrisyco/sylvia+ cd sylvia+ cabal configure --enable-tests+ cabal install --only-dependencies+ cabal build+ cabal test+ dist/build/sylvia++See [Building from source][] for more detailed instructions.+++[wiki]: https://github.com/lfairy/sylvia/wiki+[Building from source]: https://github.com/lfairy/sylvia/wiki/Building-from-source
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ Sylvia/Model.hs view
@@ -0,0 +1,236 @@+{-# LANGUAGE Rank2Types #-}++-- |+-- Module : Sylvia.Model+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : portable (Rank2Types)+--+-- The 'Exp' data type, for representing lambda expressions using De Bruijn+-- indices, plus basic abstraction and application operations.++module Sylvia.Model+ (+ -- * Types+ Inc(..)+ , Exp(..)++ -- * Conversions+ , verify+ , verify'++ -- * Abstracting+ , abstract+ , match+ , shiftUp++ -- * Applying+ , apply+ , subst+ , shiftDown++ -- * Simplifying+ , evalHNF+ ) where++import Control.Applicative ( Applicative(..) )+import Control.Monad ( ap )+import Data.Foldable ( Foldable(foldMap) )+import Data.Functor ( (<$>) )+import Data.Monoid ( Monoid(..) )+import Data.Traversable ( Traversable(traverse) )+import Data.Void ( Void )++-- | A structure for representing whole numbers.+--+-- The problem with referring to variables with plain integers is that+-- it's impossible to tell whether an expression refers to any free+-- variables. 'Inc' solves this by letting the type dictate the maximum+-- value of the number.+--+-- For example, 3 would be represented as @S (S (S x))@, where @x@ can+-- be any value. Since it is nested three levels deep, it would have the+-- type @Inc (Inc (Inc a))@.+data Inc a+ = O -- ^ Zero+ | S a -- ^ Add one+ deriving (Eq, Ord, Read, Show)++instance Functor Inc where+ fmap = mapI++instance Applicative Inc where+ pure = return+ (<*>) = ap++instance Monad Inc where+ return = S+ val >>= f = joinI (mapI f val)++instance Foldable Inc where+ foldMap _ O = mempty+ foldMap f (S x) = f x++instance Traversable Inc where+ traverse _ O = pure O+ traverse f (S x) = S <$> f x++-- | Apply a function to the value inside the 'Inc', if it has one.+mapI :: (a -> b) -> Inc a -> Inc b+mapI _ O = O+mapI f (S x) = S (f x)++-- | Remove one layer of nesting, projecting the inner value onto the outside.+joinI :: Inc (Inc a) -> Inc a+joinI (S (S x)) = S x+joinI _ = O++-- | A lambda expression.+data Exp a+ -- | Variable reference.+ = Ref a+ -- | Lambda abstraction.+ -- Since the function introduces a variable, the expression inside+ -- the lambda would have one more variable than the expression+ -- outside, hence the extra 'Inc'.+ | Lam (Exp (Inc a))+ -- | Function application.+ | App (Exp a) (Exp a)+ deriving (Eq, Ord, Read, Show)++instance Functor Exp where+ fmap = mapE++instance Applicative Exp where+ pure = return+ (<*>) = ap++instance Monad Exp where+ return = Ref+ e >>= f = joinE (mapE f e)++instance Foldable Exp where+ foldMap f e = case e of+ Ref x -> f x+ Lam e' -> foldMap (foldMap f) e'+ App a b -> foldMap f a `mappend` foldMap f b++instance Traversable Exp where+ traverse f e = case e of+ Ref x -> Ref <$> f x+ Lam e' -> Lam <$> traverse (traverse f) e'+ App a b -> App <$> traverse f a <*> traverse f b++-- | Apply a function to every leaf value in the tree.+mapE :: (a -> b) -> Exp a -> Exp b+mapE f e = case e of+ Ref x -> Ref (f x)+ Lam e' -> Lam (mapE (mapI f) e')+ App a b -> App (mapE f a) (mapE f b)++-- | Flatten a nested expression by gluing its nodes onto the main tree.+joinE :: Exp (Exp a) -> Exp a+joinE e = case e of+ Ref x -> x+ Lam e' -> Lam (joinE (mapE distE e'))+ App a b -> App (joinE a) (joinE b)++-- | Convert a wrapped-up expression into an expression with wrapped-up+-- references.+distE :: Inc (Exp a) -> Exp (Inc a)+distE O = Ref O+distE (S x) = mapE S x++-- | Check there are no references to free variables in the given+-- expression. If there are none, return Just the expression; otherwise,+-- return Nothing.+verify :: Exp a -> Maybe (Exp Void)+verify = traverse (const Nothing)++-- | Like 'verify', but chucks an error instead of returning Nothing.+verify' :: Exp a -> Exp Void+verify' e = case verify e of+ Just res -> res+ Nothing -> error "Sylvia.Model.verify': invalid expression"++-- | Create a lambda abstraction.+--+-- If you are using variable names as identifiers, use:+--+-- > abstract (match "foo")+--+-- If you are using de Bruijn indices, use:+--+-- > abstract shiftUp+abstract+ :: (a -> Inc a) -- ^ Matching function+ -> Exp a -- ^ Function body+ -> Exp a -- ^ Result+abstract f = Lam . mapE f++match+ :: Eq a+ => a -- ^ Value to replace+ -> a -- ^ Value to check+ -> Inc a -- ^ Result+match x y = if x == y then O else S y++-- | Add one layer of 'Inc', decrementing the index inside.+--+-- This is the inverse of 'shiftDown'.+shiftUp+ :: Integral a+ => a -- ^ Index to check+ -> Inc a -- ^ Result+shiftUp index+ | index > 0 = S (index - 1)+ | index == 0 = O+ | otherwise = error "matchIndex: index out of range"++-- | Substitute a value into the body of a function.+apply+ :: Exp a -- ^ Argument value+ -> Exp (Inc a) -- ^ Function body+ -> Exp a -- ^ Result+apply e = joinE . mapE (subst e . mapI Ref)++-- | Shift an 'Inc' down by one. If it falls below zero, replace it with+-- the value.+--+-- This is the inverse of 'match': for any value of @x@,+-- @subst x . match x === id@.+subst+ :: a -- ^ Replacement value+ -> Inc a -- ^ Value to shift+ -> a -- ^ Result+subst x O = x+subst _ (S y) = y++-- | Remove one layer of 'Inc', incrementing the index inside.+--+-- In "Sylvia.Text.PrettyPrint", this is used to get the original+-- indices from the structure.+--+-- This is the inverse of 'shiftUp'.+shiftDown+ :: Integral a+ => Inc a+ -> a+shiftDown O = 0+shiftDown (S index) = index + 1++-- | Evaluate an expression to head normal form.+evalHNF :: Exp a -> Exp a+evalHNF e = case e of+ App a b -> let+ -- Recurse in both branches+ a' = evalHNF a+ b' = evalHNF b+ in+ case a' of+ -- If we have a lambda on the left side, apply it+ Lam e' -> evalHNF $ apply b e'+ -- Otherwise, leave them as-is+ _ -> App a' b'+ _ -> e
+ Sylvia/Renderer/Impl.hs view
@@ -0,0 +1,222 @@+-- |+-- Module : Sylvia.Renderer.Impl+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : portable+--+-- This module provides three things:+--+-- 1. An interface, 'RenderImpl', that all rendering methods must+-- implement;+--+-- 2. A function, 'render', that uses the aforementioned interface to+-- draw a pretty picture;+--+-- 3. Another function, 'render'', that spews its internals all over the+-- place.++module Sylvia.Renderer.Impl+ (+ -- * An interface+ RenderImpl(..)++ -- * A function+ , render++ -- * Another function+ , render'+ , Result(..)+ , Rhyme+ , RhymeUnit(..)+ ) where++import Control.Applicative+import Data.Foldable ( foldMap )+import Data.List ( foldl' )+import Data.Monoid+import Data.Void ( Void, vacuous )++import Sylvia.Model+import Sylvia.Renderer.Pair++-- | An action that yields an image.+--+-- 'mempty' should yield an empty image and 'mappend' should stack two+-- images together.+class Monoid r => RenderImpl r where+ -- | Draw a dotted rectangle.+ drawDottedRectangle+ :: PInt -- ^ Corner position+ -> PInt -- ^ Size+ -> r++ -- | Draw a line segment from one point to another.+ drawLine :: PInt -> PInt -> r++ -- | Draw a line, but instead of drawing a diagonal line, draw a+ -- zigzag instead.+ drawZigzag :: PInt -> PInt -> r++ -- | Draw a simple circle segment, centered at a point.+ drawCircleSegment+ :: PInt -- ^ Center point+ -> Double -- ^ Start angle, in radians+ -> Double -- ^ End angle, also in radians. Radians are cool.+ -> r++ -- | Translate the given image by a vector.+ relativeTo :: PInt -> r -> r++-- | Draw a full circle, centered at a point.+drawDot :: RenderImpl r => PInt -> r+drawDot center = drawCircleSegment center 0 (2 * pi)++-- | Draw a box, complete with a throat and ear.+drawBox+ :: RenderImpl r+ => PInt -- ^ Top-left corner point+ -> PInt -- ^ Size+ -> Int -- ^ Y offset of ear and throat+ -> r+drawBox corner size throatY+ = drawDottedRectangle corner size+ <> drawCircleSegment (corner |+| ( 0 :| height + throatY)) (1 * rightAngle) (3 * rightAngle)+ <> drawCircleSegment (corner |+| (width :| height + throatY)) (3 * rightAngle) (1 * rightAngle)+ where+ width :| height = size+ rightAngle = pi / 2++type Rhyme = [RhymeUnit]++-- | Specifies a /rhyme line/: a straight line protruding from the left+-- edge of a bounding box, connecting a variable to the sub-expression+-- that uses it.+data RhymeUnit = RhymeUnit+ { ruIndex :: Integer+ , ruDest :: Int+ }+ deriving (Show)++-- | The result of a rendering operation.+data Result r = Result+ { resultImage :: r+ -- ^ The rendered image.+ , resultSize :: PInt+ -- ^ The size of the image's bounding box in grid units, when all+ -- round things are removed.+ , resultRhyme :: Rhyme+ -- ^ The expression's rhyme.+ , resultThroatY :: Int+ -- ^ The Y offset of the expression's ear and throat, measured+ -- from the /bottom/ of its bounding box.+ }+ deriving (Show)++-- | Render an expression, returning an image along with its size.+render :: RenderImpl r => Exp Void -> (r, PInt)+render e =+ let Result image size rhyme _ = render' $ vacuous e+ in case rhyme of+ [] -> (image, size)+ _ -> error $ "render: the impossible happened -- "+ ++ "extra free variables: " ++ show rhyme++-- | Render an expression, with extra juicy options.+render' :: RenderImpl r => Exp Integer -> Result r+render' e = case e of+ Ref x -> Result mempty (0 :| 0) [RhymeUnit x 0] 0+ Lam e' -> renderLambda e'+ App a b -> Result image size rhyme bThroatY+ where+ image = mconcat $+ -- Draw the two sub-expressions+ [ aImage+ , bImage+ -- Extend the shorter sub-expression so it matches up with+ -- the bigger one+ , extendRhyme (-aWidth) (-bWidth) bRhyme+ -- Connect them with a vertical line+ , drawLine (0 :| aThroatY) (0 :| bThroatY)+ -- Application dot+ , drawDot (0 :| bThroatY)+ ]+ Result aImage (aWidth :| aHeight) aRhyme aThroatY+ = shiftY (-1 - bHeight) $ renderWithThroatLine False bWidth a+ Result bImage (bWidth :| bHeight) bRhyme bThroatY+ = renderWithThroatLine False 1 b+ size = (aWidth :| aHeight + bHeight + 1)+ rhyme = aRhyme ++ bRhyme++-- | Render an expression with a horizontal line sticking out of its+-- throat. Doesn't sound too comfortable, to be honest.+--+-- The 'resultSize' includes the length of this extra line.+renderWithThroatLine+ :: RenderImpl r+ => Bool -- ^ Whether the enclosing expression is a lambda.+ -> Int -- ^ Length of the throat line. This should be positive.+ -> Exp Integer -> Result r+renderWithThroatLine outerIsLam lineLength e = Result image size rhyme throatY+ where+ Result image' size' rhyme throatY' = render' e+ -- Shift the main image to the left, then draw a line next to it+ image = relativeTo (-lineLength :| 0) image' <> throatLine+ throatLine = drawZigzag (-lineLength :| throatY') (0 :| throatY)+ throatY = if outerIsLam && isLambda e then throatY' - 1 else throatY'+ size = size' |+| (lineLength :| 0)++isLambda :: Exp a -> Bool+isLambda (Lam _) = True+isLambda _ = False++-- | Render a lambda expression.+renderLambda :: RenderImpl r => Exp (Inc Integer) -> Result r+renderLambda e' = Result image size rhyme throatY+ where+ Result image' (innerWidth :| innerHeight) innerRhyme throatY+ = shiftY (-1) . renderWithThroatLine True 1 $ fmap shiftDown e'+ image = drawBox (negateP size) size throatY+ <> relativeTo (-width :| 0) rhymeImage+ <> image'+ (rhymeImage, rhyme) = renderRhyme throatY innerRhyme+ rhymeHeight = fromInteger . maximumOr 0 $ map ruIndex innerRhyme+ size@(width :| _) = (innerWidth + 1 :| (max innerHeight rhymeHeight) + 2)++-- | Like 'maximum', but returns a default value on an empty list rather+-- than throwing a hissy fit.+maximumOr :: Ord a => a -> [a] -> a+maximumOr def = foldl' max def++-- | Render an expression's rhyme.+renderRhyme+ :: RenderImpl r+ => Int -- ^ Throat offset (see 'resultThroatY')+ -> Rhyme -- ^ The inner expression's rhyme+ -> (r, Rhyme) -- ^ The resulting image, along with the outer rhyme+renderRhyme throatY innerRhyme = (foldMap renderOne innerRhyme, outerRhyme)+ where+ renderOne (RhymeUnit index dest) = drawLine (0 :| throatY - fromInteger index) (1 :| dest)+ outerRhyme =+ [ RhymeUnit (pred index) (throatY - fromInteger index)+ | RhymeUnit index _ <- innerRhyme+ , index > 0+ ]++-- | Shift an image vertically by a specified amount, changing the rhyme+-- and throat position to compensate.+shiftY :: RenderImpl r => Int -> Result r -> Result r+shiftY dy (Result image size rhyme throatY)+ = Result image' size rhyme' throatY'+ where+ image' = relativeTo (0 :| dy) image+ rhyme' = map shiftRhyme rhyme+ throatY' = throatY + dy++ shiftRhyme :: RhymeUnit -> RhymeUnit+ shiftRhyme (RhymeUnit index dest) = RhymeUnit index (dest + dy)++extendRhyme :: RenderImpl r => Int -> Int -> Rhyme -> r+extendRhyme srcX destX = foldMap $ drawLine+ <$> (srcX :|) . ruDest+ <*> (destX :|) . ruDest
+ Sylvia/Renderer/Impl/Cairo.hs view
@@ -0,0 +1,161 @@+-- |+-- Module : Sylvia.Renderer.Impl.Cairo+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : non-portable (requires FFI)+--+-- Renderer using the Cairo graphics library.++module Sylvia.Renderer.Impl.Cairo+ (+ -- * Types+ Image+ , runImage+ , runImage'+ , Context(..)++ -- * Testing+ , testRender++ -- * Re-exports+ , module Sylvia.Renderer.Impl+ ) where++import Control.Applicative+import Control.Arrow ( (***) )+import Control.Monad.Trans.Class+import Control.Monad.Trans.Reader+import Data.Default+import Data.Monoid ( Monoid(..), (<>) )+import Graphics.Rendering.Cairo++import Sylvia.Renderer.Impl+import Sylvia.Renderer.Pair+import Sylvia.Text.Parser++newtype Image = I { unI :: ImageM () }++type ImageM = ReaderT Context Render++runImage :: Context -> Image -> Render ()+runImage ctx = flip runReaderT ctx . unI++runImage' :: Context -> (Image, PInt) -> (Render (), PInt)+runImage' ctx = runImage ctx *** (ctxGridSize ctx |*|)++-- | Lift a rendering action into the 'ImageM' monad, wrapping it in+-- calls to 'save' and 'restore' to stop its internal state from leaking+-- out.+cairo :: Render a -> ImageM a+cairo action = lift $ do+ save+ result <- action+ restore+ return result++data Context = C+ { ctxGridSize :: PInt+ , ctxOffset :: PInt+ }++instance Default Context where+ def = C { ctxGridSize = (20 :| 10), ctxOffset = (0 :| 0) }++-- | Map a relative coordinate to an absolute one, scaling and shifting+-- it in the process.+getAbsolute :: PInt -> ImageM PDouble+getAbsolute pair = getRelative =<< (pair |+|) <$> asks ctxOffset++-- | Scale a relative coordinate.+getRelative :: PInt -> ImageM PDouble+getRelative pair = fromIntegralP . (pair |*|) <$> asks ctxGridSize++-- | Add a half-pixel offset. This can make lines noticeably sharper, by+-- aligning points to the pixel grid.+addHalf :: PDouble -> PDouble+addHalf = (|+| (0.5 :| 0.5))++instance Monoid Image where+ mempty = I $ return ()+ I a `mappend` I b = I $ a >> b++instance RenderImpl Image where+ drawDottedRectangle corner size = I $ do+ x :| y <- addHalf <$> getAbsolute corner+ dx :| dy <- getRelative size+ cairo $ do+ newPath+ rectangle x y dx dy+ setDash [1, 1] 0.5+ setLineWidth 1+ stroke++ drawLine src dest = I $ do+ x1 :| y1 <- addHalf <$> getAbsolute src+ x2 :| y2 <- addHalf <$> getAbsolute dest+ cairo $ do+ newPath+ moveTo x1 y1+ lineTo x2 y2+ setLineWidth 1+ stroke++ drawZigzag src dest = I $ do+ x1 :| y1 <- addHalf <$> getAbsolute src+ x2 :| y2 <- addHalf <$> getAbsolute dest+ let xmid = (x1 + x2) / 2+ cairo $ do+ newPath+ moveTo x1 y1+ lineTo xmid y1+ lineTo xmid y2+ lineTo x2 y2+ setLineWidth 1+ stroke++ drawCircleSegment center start end = I $ do+ cx :| cy <- getAbsolute center+ -- A dot's diameter is approximately equal to one vertical grid unit+ radius <- asks (fromIntegral . (`div` 2) . sndP . ctxGridSize)+ cairo $ do+ newPath+ arc cx cy radius start end+ setSourceRGB 0 0 0+ fill++ relativeTo delta = I . local addOffset . unI+ where+ addOffset ctx@C{ ctxOffset = offset }+ = ctx{ ctxOffset = offset |+| delta }++dumpPNG :: PInt -> Image -> IO ()+dumpPNG size action = withImageSurface FormatRGB24 w h $ \surface -> do+ -- Fill the background with white+ renderWith surface $ setSourceRGB 1 1 1 >> paint+ -- Render ALL the things+ let action' = relativeTo (1 :| 1) action+ renderWith surface $ runImage def action'+ -- Save the image+ surfaceWriteToPNG surface "result.png"+ where+ w :| h = ctxGridSize def |*| (size |+| (2 :| 2)) -- padding++testRender :: IO ()+testRender = uncurry dumpPNG $ foldl step (0 :| 0, mempty) es+ where+ step ((w :| h), image) e = ((w + w' + 1) :| (max h h'), image <> relativeTo ((w + w') :| h') image')+ where (image', (w' :| h')) = render e+ es = map (fromRight . parseExp) $+ [ "L 0"+ , "LL 1"+ , "LL 0"+ , "LLL 2 0 (1 0)"+ , "(L 0 0) (L 0 0)"+ , "L (L 1 (0 0)) (L 1 (0 0))"+ ]++fromRight :: Show e => Either e a -> a+fromRight e = case e of+ Left sinister -> error $ "Unexpected Left: " ++ show sinister+ Right dextrous -> dextrous
+ Sylvia/Renderer/Pair.hs view
@@ -0,0 +1,71 @@+-- |+-- Module : Sylvia.Renderer.Pair+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : portable+--+-- Strict pairs, and operations on them.++module Sylvia.Renderer.Pair+ (+ -- * Building and dismantling pairs+ P(..)+ , fstP+ , sndP++ -- * Fancy type aliases+ , PInt+ , PDouble++ -- * Operations on pairs+ , (|+|)+ , (|*|)+ , negateP+ , fromIntegralP+ ) where++import Control.Applicative++-- | A strict pair.+data P a = !a :| !a+ deriving (Eq, Ord, Bounded, Read, Show)++infix 5 :|++instance Functor P where+ fmap f (x :| y) = f x :| f y++instance Applicative P where+ pure x = x :| x+ f :| g <*> x :| y = f x :| g y++-- | A pair of integers.+type PInt = P Int++-- | A pair of doubles.+type PDouble = P Double++-- | Add or multiply the corresponding values in two pairs.+(|+|), (|*|) :: Num a => P a -> P a -> P a+(|+|) = liftA2 (+)+(|*|) = liftA2 (*)++infixl 6 |+|+infixl 7 |*|++-- | Negate the contents of a pair.+negateP :: Num a => P a -> P a+negateP = fmap negate++-- | Apply 'fromIntegral' to the contents of a pair.+fromIntegralP :: (Integral a, Num b) => P a -> P b+fromIntegralP = fmap fromIntegral++-- | Get the first element of a pair.+fstP :: P a -> a+fstP (x :| _) = x++-- | Get the second element of a pair.+sndP :: P a -> a+sndP (_ :| y) = y
+ Sylvia/Text/Parser.hs view
@@ -0,0 +1,61 @@+-- |+-- Module : Sylvia.Text.Parser+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : portable+--+-- Basic parser for zero-based de Bruijn index notation.+--+-- Here are some expressions that parse:+--+-- > identity: \ 0+-- > omega: (\ 0 0) (\ 0 0)+-- > starling: \\ 2 0 (1 0)+-- > fixpoint: \ (\ 1 (0 0)) (\ 1 (0 0))+--+-- All variables must have a corresponding lambda, i.e. be bound+-- variables. This means expressions such as @\\ 9001@ will be rejected.++module Sylvia.Text.Parser+ (+ parseExp+ , ParseError+ ) where++import Control.Applicative+import Data.Void ( Void )+import Text.Parsec hiding ( (<|>), many )+import Sylvia.Model++parseExp :: String -> Either ParseError (Exp Void)+parseExp = parse expression' "sylvia"+ where+ expression' = verify' <$> expression 0 <* spaces -- Skip trailing spaces++type Parser = Parsec String ()++expression, term, bracketed, reference, abstraction+ :: Integer -- ^ The number of variables in scope.+ -> Parser (Exp Integer)++expression i = foldl1 App <$> many1 (term i)++term i = try spaces+ *> (bracketed i+ <|> reference i+ <|> abstraction i)++bracketed i = char '(' *> expression i <* spaces <* char ')'+ <?> "bracketed term"++reference i = Ref <$> (checkInRange =<< read <$> many1 digit)+ <?> "de Bruijn index"+ where+ -- Reject an index if it refers to a free variable+ checkInRange index+ | index < i = return index+ | otherwise = parserFail $ "index " ++ show index ++ " out of range"++abstraction i = abstract shiftUp <$> (oneOf "L\\" *> expression (i+1))+ <?> "lambda abstraction"
+ Sylvia/Text/PrettyPrint.hs view
@@ -0,0 +1,42 @@+-- |+-- Module : Sylvia.Text.PrettyPrint+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : portable+--+-- Convert an expression into a form that can be parsed by+-- "Sylvia.Text.Parser".++module Sylvia.Text.PrettyPrint+ (+ pprintExp+ ) where++import Data.Void ( Void, vacuous )+import Sylvia.Model++pprintExp :: Exp Void -> String+pprintExp = ($ "") . pprint . vacuous++pprint :: Exp Integer -> ShowS+pprint e = case e of+ Ref a -> shows a+ Lam e' -> str "(\\" . stackLams (flatten e') . str ")"+ App a b -> pprint a . str " " . case b of+ -- The right term only needs to be bracketed if it contains a+ -- function application+ App _ _ -> str "(" . pprint b . str ")"+ _ -> pprint b++-- | Allow consecutive lambda symbols without adding extra brackets.+stackLams :: Exp Integer -> ShowS+stackLams e = case e of+ Lam e' -> str "\\" . stackLams (flatten e')+ _ -> str " " . pprint e++flatten :: Exp (Inc Integer) -> Exp Integer+flatten = fmap shiftDown++str :: String -> ShowS+str = (++)
+ Sylvia/UI/GTK.hs view
@@ -0,0 +1,70 @@+{-# OPTIONS_GHC -fno-warn-unused-do-bind #-}++-- |+-- Module : Sylvia.UI.GTK+-- Copyright : GPLv3+--+-- Maintainer : chrisyco@gmail.com+-- Portability : portable+--+-- Graphical interface based on Cairo and GTK.++module Sylvia.UI.GTK ( showInWindow ) where++import Data.Default+import Data.Void+import Graphics.Rendering.Cairo+import Graphics.UI.Gtk+import System.IO ( hPutStr, hPutStrLn, stderr )++import Sylvia.Model+import Sylvia.Renderer.Pair+import Sylvia.Renderer.Impl.Cairo++title :: String+title = "Sylvia"++showInWindow :: Exp Void -> IO ()+showInWindow e = do+ "Initializing GTK" -:- do+ initGUI++ window <- "Creating window" -:- do+ window <- windowNew+ set window+ [ windowTitle := title+ , widgetAppPaintable := True+ ]+ onDestroy window mainQuit+ return window++ "Creating canvas" -:- do+ canvas <- drawingAreaNew+ let (_, (w :| h)) = renderCairo e+ widgetSetSizeRequest canvas w h+ set window [ containerChild := canvas ]+ canvas `on` exposeEvent $ updateCanvas e++ "Show ALL the things!" -:- do+ widgetShowAll window+ mainGUI++updateCanvas :: Exp Void -> EventM EExpose Bool+updateCanvas e = do+ win <- eventWindow+ liftIO $ do+ let (action, size) = renderCairo e+ let (w :| h) = fmap fromIntegral $ size |+| ctxGridSize def+ renderWithDrawable win $ translate w h >> action+ return True++renderCairo :: Exp Void -> (Render (), PInt)+renderCairo = runImage' def . render++infixr 1 -:-+(-:-) :: String -> IO a -> IO a+msg -:- action = do+ hPutStr stderr msg+ result <- action+ hPutStrLn stderr " ... done"+ return result
+ sylvia.cabal view
@@ -0,0 +1,71 @@+Name: sylvia+Version: 0.2.0.1+Synopsis: Lambda calculus visualization+Category: Game++Description:+ The Simple Yuser-friendly Lambda Visualization Interaction Application (SYLVIA)+ is a unique way to manipulate untyped lambda calculus expressions, by+ representing them as boxes connected by wires.+ .+ It is an implementation of an idea by Keenan (1996). See+ <http://dkeenan.com/Lambda> for the theory behind this application.++Homepage: https://github.com/lfairy/sylvia+Bug-Reports: https://github.com/lfairy/sylvia/issues++Author: Chris Wong+Maintainer: chrisyco@gmail.com++License: GPL+License-File: LICENSE+Copyright: 2011 Chris Wong++Build-Type: Simple+Extra-Source-Files: README.mkd+Cabal-Version: >= 1.8+++Executable sylvia+ Main-Is: Main.hs+ Build-Depends:+ base == 4.*+ , data-default+ , parsec >= 3.1.2 && < 3.2+ , transformers+ , void >= 0.5.5 && < 0.6+ , cairo+ , gtk++ Other-Modules:+ Sylvia.Model+ Sylvia.Renderer.Impl+ Sylvia.Renderer.Impl.Cairo+ Sylvia.Renderer.Pair+ Sylvia.Text.Parser+ Sylvia.Text.PrettyPrint+ Sylvia.UI.GTK++ GHC-Options: -Wall+++Test-Suite tests+ Type: exitcode-stdio-1.0+ Hs-Source-Dirs: tests, .+ Main-Is: Properties.hs+ Build-Depends:+ base+ , void+ , parsec++ , test-framework >= 0.3.3 && < 0.7+ , test-framework-smallcheck+ >= 0.1 && < 0.2+ , smallcheck >= 0.6 && < 0.7++ GHC-Options: -Wall -fno-warn-orphans+++Source-Repository head+ Type: git+ Location: https://github.com/lfairy/sylvia.git
+ tests/Properties.hs view
@@ -0,0 +1,71 @@+import Control.Applicative+import Control.Monad+import Data.Maybe ( isJust )+import Data.Void ( Void )++import Test.Framework+import Test.Framework.Providers.SmallCheck+import Test.SmallCheck.Series++import Sylvia.Model+import Sylvia.Text.Parser+import Sylvia.Text.PrettyPrint++instance Serial Void where+ series _ = []+ coseries _ _ = []++instance Serial a => Serial (Inc a) where+ series = cons0 O \/ cons1IgnoreDepth S+ where+ cons1IgnoreDepth c d = [c z | z <- series d]++ coseries rs d = [ \i -> case i of+ O -> z+ S x -> f x+ | z <- alts0 rs d+ , f <- alts1 rs d+ ]++instance Serial a => Serial (Exp a) where+ series = cons1 Ref \/ cons1 Lam \/ cons2 App+ coseries rs d = [ \e -> case e of+ Ref x -> f x+ Lam e' -> g e'+ App a b -> h a b+ | f <- alts1 rs d+ , g <- alts1 rs d+ , h <- alts2 rs d+ ]++-- | Converting an expression to a string, then back again should result+-- in the same expression.+prop_parse_pprint :: Exp Void -> Bool+prop_parse_pprint orig = isJust $ do+ new <- eitherToMaybe . parseExp . pprintExp $ orig+ guard $ orig == new+ where+ eitherToMaybe = either (const Nothing) Just++prop_subst_match :: Int -> Int -> Bool+prop_subst_match x y = (subst x . match x) y == y++prop_shiftDown_shiftUp :: N Int -> Bool+prop_shiftDown_shiftUp (N x) = (shiftDown . shiftUp) x == x++main :: IO ()+main = defaultMain $ map (plusTestOptions options)+ [ testProperty "parse.pprint" prop_parse_pprint+ , testProperty "subst.match" prop_subst_match+ , testProperty "shiftDown.shiftUp" prop_shiftDown_shiftUp+ ]++options :: TestOptions+options = TestOptions+ { topt_maximum_test_depth = Just 5+ , topt_timeout = Nothing+ , topt_seed = Nothing+ , topt_maximum_generated_tests = Nothing+ , topt_maximum_unsuitable_generated_tests = Nothing+ , topt_maximum_test_size = Nothing+ }