caldims (empty) → 0.1.0
raw patch · 13 files changed
+2567/−0 lines, 13 filesdep +basedep +containersdep +directorysetup-changed
Dependencies added: base, containers, directory, haskell98, mtl, parsec, readline
Files
- LICENSE +674/−0
- Setup.hs +4/−0
- caldims.cabal +31/−0
- src/Language/CalDims/Action.hs +614/−0
- src/Language/CalDims/Expr.hs +96/−0
- src/Language/CalDims/Expression.hs +293/−0
- src/Language/CalDims/Helpers.hs +80/−0
- src/Language/CalDims/Misc.hs +176/−0
- src/Language/CalDims/Program.hs +141/−0
- src/Language/CalDims/State.hs +81/−0
- src/Language/CalDims/Texts.hs +204/−0
- src/Language/CalDims/Types.hs +167/−0
- tool/Main.hs +6/−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>.
+ Setup.hs view
@@ -0,0 +1,4 @@+import Distribution.Simple+main = defaultMain++
+ caldims.cabal view
@@ -0,0 +1,31 @@+name: caldims+version: 0.1.0+license: GPL+license-file: LICENSE+copyright: Copyright (c) 2007 Marcel Manthe+maintainer: Rick Kaudewitz <rick.kaudewitz@yahoo.de>+category: Math+stability: experimental+synopsis: Calculation tool and library supporting units+description: CalDims is an easy to use tool for defining functions and units + (basic and derrived), so it can provide dimension-save calculation+ (not embedded but via shell).+ghc-options: -Wall -fno-warn-orphans+exposed-Modules: + Language.CalDims.Expression, + Language.CalDims.Action,+ Language.CalDims.Misc,+ Language.CalDims.Program,+ Language.CalDims.State,+ Language.CalDims.Expr,+ Language.CalDims.Helpers,+ Language.CalDims.Texts,+ Language.CalDims.Types+build-depends: base, haskell98, parsec, readline, mtl, containers, directory+hs-source-dirs: src+build-type: Simple++executable: caldims+ghc-options: -Wall -fno-warn-orphans+main-is: Main.hs+hs-source-dirs: tool src
+ src/Language/CalDims/Action.hs view
@@ -0,0 +1,614 @@+{-# LANGUAGE FlexibleInstances, CPP, MultiParamTypeClasses #-}+module Language.CalDims.Action + ( Command (..)+ , Result (..)+ , Mon+ , run+ , eval+ , doCall+ , dependencies+ , evalDimsPart+ , process) where++import Language.CalDims.Helpers+import Language.CalDims.Types+import Language.CalDims.Texts as Texts+import Language.CalDims.State +import Language.CalDims.Expr ()++import Control.Monad.State hiding (State)+import qualified Control.Monad.State as SM+import Control.Monad.Error+import qualified Data.Map as Map+import Data.Ratio+import Data.List (nub)++#ifdef DEBUG+import Debug.Trace+#endif++data Command + = AddFunction Name Args Expr + | AddBasicUnit Name + | AddUnit Name Expr + | Echo String + | Remove Name + | RemoveCascade Name + | Help+ | Eval Expr Conversion+ | EvalDimsPart Expr+ | DebugExpr Expr + | DebugName Name + | DebugDependencies Name + | GetState + | WriteState String deriving Show++instance Pretty Command where pretty = show++data Result = Ok (Maybe String) | StringResult String | EvaledResult (R, Dims) | ExprResult Expr | DimsResult Dims | WriteStringToFile String String deriving Show+instance Pretty Result where+ pretty (Ok Nothing) = "ok."+ pretty (Ok (Just s)) = "ok, but " ++ s+ pretty (StringResult s) = s+ pretty (EvaledResult (r, dims)) = let d = pretty dims in + pretty r ++ (if null d then "" else " " ++ pretty dims)+ pretty (DimsResult dims) = pretty dims+ pretty (ExprResult e) = pretty e+ pretty (WriteStringToFile _ fn) = "Writing state to " ++ fn ++ "."+++minEval :: Expr -> Mon (R, Dims)+minEval e = do+ x <- eval e+ dims <- minDims (snd x)+ convert x dims++type Mon a = ErrorAndState String State a++process :: Command -> Mon Result+process (AddFunction n args expr) = insert n $ Function args expr+process (AddBasicUnit n) = insert n $ BasicDimension+process (AddUnit n expr) = insert n $ Dimension expr+process (Echo s) = return $ StringResult s+process (Remove n) = remove False n +process (RemoveCascade n) = remove True n +process Help = return $ StringResult (show Texts.helpText)+process (Eval expr conv) = do+ res <- eval expr+ case conv of+ Keep -> return $ EvaledResult res+ Explicit dims -> do+ res' <- convert res dims+ return $ EvaledResult res'+ InTermsOf tExpr -> do+ r@(n,_) <- minEval tExpr+ if (n==0) + then fail "cannot express in terms of 0."+ else do+ r' <- minEval (Bin Div expr (Evaled r))+ return $ ExprResult (Bin Mul (Evaled r') tExpr) + -- FIXME: there are actually 3 ways to combine:+ -- a/b b/a and a*b -> choose the simplest+ Basic -> do+ res' <- convertBasic res+ return $ EvaledResult res'+ Minimal -> do+ dims <- minDims (snd res)+ res' <- convert res dims+ return $ EvaledResult res'++process (EvalDimsPart expr) = do+ res <- evalDimsPart expr+ return $ DimsResult res+process (DebugExpr expr) = return $ StringResult $ pretty expr+process (DebugName n) = do+ entry <- requireEntry n+ return $ StringResult (pretty (n, entry))+process (DebugDependencies n) = do+ d <- dependencies n+ r <- reverseDependencies n+ return $ StringResult (unlines' [pretty d, pretty r])+ +process GetState = do+ state <- get+ return $ StringResult (pretty state)+process (WriteState file) = do+ state <- get+ return $ WriteStringToFile (pretty state) file+ ++instance Pretty State where --FIXME: the implementation might be too complex+ pretty s = case (runState $ runErrorT f) s of+ (Left e, _) -> error e+ (Right l, _) -> unlines' l + where + f = do+ state <- get+ depList <- liftM nub $ liftM reverse $ liftM (filter (not . isBuiltin state)) $ liftM concat $ sequence $ map dependencies' (Map.keys $ getScope state)+ mapM pretty' depList++ pretty' :: Name -> Mon String+ pretty' n = do+ e <- requireEntry n+ return $ pretty (n, e)+++remove :: Bool -> Name -> Mon Result+remove casc n = do+ rd <- reverseDependencies n+ case (null rd, casc) of+ (True, False) -> remove_ >> return (Ok Nothing)+ (_, True) -> removeList_ (n:rd) >> return (Ok Nothing)+ (False, False) -> throwError $ "Please remove " ++ pretty rd ++ " first, or remove " ++ pretty n ++ " cascading."+ where+ remove_ = modi $ Map.delete n+ removeList_ l = modi $ Map.filterWithKey (\x _ -> not $ x `elem` l)+++modi :: (Scope -> Scope) -> Mon ()+modi f = modify (\x -> x {getScope = f (getScope x)})+++insert :: Name -> StateEntry -> Mon Result+insert n newEntry = let + doInsert = modi $ Map.insert n newEntry in do + oldEntry <- getEntry n+ warn <- case oldEntry of+ Nothing -> doInsert >> return Nothing+ Just oldEntry_ -> do+ i <- typeIsomorph newEntry oldEntry_+ if i+ then doInsert >> return (Just "an object has changed")+ else throwError $ "There already is an object `" ++ pretty n ++ "` with another type."+ return (Ok warn)+++dependencies' :: Name -> Mon [Name]+dependencies' n = do+ d <- dependencies n+ return $ n:d+++dependencies :: Name -> Mon [Name]+dependencies n = do+ e <- requireEntry n+ return $ nub $ case e of+ (Function args def) -> f args def+ (Dimension expr) -> getDepsExpr expr+ (BasicDimension) -> []+ (Builtin args def) -> f args def++ where f args def = concatMap getDepsArg args ++ getDepsExpr def+++getDepsExpr :: Expr -> [Name]+getDepsExpr (Bin _ expr1 expr2) = getDepsExpr expr1 ++ getDepsExpr expr2+getDepsExpr (Uni _ expr) = getDepsExpr expr+getDepsExpr (ArgRef _) = []+getDepsExpr (Call n es) = n : concatMap getDepsExpr es+getDepsExpr (Evaled (_, d)) = getDepsDims d++getDepsArg :: Arg -> [Name]+getDepsArg = getDepsDims . getArgType++getDepsDims :: Dims -> [Name]+getDepsDims (Dims d) = Map.keys d++reverseDependencies :: Name -> Mon [Name]+reverseDependencies n = do+ state <- get+ let + all_ = Map.keys (getScope state)+ filterF name_ = do+ d <- dependencies name_+ return $ n `elem` d++ res <- liftM nub $ filterM filterF all_+ if n `elem` all_+ then return res+ else fail ("no such thing: " ++ unName n)+ ++getEntry :: Name -> Mon (Maybe StateEntry)+getEntry s = do+ state <- get+ return $ Map.lookup s (getScope state)++requireEntry :: Name -> Mon StateEntry+requireEntry n = do+ e <- getEntry n+ case e of+ Nothing -> throwError $ "No such object: " ++ pretty n+ Just sth -> return sth++requireFunction :: Name -> Mon (Args, Expr)+requireFunction n = do+ e <- requireEntry n+ case e of+ Function args expr -> return (args, expr)+ Builtin args expr -> return (args, expr)+ _ -> throwError $ pretty n ++ " is not a function"++typeIsomorph :: StateEntry -> StateEntry -> Mon Bool+typeIsomorph a b = case (a, b) of+ (BasicDimension, BasicDimension) -> return True+ (_, BasicDimension) -> return False+ (BasicDimension, _) -> return False+ (Dimension e1, Dimension e2) -> check1 e1 e2+ (Dimension _, _) -> return False+ (_, Dimension _) -> return False++ (Function a1 e1, Function a2 e2) -> check2 e1 e2 a1 a2+ (Builtin a1 e1, Builtin a2 e2) -> check2 e1 e2 a1 a2 -- FIXME rplc Builtin by Function Bool+ (Builtin a1 e1, Function a2 e2) -> check2 e1 e2 a1 a2+ (Function a1 e1, Builtin a2 e2) -> check2 e1 e2 a1 a2+++check1 :: Expr -> Expr -> Mon Bool+check1 e1 e2 = checkReturnDims (e1, []) (e2, [])++checkReturnDims :: (Expr, Args) -> (Expr, Args) -> Mon Bool+checkReturnDims (e1, a1) (e2, a2) = do+ (_, d1) <- doCall' a1 e1 (f a1)+ (_, d2) <- doCall' a2 e2 (f a2)+ (return d1 #==# return d2)++ where + f = map f'+ f' :: Arg -> (R, Dims)+ f' a = (undefined, getArgType a)++--doCall' :: Args -> Expr -> [(R, Dims)] -> Mon (R, Dims)++check2 :: Expr -> Expr -> Args -> Args -> Mon Bool+check2 e1 e2 a1 a2 = (return a1 #==# return a2) #&&# checkReturnDims (e1, a1) (e2, a2)++evalDimsPart :: Expr -> Mon Dims+evalDimsPart e = do+ res <- eval e+ return $ snd res++eval :: Expr -> Mon (R, Dims)+eval (Call n args) = do+ args' <- mapM eval args+ doCall n args'++eval (ArgRef (Arg _ i _)) = do+ state <- get+ getArgValues state #!!# i++eval (Bin Add e1 e2) = eval e1 #+# eval e2+eval (Bin Sub e1 e2) = eval e1 #-# eval e2+eval (Bin Mul e1 e2) = eval e1 #*# eval e2+eval (Bin Div e1 e2) = eval e1 #/# eval e2+eval (Bin Exp e1 e2) = eval e1 #^# eval e2+eval (Bin LogBase e1 e2) = eval e1 #~# eval e2++eval (Uni Negate e) = negateM $ eval e+eval (Uni Expot e) = expM $ eval e+eval (Uni Log e) = logM $ eval e+eval (Uni Sin e) = sinM $ eval e+eval (Uni Cos e) = cosM $ eval e+eval (Uni Tan e) = tanM $ eval e+eval (Uni Asin e) = asinM $ eval e+eval (Uni Acos e) = acosM $ eval e+eval (Uni Atan e) = atanM $ eval e+eval (Uni Sinh e) = sinhM $ eval e+eval (Uni Cosh e) = coshM $ eval e+eval (Uni Tanh e) = tanhM $ eval e+eval (Uni Asinh e) = asinhM $ eval e+eval (Uni Acosh e) = acoshM $ eval e+eval (Uni Atanh e) = atanhM $ eval e++eval (Evaled e) = return e++(#!!#) :: Pretty a => [a] -> Int -> Mon a+vals #!!# i = if (i < 0) || (length vals < i + 1)+ then throwError $ "Index out of bounds: " ++ pretty vals ++ "!!" ++ pretty i+ else return $ vals !! i+++doCall :: Name -> [(R, Dims)] -> Mon (R, Dims)+doCall n args = do+ (sig, expr) <- requireFunction n+ doCall' sig expr args++doCall' :: Args -> Expr -> [(R, Dims)] -> Mon (R, Dims)+doCall' sig expr args = do++ state <- get+ let old = getArgValues state+ modify (\x -> x {getArgValues = args})++ when (length sig /= length args) (throwError "wrong number of arguments")+ c <- check (zip (map snd args) sig)+ when (not c) (throwError "wrong typed argument")++ res <- eval expr+ modify (\x -> x {getArgValues = old})+ + return $ res++check, check' :: [(Dims, Arg)] -> Mon Bool++#ifdef DEBUG+check l = trace (show l) (check' l)+#else+check = check'+#endif++check' [] = return True+check' ((d', (Arg _ _ d)):as) = (return d' #==# return d) #&&# (check' as)+++instance EqM Arg (ErrorT String (SM.State State)) where+ (#==#) a b = do+ (Arg _ i1 t1) <- a+ (Arg _ i2 t2) <- b+ t <- (return t1) #==# (return t2)+ return (t && i1 == i2)++instance EqM [Arg] (ErrorT String (SM.State State)) where+ (#==#) l1 l2 = let+ nullM = liftM null+ nNullM = liftM (not . null)+ headM = liftM head+ tailM = liftM tail in+ caseM+ [ (nullM l1 #&&# nullM l2, return True)+ , (nNullM l1 #&&# nullM l2, return False)+ , (nullM l1 #&&# nNullM l2, return False)]+ ((headM l1 #==# headM l2) #&&# (tailM l1 #==# tailM l2))++caseM :: Monad m => [(m Bool, m a)] -> m a -> m a+caseM [] base = base+caseM ((cond, res):rest) base = ifM cond res (caseM rest base)++ifM :: Monad m => (m Bool) -> m a -> m a -> m a+ifM cond f s = do+ cond' <- cond+ if cond' then f else s++convertBasic :: (R, Dims) -> Mon (R, Dims)+convertBasic (r1, d1) = do+ (r2, d2) <- compileDims d1+ return (r1*r2, d2)+++convert :: (R, Dims) -> Dims -> Mon (R, Dims)+convert (r, d) target = ifM+ ((return d) #==# (return target))+ (do+ (ra, _) <- compileDims d+ (rb, _) <- compileDims target+ return (r * ra / rb, target))+ (throwError "Conversion to incompatible dimensions not possible.")++compileDims :: Dims -> Mon (R, Dims)+compileDims d = do+ (r, d_) <- compileDims' d+ return (r, Dims $ (Map.filter (/=0) . unDims) d_)++compileDims' :: Dims -> Mon (R, Dims)+compileDims' d = case dims2list d of+ [] -> return (1, noDims)+ [(n, i)] -> do+ e <- requireEntry n+ case e of + BasicDimension -> return (1, Dims $ Map.singleton n i)+ Dimension expr -> do+ (r1, d1) <- eval (Bin Exp expr (Evaled (i, noDims)))+ (r2, d2) <- compileDims d1+ return (r1*r2, d2)+ _ -> throwError $ pretty n ++ " is not a unit"+ ((n,i):ds) -> do+ (r1, d1) <- compileDims (Dims $ Map.singleton n i)+ (r2, d2) <- compileDims (Dims $ Map.fromList ds)+ d_ <- (return d1) #*# (return d2)+ return (r1*r2, d_)++dims2list :: Dims -> [(Name, R)]+dims2list d = Map.toList ((Map.filter (/=0) . unDims) d)++canonicalizeDims :: Dims -> Mon Dims+canonicalizeDims d = do+ c <- compileDims d+ return $ snd c++instance EqM Dims (ErrorT String (SM.State State)) where+ (#==#) d1 d2 = do+ d1' <- d1+ d2' <- d2+ let + c1 = canonicalizeDims d1'+ c2 = canonicalizeDims d2'+ res <- (liftM2 (\a b -> unDims a == unDims b)) c1 c2+# ifdef DEBUG+ d1'' <- c1+ d2'' <- c2+ return $ trace (show d1'' ++ " #==# " ++ show d2'' ++ " -> " ++ show res) res+# else+ return res+# endif++instance MulM Dims (ErrorT String (SM.State State)) where+ (#*#) = std (+)++instance DivM Dims (ErrorT String (SM.State State)) where+ (#/#) e1 e2 = std (+) e1 (std' negate e2)++dou :: R -> D+dou x = (fromIntegral . numerator) x / (fromIntegral . denominator) x++rat :: D -> R+rat = toRational+++instance ExpM (R, Dims) (ErrorT String (SM.State State)) where+ a #^# b = do+ (ra, da) <- a+ (rb, db) <- b+ na <- nullD da+ nb <- nullD db+ let rn = rat $ dou ra ** dou rb+ case (na, nb) of+ (True, True) -> return (rn, noDims)+ (False, True) -> if_ (denominator rb == 1)+ (do d <- da *** rb; return (rn, d))+ (do+ (r, d) <- convertBasic (ra, da)+ d' <- d *** rb+ return (rat $ dou r ** dou rb, d'))+ (_, False) -> throwError $ "Operation requires a number without unit: " ++ pretty (Evaled (ra, da)) ++ " #^# " ++ pretty (Evaled (rb, db))++toI :: Integral a => Ratio a -> Mon a+toI x = let a = numerator x; b = denominator x in+ if_ (b == 1) (return a) (throwError "Integer required.")++instance LogBaseM (R, Dims) (ErrorT String (SM.State State)) where + a #~# b = do+ (ra, da) <- a+ (rb, db) <- b+ ifM (nullD da #&&# nullD db) (return $ (rat $ logBase (dou ra) (dou rb), noDims))+ (do+ ia <- toI ra+ ib <- toI rb+ case logBaseInt ia ib of+ Nothing -> throwError "Integer exponent required for logbase on values with dimensions."+ Just re -> do+ ifM (da *** (re%1) #==# return db)+ (return ((re%1), noDims))+ (throwError "Dimensions are in other logbase relation than the numbers"))+{-+(***) :: Dims -> R -> Mon Dims+(***) (Dims d) r = do+ let res = Map.map (\x -> x * r) d+ if Map.null $ Map.filter (\x -> denominator x /= 1) res+ then return $ Dims $ Map.map (fromIntegral . numerator) res+ else throwError $ "Operation requires a number without unit: " ++ pretty (Dims d) ++ " *** " ++ pretty r+-}++(***) :: Dims -> R -> Mon Dims+(***) (Dims d) r = return (Dims $ Map.map (\x -> x * r) d)+++std :: Monad m => (R -> R -> R) -> (m Dims -> m Dims -> m Dims)+std f = liftM2 (\ a b -> Dims $ Map.unionWith f (Map.filter (/=0) $ unDims a) (Map.filter (/=0) $ unDims b))++std' :: Monad m => (R -> R) -> (m Dims -> m Dims)+std' f = liftM (\ a -> Dims $ Map.map f (Map.filter (/=0) $ unDims a))++nullD :: Dims -> Mon Bool+nullD d = return d #==# return noDims++run :: State -> Command -> (Either String Result, State)+run state command = (runState $ runErrorT (process command)) state++uniInstance :: (Double -> Double) -> Mon (R, Dims) -> Mon (R, Dims)+uniInstance fr a = do+ (r, d) <- a+ return (rat . fr . dou $ r, d)++minDims :: Dims -> Mon Dims+minDims d = do+ state <- get+ let+ isDims = (\x -> case x of BasicDimension -> True; (Dimension _) -> True; _ -> False)+ neg a = justDo (return noDims #/# return a)+ allDims = map (\x -> Dims $ Map.singleton x 1) $ Map.keys $ Map.filter isDims $ getScope state++ test :: Dims -> Mon Bool+ test d' = return d' #==# return d++ merge :: [Dims] -> Dims+ merge = foldl (\a b -> justDo (return a #*# return b)) noDims++ combineUpTo :: Int -> [a] -> [[a]]+ combineUpTo i l = concatMap (\i' -> combination i' l) [1..i]++ unique :: [Dims] -> [(Dims, [Dims])]+ unique = eqClassesWith (\a b -> justDo (return a #==# return b))+ + dims = map fst $ unique allDims++ justDo f = case fst $ (runState $ runErrorT f) state of Left e -> error e; Right b -> b++ dimsList = map merge $ combineUpTo 2 $ (map neg dims ++ dims)++ liftM (headWithDefault d) $ filterM test $ dimsList++instance AddM (R, Dims) (ErrorT String (SM.State State)) where + ( #+# ) = linear (+)++linear :: (R -> R -> R) -> Mon (R, Dims) -> Mon (R, Dims) -> Mon (R, Dims)++linear f a b = do+ (ra, da) <- a+ b'@(_, db) <- b+ (rb, _) <- convert b' da++ ifM (return da #==# return db)+ (return (f ra rb, da))+ (throwError "Incompatible dimensions cannot be added.")++muldiv :: (R -> R -> R) -> (Mon Dims -> Mon Dims -> Mon Dims) + -> Mon (R, Dims) -> Mon (R, Dims) -> Mon (R, Dims)+muldiv fr fd a b = do+ (ra, da) <- a+ (rb, db) <- b+ d <- fd (return da) (return db)+ return (fr ra rb, d)++instance SubM (R, Dims) (ErrorT String (SM.State State)) where + ( #-# ) = linear (-)++instance MulM (R, Dims) (ErrorT String (SM.State State)) where + ( #*# ) = muldiv (*) ( #*# )++instance DivM (R, Dims) (ErrorT String (SM.State State)) where + ( #/# ) = muldiv (/) ( #/# )++instance NegateM (R, Dims) (ErrorT String (SM.State State)) where + negateM = liftM (\ (r,d) -> (negate r, d))++instance ExpotM (R, Dims) (ErrorT String (SM.State State)) where + expM = uniInstance exp++instance LogM (R, Dims) (ErrorT String (SM.State State)) where + logM = uniInstance log++instance SinM (R, Dims) (ErrorT String (SM.State State)) where + sinM = uniInstance sin++instance CosM (R, Dims) (ErrorT String (SM.State State)) where + cosM = uniInstance cos++instance TanM (R, Dims) (ErrorT String (SM.State State)) where + tanM = uniInstance tan++instance AsinM (R, Dims) (ErrorT String (SM.State State)) where + asinM = uniInstance asin++instance AcosM (R, Dims) (ErrorT String (SM.State State)) where + acosM = uniInstance acos++instance AtanM (R, Dims) (ErrorT String (SM.State State)) where + atanM = uniInstance atan++instance SinhM (R, Dims) (ErrorT String (SM.State State)) where + sinhM = uniInstance sinh++instance CoshM (R, Dims) (ErrorT String (SM.State State)) where + coshM = uniInstance cosh++instance TanhM (R, Dims) (ErrorT String (SM.State State)) where + tanhM = uniInstance tanh++instance AsinhM (R, Dims) (ErrorT String (SM.State State)) where + asinhM = uniInstance asinh++instance AcoshM (R, Dims) (ErrorT String (SM.State State)) where + acoshM = uniInstance acosh++instance AtanhM (R, Dims) (ErrorT String (SM.State State)) where + atanhM = uniInstance atanh
+ src/Language/CalDims/Expr.hs view
@@ -0,0 +1,96 @@+{-# LANGUAGE FlexibleInstances #-}++module Language.CalDims.Expr + ( Expr (..)+ , BinOp (..)+ , UniOp (..))+ +where++import Language.CalDims.Types++instance Pretty BinOp where+ pretty Add = " + "+ pretty Sub = " - "+ pretty Mul = " * "+ pretty Div = " / "+ pretty Exp = " ^ "+ pretty LogBase = " ~ "++instance Pretty (R, Dims) where+ pretty = pretty . Evaled++instance Pretty Expr where++ pretty (Evaled (r, d)) = let d' = pretty d in+ pretty r ++ (if null d' then "" else " " ++ d')++ pretty expr@(Bin kind a b) = s1 ++ pretty kind ++ s2++ where+ p = priority expr++ -- exp is right-associative+ s1 = if kind == Exp then prettyP2 p a else prettyP1 p a++ s2 = case (kind == Exp, isAssoc kind) of+ (True, _) -> prettyP1 p b+ (_, True) -> prettyP1 p b+ _ -> prettyP2 p b++ pretty (Uni Negate a) = "-" ++ prettyP1 P_Negate a++ pretty (Uni Expot a) = oneF "exp" a+ pretty (Uni Log a) = oneF "log" a+ pretty (Uni Sin a) = oneF "sin" a+ pretty (Uni Cos a) = oneF "cos" a+ pretty (Uni Tan a) = oneF "tan" a+ pretty (Uni Asin a) = oneF "asin" a+ pretty (Uni Acos a) = oneF "acos" a+ pretty (Uni Atan a) = oneF "atan" a+ pretty (Uni Sinh a) = oneF "sinh" a+ pretty (Uni Cosh a) = oneF "cosh" a+ pretty (Uni Tanh a) = oneF "tanh" a+ pretty (Uni Asinh a) = oneF "asinh" a+ pretty (Uni Acosh a) = oneF "acosh" a+ pretty (Uni Atanh a) = oneF "atanh" a++ pretty (ArgRef (Arg name _ _)) = name+ pretty (Call name []) = pretty name+ pretty (Call name argList) = pretty name ++ " (" ++ (pretty $ head argList) ++ (unwords $ map (\x -> ", " ++ pretty x) $ tail argList) ++ ")"++++-- Functions++priority :: Expr -> Priority+priority (Bin Add _ _) = P_Add+priority (Bin Sub _ _) = P_Add+priority (Bin Mul _ _) = P_Mul+priority (Bin Div _ _) = P_Mul+priority (Bin Exp _ _) = P_Exp+priority (Uni Negate _) = P_Negate+priority (Evaled _) = P_Mul+priority _ = P_Elementary++isAssoc :: BinOp -> Bool+isAssoc Add = True+isAssoc Mul = True+isAssoc _ = False++prettyB :: Expr -> String+prettyB a@(Evaled _) = pretty a+prettyB a@(Call _ _) = pretty a+prettyB a@(ArgRef _) = pretty a+prettyB a@(Bin _ _ _) = "(" ++ pretty a ++ ")"+prettyB a@(Uni _ _) = "(" ++ pretty a ++ ")"++prettyP1, prettyP2 :: Priority -> Expr -> String+prettyP1 = prettyP' (>)+prettyP2 = prettyP' (>=)++prettyP' :: (Priority -> Priority -> Bool) -> Priority -> Expr -> String+prettyP' f p e = if p `f` priority e then prettyB e else pretty e++oneF :: String -> Expr -> String+oneF fn e = fn ++ " (" ++ pretty e ++ ")"
+ src/Language/CalDims/Expression.hs view
@@ -0,0 +1,293 @@+{-# LANGUAGE CPP #-}+module Language.CalDims.Expression + ( parseExpr+ , parseName+ , parseExistingName+ , parseBindE+ , parseEinh+ , parseBind+ , brackets+ , parseNonRecursiveExpr+ , parseColon+ , parseComma+ , flush) where++import Text.ParserCombinators.Parsec+import Text.ParserCombinators.Parsec.Prim+import Text.ParserCombinators.Parsec.Expr+import Ratio ((%))+import Control.Monad.Error+import Control.Monad.State+import Control.Monad+import qualified Data.Map as Map++#ifdef DEBUG+import Debug.Trace+#endif++import Language.CalDims.Expr ()+import Language.CalDims.Types+import Language.CalDims.Action+import Language.CalDims.State as State+import Language.CalDims.Helpers++requireEntry :: Name -> MyParser StateEntry+requireEntry n = do+ state <- getState+ case Map.lookup n (getScope state) of+ Nothing -> fail $ "No such object: " ++ pretty n+ Just sth -> return sth++hnn, hasNotName :: Expr -> Name -> MyParser Bool+#ifdef DEBUG+hasNotName e n = do+ res <- hnn e n+ return $ trace (show e ++ " `hasNotName` " ++ show n ++ " -> " ++ show res) res+#else+hasNotName = hnn+#endif++(Bin _ e1 e2) `hnn` n = (e1 `hasNotName` n) #&&# (e2 `hasNotName` n)+(Uni _ e) `hnn` n = e `hasNotName` n+(ArgRef _) `hnn` _ = return True+(Call fn args) `hnn` n = do+ e_ <- requireEntry fn+ case e_ of+ Function _ e -> (return (fn /= n)) #&&# (liftM and) (sequence (map (`hasNotName` n) args)) #&&# (e `hasNotName` n)+ _ -> return True -- call to builtin++(Evaled (_, Dims m)) `hnn` n = do+ state <- getState+ let exprs = Map.elems $ Map.mapMaybeWithKey (\k v -> if_ + (k `Map.member` m) + (case v of Dimension e -> Just e; _ -> Nothing) + Nothing) (getScope state)+ (return $ not (n `Map.member` m)) #&&# (liftM and) (sequence (map (`hasNotName` n) exprs))++flush :: GenParser Char State.State (IO(), State.State)+flush = do+ many $ noneOf []+ eof+ s <- getState+ return (return (), s)++binary :: String -> (Expr -> Expr -> Expr) -> Assoc -> Operator Char State.State Expr+binary s f assoc = Infix (do+ string s+ spaces+ return f) assoc++parseExpr :: MyParser Expr+parseExpr = do+ buildExpressionParser table factor+ <?> "expression"++parseNonRecursiveExpr :: Name -> MyParser Expr+parseNonRecursiveExpr n = do+ e <- parseExpr+ t <- e `hasNotName` n+ case t of+ True -> return e+ False -> fail "No recursion supported."++table :: OperatorTable Char State.State Expr+table = [+ [Prefix (do+ parseMinus+ return $ Uni Negate)],+ [binary "^" (Bin Exp) AssocRight],+ [Postfix (do + d <- parseEinh+ return $ mulMerge (Evaled (1, d)))],+ [binary "~" (Bin LogBase) AssocLeft],+ [binary "*" (Bin Mul) AssocLeft, binary "/" (Bin Div) AssocLeft],+ [binary "+" (Bin Add) AssocLeft, binary "-" (Bin Sub) AssocLeft]+ ]+ ++mulMerge :: Expr -> Expr -> Expr+mulMerge (Evaled (ra, da)) (Evaled (rb, db)) = Evaled (ra*rb, f da db) where + f a b = Dims $ Map.unionWith (+) (Map.filter (/=0) $ unDims a) (Map.filter (/=0) $ unDims b)+mulMerge e1 e2 = Bin Mul e1 e2++parseArgRef, factor, call :: MyParser Expr++factor = brackets parseExpr <|> number <|> try parseArgRef <|> call++call = (do+ (n, e) <- parseExistingName+ args <- option [] (brackets (parseExpr `sepBy` parseComma))+ case e of+ (Function _ _) -> test n args+ (Builtin _ _) -> test n args+ _ -> fail $ pretty n ++ " is not a function"+ ) <?> "function application"+ where+ test :: Name -> [Expr] -> MyParser Expr+ test n args = do+ state <- getState+ case (runState $ runErrorT (do+ args' <- mapM eval args+ doCall n args')) state of+ (Left e, _) -> fail e+ (Right _, _) -> return (Call n args) -- doCall should not change the state+++parseArgRef = (do+ n' <- parseName+ let n = unName n'+ state <- getState+ case constrArgRef 0 n (getArgs state) of+ Left s -> fail s+ Right e -> return e+ ) <?> "argument reference"++ where+ constrArgRef :: Int -> String -> Args -> Either String Expr+ constrArgRef _ s [] = Left $ "no such argument in definition list: " ++ pretty s+ constrArgRef i s (a:as)+ | getArgName a == s = Right $ ArgRef (Arg s i (getArgType a))+ | otherwise = constrArgRef (i+1) s as+++parseEinh :: MyParser Dims+parseEinh = do+ res <- many1 eh0+ state <- getState+ case (runState $ runErrorT (mergeDims res)) state of+ (Left e, _) -> fail e+ (Right dims, _) -> return dims -- mergeDims is not supposed to change the state++mergeDims :: [(Mon Dims -> Mon Dims)] -> Mon Dims+mergeDims [] = return noDims+mergeDims [a] = a (return noDims)+mergeDims (a:as) = a (mergeDims as)++eh0 :: MyParser (Mon Dims -> Mon Dims)+eh0 = try (do+ op <- option (#*#) (do+ spaces+ char '/'+ return (#/#))+ spaces+ r <- eh1+ return ((flip op) (return r)))+++eh1 :: MyParser Dims+eh1 = try (do spaces; char '('; spaces; r <- parseEinh ; spaces; char ')'; return r;) <|> (do+ n <- eh2+ option (Dims $ Map.singleton n 1) (do+ spaces+ char '^'+ spaces+ i <- fractOrInt+ spaces+ return $ Dims $ Map.singleton n i))++eh2 :: MyParser Name+eh2 = try (do+ (name, entry) <- parseExistingName+ case entry of+ BasicDimension -> return name+ Dimension _ -> return name+ _ -> fail (pretty name ++ " is not a unit")+ ) <?> "unit name"++parseName :: MyParser Name+parseName = do+ r1 <- letter+ r2 <- many (oneOf "_'" <|> digit <|> letter)+ spaces+ return $ Name (r1:r2)+++parseExistingName :: MyParser (Name, StateEntry)+parseExistingName = do+ n <- parseName+ e <- requireEntry n+ return $! (n, e)++int :: MyParser Integer+int = do+ o <- option ' ' $ char '-'+ spaces+ n <- many1 digit+ spaces+ return $ ((read $ o:n)::Integer)++number :: MyParser Expr+number = do+ n <- (try fract) <|> real+ spaces+ return $ Evaled (n, noDims)++++fractOrInt :: MyParser R+fractOrInt = (try fract) <|> intF++intF :: MyParser R+intF = do+ spaces+ r <- int+ spaces+ return (r % 1)++fract :: MyParser R+fract = do+ spaces+ r1 <- many1 digit+ spaces+ char '%'+ spaces+ r2 <- many1 digit+ spaces+ return $ ((read r1)::Integer)%((read r2)::Integer)++real :: MyParser R+real = do+ r1 <- many1 digit+ res <- option (fromInteger ((read r1)::Integer)) (do+ char '.'+ r2 <- many1 digit+ spaces+ let+ rr1 = ((read r1)::Integer)+ rr2 = ((read r2)::Integer) -- FIXME it may be more efficient to textually append length r2 zeros here.+ l = 10^length r2+ return $ (rr1 * l + rr2) % l)++ res' <- option res (try (do+ spaces+ char 'e'+ spaces+ f <- option id (do {char '-'; return negate})+ spaces+ exp_ <- many1 digit+ spaces+ return (res * (10 ^^ f (read exp_ :: Integer)))))++ return res'+ <?> "real"++parseMinus, parseColon, parseBind, parseBindE, parseLB, parseRB, parseComma :: MyParser String+parseMinus = addSpace (string "-")+parseColon = addSpace (string ":")+parseBind = addSpace (string "=")+parseBindE = addSpace (string ":=")+parseLB = addSpace (string "(")+parseRB = addSpace (string ")")+parseComma = addSpace (string ",")++brackets, addSpace :: MyParser a -> MyParser a+brackets p = try (do+ parseLB+ r <- p+ parseRB+ return r)++addSpace a = do+ r <- a+ spaces+ return r
+ src/Language/CalDims/Helpers.hs view
@@ -0,0 +1,80 @@++module Language.CalDims.Helpers + ( F+ , headWithDefault+ , again+ , third+ , unlines'+ , logBaseInt+ , (#&&#)+ , combination+ , permutation+ , if_ -- functional if+ , ErrorAndState+ , eqClassesWith+ ) where++import Control.Monad.Error+import Control.Monad.State++type ErrorAndState e s a = ErrorT e (State s) a+type F = Double+++unlines' :: [String] -> String+unlines' [] = ""+unlines' [a] = a+unlines' (a:as) = a ++ "\n" ++ unlines' as++logBaseInt :: Integral a => a -> a -> Maybe a+logBaseInt a b = if a ^ res == b then Just res else Nothing+ where+ res = round (logBase (fromIntegral a) (fromIntegral b) :: Double)++again :: Monad m => (a -> m b) -> [a] -> m ()+again _ [] = return ()+again f (x:xs) = f x >> again f xs++headWithDefault :: a -> [a] -> a+headWithDefault a [] = a+headWithDefault _ (a:_) = a++(#&&#) :: Monad m => m Bool -> m Bool -> m Bool+(#&&#) = liftM2 (&&)++third :: (a, b, c) -> c+third (_, _, c) = c++--tc :: Eq a => (a -> [a]) -> a -> [a]+--tc f start = start : concatMap (tc f) (filter (/= start) $ f start)++if_ :: Bool -> a -> a -> a+if_ True a _ = a+if_ False _ b = b++eqClassesWith :: (a -> a -> Bool) -> [a] -> [(a,[a])]+eqClassesWith f l = foldl (ff f) [] l++ff :: (a -> a -> Bool) -> [(a, [a])] -> a -> [(a, [a])]+ff _ [] a = [(a, [])]+ff f ((r,rs):on) a = if f r a then ((r,(a:rs)):on) else (r,rs):(ff f on a)++-- combination i l lists all combinations (without repetitions) of set l of order i+-- example:+-- ["abc","abd","acd","bcd"]++combination :: Int -> [a] -> [[a]]+combination i l+ | i > length l = error "i > len l"+ | i == 1 = map (\x -> [x]) l+ | null l = []+ | i == length l = [l]+ | otherwise = let (a:as) = l in+ zipWith (:) (repeat a) (combination (i - 1) as) ++ combination i as+++permutation :: Int -> [a] -> [[a]]+permutation i l+ | i < 1 = error "i > len l"+ | i == 1 = map (\x -> [x]) l+ | otherwise = [ x:y | x <- l, y <- (permutation (i - 1) l)]
+ src/Language/CalDims/Misc.hs view
@@ -0,0 +1,176 @@+module Language.CalDims.Misc (parseLine) where++import Text.ParserCombinators.Parsec+import qualified Data.List as List+import Control.Monad++import Language.CalDims.Expression+import Language.CalDims.Expr ()+import Language.CalDims.Action+import Language.CalDims.Types+++eof' :: MyParser ()+eof' = do+ spaces+ eof++parseConversion :: MyParser Conversion+parseConversion = do+ spaces+ char '|'+ spaces+ c <- try (pr parseEinh Explicit) <|> try (pr parseExpr InTermsOf) <|>+ (char '-' >> return Basic) <|>+ (char '*' >> return Keep) <|>+ (char '?' >> return Minimal)+ spaces+ return c+ where pr f rc = f >>= return . rc++parseFilename :: MyParser String+parseFilename = many1 (oneOf (['a'..'z'] ++ ['A'..'Z'] ++ ['0'..'9'] ++ ['_', '.', '-']))++parseShort :: String -> MyParser String+parseShort s = do+ res <- string $ "\\" ++ s+ (char ' ' >> return ()) <|> eof+ spaces+ return res++parseGetState, parseWriteState, parseDebugName, parseDebugExpr, parseDebugDependencies, parseEval, parseHelp, parseRemove, parseRemoveCascade, parseEcho, parseAddUnit, parseAddBasicUnit, parseAddFunction :: MyParser Command++parseComment, parseEmpty :: MyParser ()++parseGetState = do+ parseShort "s"+ eof'+ return GetState++parseWriteState = do+ parseShort "s"+ name <- parseFilename+ eof'+ return $ WriteState name++parseDebugExpr = do+ try (parseShort "de") <|> parseShort "d"+ e <- parseExpr+ eof'+ return $ DebugExpr e++parseDebugName = do+ parseShort "dn"+ n <- parseName+ eof'+ return $ DebugName n++parseDebugDependencies = do+ parseShort "dp"+ n <- parseName+ eof'+ return $ DebugDependencies n ++parseEval = do+ e <- parseExpr+ conversion <- option Keep parseConversion+ eof'+ return $ Eval e conversion++parseComment = do+ spaces+ char '#'+ flush+ return ()++parseEmpty = do+ spaces+ eof'+ return ()++parseHelp = do+ parseShort "?"+ eof'+ return Help++parseRemove = do+ parseShort "r"+ name <- parseName+ eof'+ return $ Remove name++parseRemoveCascade = do+ parseShort "rc"+ name <- parseName+ eof'+ return $ RemoveCascade name++parseEcho = do+ parseShort "p"+ s <- many1 anyChar+ eof'+ return $ Echo s++parseAddBasicUnit = do+ parseShort "u"+ name <- parseName+ eof'+ return $ AddBasicUnit name++parseAddUnit = do+ fn <- parseName+ parseBindE+ expr <- parseNonRecursiveExpr fn+ return $ AddUnit fn expr++parseAddFunction = do+ oState <- getState+ fn <- parseName+ args' <- option [] (brackets (sepBy (do+ n <- parseName+ e <- option noDims (do+ parseColon+ parseEinh)+ return $ Arg (unName n) 0 e) parseComma))+ let args = zipWith (\ (Arg s _ d) n -> Arg s n d) args' [0..]+ parseBind+ updateState (\x -> x {getArgs = args, getArgValues = map (\ (Arg _ _ d) -> (undefined, d)) args})+ expr <- parseNonRecursiveExpr fn+ when (getArgRefs expr /= (List.nub . List.sort $ args)) (fail "one/some of the parameters are not used in the expression")+ updateState (\_ -> oState)+ return $ AddFunction fn args expr++getArgRefs', getArgRefs :: Expr -> [Arg]++getArgRefs = List.nub . List.sort . getArgRefs'++getArgRefs' (Bin _ e1 e2) = getArgRefs e1 ++ getArgRefs e2+getArgRefs' (Uni _ e) = getArgRefs e+getArgRefs' (ArgRef r) = [r]+getArgRefs' (Call _ es) = foldl (++) [] (map getArgRefs es)+getArgRefs' (Evaled _) = []++parseLine :: MyParser (Maybe Command)+parseLine = do++ let all_ =+ map try + [ parseGetState+ , parseWriteState+ , parseDebugName+ , parseDebugExpr+ , parseDebugDependencies+ , parseHelp+ , parseRemove+ , parseRemoveCascade+ , parseEcho+ , parseAddBasicUnit+ , parseEval+ , parseAddUnit+ , parseAddFunction++ ]+ spaces+ command <- (do parseComment <|> parseEmpty; return Nothing) <|> (do res <- foldl1 (<|>) all_; return $ Just res)+ eof'+ return command
+ src/Language/CalDims/Program.hs view
@@ -0,0 +1,141 @@+module Language.CalDims.Program (getUserState, loop, OutputMode (..), omRun, prompt, defMain) where++import Text.ParserCombinators.Parsec+import qualified Data.List as List+import System.IO+import qualified System.Directory as Dir+import System.Environment as E+import System.Console.Readline+import Control.Monad+import System.Console.GetOpt++import Language.CalDims.Action+import Language.CalDims.State as S+import Language.CalDims.Types+import qualified Language.CalDims.Texts as Texts+import Language.CalDims.Helpers+import Language.CalDims.Misc+import Language.CalDims.Texts++prompt :: String+prompt = "> "++getLine' :: Handle -> IO (Maybe String)+getLine' h = do+ i <- hIsTerminalDevice h+ if i then readline prompt else catch (do {l <- hGetLine h; return $ Just l}) (\_ -> return Nothing)++data OutputMode = OutputMode+ { ppResult :: Bool -- pretty print result+ , ppCommand :: Bool -- pretty print command+ , sResult :: Bool -- show result+ , sCommand :: Bool -- show command+ , echo :: Bool -- echo input+ , pErrors :: Bool -- print errors+ , tolerant :: Bool -- go on after error+ } deriving (Read, Show)++omPrelude, omRun :: OutputMode+omPrelude = OutputMode False False False False False True False+omRun = OutputMode True False False False False True True++loop :: OutputMode -> Handle -> S.State -> IO S.State+loop om h state = do+ line' <- getLine' h+ case line' of+ Nothing -> return state -- EOF+ Just line -> do+ addHistory line+ when (echo om) (putStrLn $ prompt ++ line)+ case runParser parseLine state "" line of+ Left e -> do+ when (pErrors om) (putStrLn . last . lines . show $ e)+ if (tolerant om)+ then loop om h state+ else error (show e)++ -- no error, but no command either (empty line or comment)+ Right Nothing -> loop om h state++ Right (Just command) -> do+ when (sCommand om) (print command)+ when (ppCommand om) (putStrLn $ pretty command)++ case run state command of+ (Left e, _) -> do+ when (pErrors om) (putStrLn e)+ if tolerant om+ then loop om h state+ else error e+ (Right res, newState) -> do+ when (sResult om) (print res)+ when (ppResult om) (putStrLn $ pretty res)+ loop om h newState+++++getUserState :: Maybe String -> IO S.State+getUserState mfn = do++ sdir <- Dir.getCurrentDirectory++ filename <- case mfn of+ Nothing -> (do+ let+ file = "prelude.cal"++ dir <- Dir.getAppUserDataDirectory "CalDims"+ Dir.createDirectoryIfMissing True dir+ Dir.setCurrentDirectory dir+ exists <- Dir.doesFileExist file++ unless exists (do+ handle <- openFile file WriteMode+ hPutStr handle Texts.preludeText+ hClose handle)+ return file)+ Just fns -> return fns++ handle <- openFile filename ReadMode+ Dir.setCurrentDirectory sdir+ loop omPrelude handle start++data CliArg = DoEcho | Blank | DisplayHelp deriving Eq++exit :: [String] -> IO a+exit s = error (unlines s)++defMain :: IO()+defMain = do+ interactive <- hIsTerminalDevice stdin+ when interactive (do+ putStrLn Texts.welcomeText + hFlush stdout)++ args <- E.getArgs+ + let + descr = + [ Option "e" ["echo"] (NoArg DoEcho) "echo input line"+ , Option "b" ["blank"] (NoArg Blank) "load no configuration file"+ , Option "h" ["help"] (NoArg DisplayHelp) "display help" ]+ (opts, fns, errs) = getOpt RequireOrder descr args++ when (not $ null errs) (exit (errs ++ [usageInfo "caldims [OPTIONS] FILE" descr]))++ let omRun_ = if_+ (DoEcho `elem` opts)+ (omRun {echo = True})+ omRun++ if DisplayHelp `elem` opts then print helpText else (do++ s <- case (Blank `elem` opts, fns) of+ (False, []) -> getUserState Nothing+ (False, [filename]) -> getUserState (Just filename)+ (True, []) -> return start+ (_, (_:_:_)) -> exit ["too many FILE arguments"]+ (True, (_:_)) -> exit ["blank start requested, but filename given."]+ loop omRun_ stdin s+ return ())
+ src/Language/CalDims/State.hs view
@@ -0,0 +1,81 @@+{-# OPTIONS -fglasgow-exts #-}++module Language.CalDims.State + ( MyParser+ , Arg (..)+ , Args+ , Scope+ , State (..)+ , StateEntry (..)+ , isBasicUnit+ , isUnit+ , isDerivedUnit+ , isFunction+ , isBuiltin+ , lu+ , start) where++import qualified Data.Map as Map+import qualified Data.List as List+import Data.Maybe++import Language.CalDims.Types+import Language.CalDims.Expr ()+++start :: State+start = State + { getScope = Map.fromList [ (Name "pi", Builtin [] $ Evaled (toRational ((pi)::Double), noDims))+ , (Name "e", Builtin [] $ Evaled (toRational ((exp 1):: Double), noDims))+ , (Name "exp", bUni Expot noDims)+ , (Name "log", bUni Log noDims)+ , (Name "cos", bUni Cos noDims)+ , (Name "tan", bUni Tan noDims)+ , (Name "asin", bUni Asin noDims)+ , (Name "acos", bUni Acos noDims)+ , (Name "atan", bUni Atan noDims)+ , (Name "sinh", bUni Sinh noDims)+ , (Name "cosh", bUni Cosh noDims)+ , (Name "tanh", bUni Tanh noDims)+ , (Name "asinh", bUni Asinh noDims)+ , (Name "acosh", bUni Acosh noDims)+ , (Name "atanh", bUni Atanh noDims)+ , (Name "sin", bUni Sin noDims)]+ , getArgs = []+ , getArgValues = []}++bUni :: UniOp -> Dims -> StateEntry+bUni o d = let arg = Arg "x" 0 d in Builtin [arg] $ Uni o (ArgRef arg)++instance Pretty (Name, StateEntry) where+ pretty (name, Function args expr) = pretty name ++ prettyArgs args ++ " = " ++ pretty expr+ pretty (name, Builtin args _) = pretty name ++ prettyArgs args ++ " = [[builtin]]"+ pretty (name, Dimension expr) = pretty name ++ " := " ++ pretty expr+ pretty (name, BasicDimension) = "\\u " ++ pretty name++prettyArgs :: Args -> String+prettyArgs [] = ""+prettyArgs args = " (" ++ foldl1 (\a b -> a ++ ", " ++ b) (map (\ (Arg n _ d) -> n ++ " : " ++ pretty d) args) ++ ")"++isBasicUnit, isUnit, isDerivedUnit, isFunction, isBuiltin :: State -> Name -> Bool+isBasicUnit state name+ | Just BasicDimension <- lu name state = True+ | otherwise = False++isFunction state name+ | Just (Function _ _) <- lu name state = True+ | otherwise = False++isBuiltin state name+ | Just (Builtin _ _) <- lu name state = True+ | otherwise = False++isDerivedUnit state name+ | Just (Dimension _) <- lu name state = True+ | otherwise = False++isUnit state name = isDerivedUnit state name || isBasicUnit state name++lu :: Name -> State -> Maybe StateEntry+lu name state = Map.lookup name (getScope state)+
+ src/Language/CalDims/Texts.hs view
@@ -0,0 +1,204 @@+module Language.CalDims.Texts where++import qualified Data.Version as Version++-- Types++data HelpTree = Section String [HelpTree] | Para String++-- Classes++-- Instances++instance Show HelpTree where+ show = unlines . show' 0+ where++ show' :: Int -> HelpTree -> [String]+ show' level ht = case ht of + (Section s list) -> headline s ++ (concatMap (show' (level + 1)) list)+ (Para s) -> [indent s]++ where+ indent :: String -> String+ indent = ((concat $ take level $ repeat " ") ++)+ + headline :: String -> [String]+ headline s = indent "" : if level >= length typoChars + then [indent s ++":"]+ else [indent s, indent (take (length s) (repeat (typoChars!!level)))]++ typoChars = "*-'"+ +-- Functions++version :: Version.Version+version = Version.Version [0,1,0] []++name :: String+name = "CalDims"++preludeText, welcomeText :: String+preludeText = unlines+ [ "# Time Units"+ , "\\u s"+ , "min := 60 s"+ , "h := 60 min"+ , "d := 24 h"+ , "Hz := 1s^-1"+ , ""+ , "# Space Units"+ , "\\u m"+ , "l := (0.1 m)^3"+ , ""+ , "# Mass Units"+ , "\\u kg"+ , "t := 1000 kg"+ , "u := 1.6605402 * 10^-27 kg"+ , ""+ , "# Molar mass"+ , "\\u mol"+ , ""+ , "# Force"+ , "N := 1m kg/s^2"+ , ""+ , "# Energy"+ , "J := 1 N m"+ , ""+ , "# Power"+ , "W := 1 J/s"+ , ""+ , "# Electro physics"+ , "\\u A"+ , "C := 1 A s"+ , "V := 1 W/A"+ , "F := 1 A s/V"+ , "Ohm := 1 V/A"+ , "H := 1 V s/A"+ , ""+ , "# Light"+ , "\\u cd"+ , ""+ , "# Temperature"+ , "\\u K"+ , ""+ , "# Constants"]++welcomeText = name ++ " " ++ Version.showVersion version ++ "\n" ++ "License: GPL 3 (see the LICENSE file)\n\n" + ++ "Type in `\\?' to read the inline help.\n"++helpText :: HelpTree+helpText = Section (name ++ " help")+ [ Section "Usage of the shell" + [ Para "The shell is an infinite loop that accepts one line of user-input and processes it."+ , Para "The input line syntax is: expr|command|fundef|unitdef|comment"+ , Section "Expression to evaluate (expr)" + [ Para "The syntax of an evaluation request is: expr ('|'(unit|expr|-|*|?))."+ , Para "For detailed expression syntax see chapter `Expression syntax'."+ , Section "Examples"+ [ Para "(10000 m^2)^1%2 -> 100 m (square root of 10000 m^2)"+ , Para "7 d | h -> 168 h (7 days are 168 hours)"+ , Para "80W * 30d * 0.20EUR/kW/h | EUR -> 11.52 EUR"+ , Para "sin (pi/4) * 10 V -> 7.071067811865475 V"]++ , Section "Evaluation modifiers"+ [ Para "expr | unit -> converts expr to unit after evaluation"+ , Para "expr1 | expr2 -> rewrite expr in terms of expr2"+ , Para "expr | ? -> try to find the minimal unit for expr"+ , Para "expr | * -> simply keep the unit that was evaluated"+ , Para "expr | - -> rewrite the evaluation in terms of basic units"+ , Para []+ , Para "Modifiers are optional, 'expr | *' and 'expr' are equivalent."]+ + ]+ , Section "Shell command (command)"+ [ Para "\\? - display this help"+ , Para "\\d expr - show unevaluated expression"+ , Para "\\de expr - just like `\\d expr'"+ , Para "\\dn name - show unit or function"+ , Para "\\dp name - show the dependencies and the reverse dependecies of a unit or function"+ , Para "\\p string - print <string> to stdout."+ , Para "\\r name - remove a function or unit."+ , Para "\\rc name - remove cascade - remove all entities that depend on <name> and <name> itself."+ , Para "\\s - print the state"+ , Para "\\u name - add a basic unit"]++ , Section "Function definition (fundef)"+ [ Para "A function definition has the following syntax: name (name1:unit1, name2:unit2, ...) = expr"++ , Section "Examples"+ [ Para "t = 3 min"+ , Para "volumen (radius:m) = pi * radius^3"+ , Para "speed (distance:m, time:s) = distance / time"]+ , Para ""+ , Para "Units that have to follow a parameter and colon indicate the dimension of the parameter only,"+ , Para "so 'duration(t1:min, t2:min)=t2-t1' and 'duration(t1:h, t2:d)=t2-t1' are totally equivalent."]+++ , Section "Unit definition (unitdef)"+ [ Para "A unit definition has the following syntax: name:=expr"+ , Section "Examples"+ [ Para "mile := 1609.344 m"+ , Para "min := 60 s"+ , Para "h := 60 min"+ , Para "mph := 1 mile/h"]+ ]++ , Section "Comment line (comment)"+ [ Para "You can add comment lines to your source files or comment out a line inside the shell."+ , Para "A comment line has the following syntax: # string"+ , Section "Example" [Para "# This is a comment"]+ ]+ ]++ , Section "Command invocation"+ [ Para "caldims [OPTION] <FILE>"+ , Para "caldims - start the shell and load the user's `prelude.cal'"+ , Para "caldims <file> - start the shell and load <file> instead of `prelude.cal'"+ , Para "caldims --blank - start the shell without loading a file"+ , Para "caldims --echo - echo every input line"+ , Para "caldims --help - display this help text"]++ , Section "Expression syntax (expr)"+ [ Para "Currently only arithmetic expressions are supported."+ , Section "Examples"+ [ Para "1+2 -> 3"+ , Para "1m + 2m -> 3 m"+ , Para "1m * 2m -> 2 m^2"]+ + , Section "Builtin functions. All of these are dimensionless."+ [ Para "pi -> pi"+ , Para "e -> Euler number"+ , Para "logBase (a, b) -> logarithm of a with base b"+ , Para "log (a) -> logarithm of a with base e"+ , Para "exp (a) -> expotential function (e^a)"+ , Para ""+ , Para "sin, cos, tan, asin, acos, atan, sinh, cosh, tanh, asinh, acosh, atanh"]++ , Section "Syntax productions"+ [ Section "An expression (expr) may be of one of the following forms"+ [ Para "- expr"+ , Para "expr + expr"+ , Para "expr - expr"+ , Para "expr * expr"+ , Para "expr / expr"+ , Para "expr ^ integer>"+ , Para "(expr)"+ , Para "number unit"+ , Para "functionname"+ , Para "functionname (arg1, arg2, ... )"]+ , Section "A number can be"+ [ Para "real"+ , Para "integer%integer"]++ , Section "A unit is one of"+ [ Para "unit / unit"+ , Para "unit unit"+ , Para "(unit)"+ , Para "unitname"+ , Para "unitname ^ integer"]]]+ + , Section "The `prelude.cal' file"+ [ Para ("When a user starts " ++ name ++ " and `prelude.cal' cannot be found in the")+ , Para "`data directory, then a standard prelude is created. It contains definitions of"+ , Para "the SI base units and some derived units. You can replace or modify this file."]]
+ src/Language/CalDims/Types.hs view
@@ -0,0 +1,167 @@+{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances #-}++module Language.CalDims.Types + ( Name (..)+ , MyParser+ , Scope+ , State (..)+ , StateEntry (..)+ , D+ , R+ , Conversion (..)+ , Expr (..)+ , BinOp (..)+ , UniOp (..)+ , Priority (..)+ , Args+ , Arg (..)+ , Pretty (..)+ , Dims (..)+ , noDims+ , EqM (..)+ , AddM (..)+ , SubM (..)+ , MulM (..)+ , DivM (..)+ , ExpM (..)+ , LogBaseM (..)+ , NegateM (..)+ , ExpotM (..)+ , LogM (..)+ , SqrtM (..)+ , SinM (..)+ , CosM (..)+ , TanM (..)+ , AsinM (..)+ , AcosM (..)+ , AtanM (..)+ , SinhM (..)+ , CoshM (..)+ , TanhM (..)+ , AsinhM (..)+ , AcoshM (..)+ , AtanhM (..)) where+++import Text.ParserCombinators.Parsec (GenParser)+import qualified Data.Map as Map+import Data.Ratio+--import Data.Generics+import Control.Monad.Error+import qualified Data.List as List+class Pretty a where+ pretty :: a -> String++instance Pretty Int where pretty i = show i+instance Pretty a => Pretty [a] where+ pretty [] = "[]"+ pretty (a:l) = "[" ++ foldl (\x y -> x ++ ", " ++ y) (pretty a) (map pretty l) ++ "]"++instance Pretty Char where pretty c = [c]+++instance Pretty Dims where+ pretty (Dims a)+ | null list = ""+ | otherwise = tail (pretty' list)+ where+ list = filter (\ (_, y) -> y /= 0) $ List.sort $ Map.toList a++ pretty' :: [(Name, R)] -> String+ pretty' [] = ""+ pretty' (el@(_, exp_):fs) = if exp_ > 0+ then ePretty el ++ pretty' fs+ else pretty' fs ++ " /" ++ ePretty el++ ePretty :: (Name, R) -> String+ ePretty (name, e) = let n = pretty name in+ " " ++ if abs e == 1 then n else n ++ "^" ++ (pretty $ abs e)++++data Conversion = Explicit Dims | InTermsOf Expr | Basic | Keep | Minimal deriving Show++type D = Double+type R = Ratio Integer++newtype Name = Name {unName :: String} deriving (Eq, Show, Ord)+instance Pretty Name where pretty (Name s) = s++instance Pretty (Ratio Integer) where+ pretty r = if d == 1 then (show n) else show . floating $ r where+ d = denominator r+ n = numerator r++floating :: R -> D+floating r = fromInteger (numerator r) / fromInteger (denominator r)+++type MyParser = GenParser Char State++type Scope = Map.Map Name StateEntry++data State = State+ { getScope :: Scope+ , getArgs :: Args+ , getArgValues :: [(R, Dims)]+ } deriving (Show)++data StateEntry = Function Args Expr | Dimension Expr | BasicDimension | Builtin Args Expr+ deriving (Show)+++data Expr = Bin BinOp Expr Expr | Uni UniOp Expr | ArgRef Arg+ | Call Name [Expr] | Evaled (R, Dims) deriving (Show)++data BinOp = Add | Sub | Mul | Div | Exp | LogBase+ deriving (Eq, Show)++data UniOp = Negate | Expot | Log | Sin | Cos | Tan | Asin | Acos | Atan+ | Sinh | Cosh | Tanh | Asinh | Acosh | Atanh+ deriving (Eq, Show)++data Priority = P_Add | P_Mul | P_Exp | P_Negate | P_Elementary+ deriving (Eq, Enum, Ord)++type Args = [Arg]++data Arg = Arg+ { getArgName :: String -- This is not a Name because it does not reference a State-Entry.+ , getArgNumber :: Int+ , getArgType :: Dims+ } deriving (Show, Ord, Eq)++newtype Dims = Dims {unDims :: Map.Map Name R} deriving (Show, Ord, Eq)++noDims :: Dims+noDims = Dims Map.empty+++class (Monad m) => EqM a m where (#==#) :: m a -> m a -> m Bool++class (Monad m) => AddM a m where (#+#) :: m a -> m a -> m a+class (Monad m) => SubM a m where (#-#) :: m a -> m a -> m a+class (Monad m) => MulM a m where (#*#) :: m a -> m a -> m a+class (Monad m) => DivM a m where (#/#) :: m a -> m a -> m a+class (Monad m) => ExpM a m where (#^#) :: m a -> m a -> m a+class (Monad m) => LogBaseM a m where (#~#) :: m a -> m a -> m a++class (Monad m) => NegateM a m where negateM :: m a -> m a+class (Monad m) => ExpotM a m where expM :: m a -> m a+class (Monad m) => LogM a m where logM :: m a -> m a+class (Monad m) => SqrtM a m where sqrtM :: m a -> m a+class (Monad m) => SinM a m where sinM :: m a -> m a+class (Monad m) => CosM a m where cosM :: m a -> m a+class (Monad m) => TanM a m where tanM :: m a -> m a+class (Monad m) => AsinM a m where asinM :: m a -> m a+class (Monad m) => AcosM a m where acosM :: m a -> m a+class (Monad m) => AtanM a m where atanM :: m a -> m a+class (Monad m) => SinhM a m where sinhM :: m a -> m a+class (Monad m) => CoshM a m where coshM :: m a -> m a+class (Monad m) => TanhM a m where tanhM :: m a -> m a+class (Monad m) => AsinhM a m where asinhM :: m a -> m a+class (Monad m) => AcoshM a m where acoshM :: m a -> m a+class (Monad m) => AtanhM a m where atanhM :: m a -> m a+++
+ tool/Main.hs view
@@ -0,0 +1,6 @@+module Main (main) where++import Language.CalDims.Program++main :: IO()+main = defMain