From 5874d0df93d2e2ac0ab9182041e18056e4708671 Mon Sep 17 00:00:00 2001 From: Julien Moutinho Date: Mon, 19 Sep 2016 22:02:44 +0200 Subject: [PATCH 1/1] init --- .gitignore | 8 + COPYING | 674 +++++++++++++++++++++++++++++++++++++ HLint.hs | 5 + TFHOE.cabal | 130 +++++++ TFHOE.hs | 11 + TFHOE/Expr.hs | 14 + TFHOE/Expr/Bool.hs | 111 ++++++ TFHOE/Expr/Bool/HLint.hs | 1 + TFHOE/Expr/Bool/Test.hs | 165 +++++++++ TFHOE/Expr/Common.hs | 53 +++ TFHOE/Expr/Fun.hs | 150 +++++++++ TFHOE/Expr/Fun/HLint.hs | 1 + TFHOE/Expr/Fun/Test.hs | 28 ++ TFHOE/Expr/HLint.hs | 1 + TFHOE/Expr/Int.hs | 79 +++++ TFHOE/Expr/Test.hs | 13 + TFHOE/HLint.hs | 1 + TFHOE/Lib/Control/HLint.hs | 1 + TFHOE/Lib/Control/Monad.hs | 40 +++ TFHOE/Lib/HLint.hs | 1 + TFHOE/Raw.hs | 14 + TFHOE/Raw/HLint.hs | 1 + TFHOE/Raw/Test.hs | 15 + TFHOE/Repr.hs | 9 + TFHOE/Repr/Dup.hs | 11 + TFHOE/Repr/HLint.hs | 1 + TFHOE/Repr/Host.hs | 55 +++ TFHOE/Repr/Host/HLint.hs | 1 + TFHOE/Repr/Host/Test.hs | 63 ++++ TFHOE/Repr/String.hs | 152 +++++++++ TFHOE/Repr/String/HLint.hs | 1 + TFHOE/Repr/String/Test.hs | 43 +++ TFHOE/Repr/Test.hs | 12 + TFHOE/Test.hs | 25 ++ TFHOE/Type.hs | 11 + TFHOE/Type/Bool.hs | 50 +++ TFHOE/Type/Common.hs | 91 +++++ TFHOE/Type/Fun.hs | 63 ++++ TFHOE/Type/HLint.hs | 1 + TFHOE/Type/Int.hs | 51 +++ TFHOE/Type/Test.hs | 28 ++ test.sh | 2 + 42 files changed, 2187 insertions(+) create mode 100644 .gitignore create mode 100644 COPYING create mode 100644 HLint.hs create mode 100644 TFHOE.cabal create mode 100644 TFHOE.hs create mode 100644 TFHOE/Expr.hs create mode 100644 TFHOE/Expr/Bool.hs create mode 120000 TFHOE/Expr/Bool/HLint.hs create mode 100644 TFHOE/Expr/Bool/Test.hs create mode 100644 TFHOE/Expr/Common.hs create mode 100644 TFHOE/Expr/Fun.hs create mode 120000 TFHOE/Expr/Fun/HLint.hs create mode 100644 TFHOE/Expr/Fun/Test.hs create mode 120000 TFHOE/Expr/HLint.hs create mode 100644 TFHOE/Expr/Int.hs create mode 100644 TFHOE/Expr/Test.hs create mode 120000 TFHOE/HLint.hs create mode 120000 TFHOE/Lib/Control/HLint.hs create mode 100644 TFHOE/Lib/Control/Monad.hs create mode 120000 TFHOE/Lib/HLint.hs create mode 100644 TFHOE/Raw.hs create mode 120000 TFHOE/Raw/HLint.hs create mode 100644 TFHOE/Raw/Test.hs create mode 100644 TFHOE/Repr.hs create mode 100644 TFHOE/Repr/Dup.hs create mode 120000 TFHOE/Repr/HLint.hs create mode 100644 TFHOE/Repr/Host.hs create mode 120000 TFHOE/Repr/Host/HLint.hs create mode 100644 TFHOE/Repr/Host/Test.hs create mode 100644 TFHOE/Repr/String.hs create mode 120000 TFHOE/Repr/String/HLint.hs create mode 100644 TFHOE/Repr/String/Test.hs create mode 100644 TFHOE/Repr/Test.hs create mode 100644 TFHOE/Test.hs create mode 100644 TFHOE/Type.hs create mode 100644 TFHOE/Type/Bool.hs create mode 100644 TFHOE/Type/Common.hs create mode 100644 TFHOE/Type/Fun.hs create mode 120000 TFHOE/Type/HLint.hs create mode 100644 TFHOE/Type/Int.hs create mode 100644 TFHOE/Type/Test.hs create mode 100755 test.sh diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..ff263ae --- /dev/null +++ b/.gitignore @@ -0,0 +1,8 @@ +*.hi +*.o +.cabal-sandbox/ +.stack-work/ +cabal.sandbox.config +dist/ +report.html +old/ diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/COPYING @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + 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. + + + Copyright (C) + + 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 . + +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: + + Copyright (C) + 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 +. + + 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 +. diff --git a/HLint.hs b/HLint.hs new file mode 100644 index 0000000..af62887 --- /dev/null +++ b/HLint.hs @@ -0,0 +1,5 @@ +import "hint" HLint.HLint +ignore "Redundant $" +ignore "Redundant bracket" +ignore "Use camelCase" +ignore "Use import/export shortcut" diff --git a/TFHOE.cabal b/TFHOE.cabal new file mode 100644 index 0000000..fed252f --- /dev/null +++ b/TFHOE.cabal @@ -0,0 +1,130 @@ +author: Julien Moutinho +-- bug-reports: http://doc.autogeree.net/tfhoe/bugs +build-type: Simple +cabal-version: >= 1.10 +category: Language +-- data-dir: data +-- data-files: +description: + Demonstration gathering important ideas from + + and trying to push them further + to get a nice approach to EDSL + (Embedded Domain-Specific Language). + . + Main improvements are related to: + * Reading symantics expressions + from a raw AST (Abstract Syntax Tree); + including lambda abstractions. + * Keeping this reading extensible + to new symantics expressions; + reusing previous readers without changing them. + * Using those read symantics expressions + with multiple interpreters. + . + Your comments, problem reports, questions are very welcome! +extra-source-files: +extra-tmp-files: +-- homepage: http://pad.autogeree.net/informatique/tfhoe/ +license: GPL-3 +license-file: COPYING +maintainer: Julien Moutinho +name: tfhoe +stability: experimental +synopsis: Tutorial and experiments regarding Tagless-Final Higher-Order Extensible EDSL +tested-with: GHC==7.10.3 +version: 1.20160916 + +-- Source-Repository head +-- location: git://git.autogeree.net/tfhoe +-- type: git + +Flag dev + Default: False + Description: Turn on development settings. + Manual: True + +Flag dump + Default: False + Description: Dump some intermediate files. + Manual: True + +Flag prof + Default: False + Description: Turn on profiling settings. + Manual: True + +Flag threaded + Default: False + Description: Enable threads. + Manual: True + +Library + default-extensions: + ghc-options: -Wall -fno-warn-tabs + if flag(dev) + cpp-options: -DDEVELOPMENT + ghc-options: + -- -ddump-splices + -- -fno-warn-unused-do-bind -fno-warn-name-shadowing -fno-warn-missing-signatures + -- -fno-warn-type-defaults -fno-warn-orphans + if flag(dump) + ghc-options: -ddump-simpl -ddump-stg -ddump-to-file + if flag(prof) + cpp-options: -DPROFILING + ghc-options: -fprof-auto + default-language: Haskell2010 + exposed-modules: + TFHOE.Lib.Control.Monad + TFHOE.Expr + TFHOE.Expr.Bool + TFHOE.Expr.Common + TFHOE.Expr.Fun + TFHOE.Expr.Int + TFHOE.Raw + TFHOE.Repr + TFHOE.Repr.Dup + TFHOE.Repr.Host + TFHOE.Repr.String + TFHOE.Type + TFHOE.Type.Bool + TFHOE.Type.Common + TFHOE.Type.Fun + TFHOE.Type.Int + build-depends: + base >= 4.6 && < 5 + , ghc-prim + , monad-classes >= 0.3.1.1 + , transformers + +Test-Suite tfhoe-test + type: exitcode-stdio-1.0 + default-extensions: + default-language: Haskell2010 + ghc-options: -Wall -fno-warn-tabs + -main-is Test + hs-source-dirs: TFHOE + main-is: Test.hs + other-modules: + Expr.Bool.Test + Expr.Fun.Test + Expr.Test + Raw.Test + Repr.Host.Test + Repr.String.Test + Repr.Test + Type.Test + if flag(threaded) + ghc-options: -threaded -rtsopts -with-rtsopts=-N + if flag(dev) + cpp-options: -DDEVELOPMENT + ghc-options: + if flag(prof) + cpp-options: -DPROFILING + ghc-options: -fprof-auto + build-depends: + base >= 4.6 && < 5 + , transformers + , tasty >= 0.11 + , tasty-hunit + , tfhoe diff --git a/TFHOE.hs b/TFHOE.hs new file mode 100644 index 0000000..1ba26be --- /dev/null +++ b/TFHOE.hs @@ -0,0 +1,11 @@ +module TFHOE + ( module TFHOE.Raw + , module TFHOE.Type + , module TFHOE.Expr + , module TFHOE.Repr + ) where + +import TFHOE.Raw +import TFHOE.Type +import TFHOE.Expr +import TFHOE.Repr diff --git a/TFHOE/Expr.hs b/TFHOE/Expr.hs new file mode 100644 index 0000000..90a7498 --- /dev/null +++ b/TFHOE/Expr.hs @@ -0,0 +1,14 @@ +{-# LANGUAGE MultiParamTypeClasses #-} +module TFHOE.Expr + ( module TFHOE.Expr.Common + , module TFHOE.Expr.Fun + , module TFHOE.Expr.Int + , module TFHOE.Expr.Bool + -- , module TFHOE.Expr.If + ) where + +import TFHOE.Expr.Common +import TFHOE.Expr.Fun +import TFHOE.Expr.Int +import TFHOE.Expr.Bool +-- import TFHOE.Expr.If diff --git a/TFHOE/Expr/Bool.hs b/TFHOE/Expr/Bool.hs new file mode 100644 index 0000000..d90001c --- /dev/null +++ b/TFHOE/Expr/Bool.hs @@ -0,0 +1,111 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE Rank2Types #-} +{-# LANGUAGE ScopedTypeVariables #-} +-- {-# LANGUAGE ViewPatterns #-} +{-# LANGUAGE TypeFamilies #-} +{-# OPTIONS_GHC -fno-warn-orphans #-} +module TFHOE.Expr.Bool where + +import Data.Proxy (Proxy(..)) +import Prelude hiding (and, or) + +import TFHOE.Raw +import TFHOE.Type +import TFHOE.Expr.Common +import TFHOE.Expr.Fun () +import TFHOE.Repr.Dup + +-- * Class 'Expr_Bool' + +-- | Symantics combinable with 'Type_Bool'. +class Expr_Bool repr where + bool :: Bool -> repr Bool + neg :: repr Bool -> repr Bool + and :: repr Bool -> repr Bool -> repr Bool + or :: repr Bool -> repr Bool -> repr Bool + xor :: repr Bool -> repr Bool -> repr Bool + xor x y = (x `or` y) `and` neg (x `and` y) + +type instance Expr_from_Type (Type_Bool next) repr + = ( Expr_Bool repr + , Expr_from_Type next repr ) + +instance -- Expr_Bool Dup + ( Expr_Bool r1 + , Expr_Bool r2 + ) => Expr_Bool (Dup r1 r2) where + bool x = bool x `Dup` bool x + neg (x1 `Dup` x2) = neg x1 `Dup` neg x2 + and (x1 `Dup` x2) (y1 `Dup` y2) = and x1 y1 `Dup` and x2 y2 + or (x1 `Dup` x2) (y1 `Dup` y2) = or x1 y1 `Dup` or x2 y2 + xor (x1 `Dup` x2) (y1 `Dup` y2) = xor x1 y1 `Dup` xor x2 y2 +instance -- Expr_from Raw Type_Bool Type_Fun_Bool + ( Type_from Raw next + , Expr_from Raw next (Type_Fun_Bool fun next) + ) => Expr_from Raw (Type_Bool next) (Type_Fun_Bool fun next) where + expr_from _px_ty _px_ty_end _ctx (Raw "bool" [Raw raw_bool []]) k = do + (i::Bool) <- read_safe raw_bool + k (Type_Fun_Next Type_Bool) $ Forall_Repr_with_Context $ + const $ bool i + expr_from _px_ty px_ty_end ctx (Raw "neg" [raw_x]) k = + expr_from px_ty_end px_ty_end ctx raw_x $ \ty_x (Forall_Repr_with_Context x) -> + case ty_x of + Type_Fun_Next Type_Bool -> + k ty_x $ Forall_Repr_with_Context $ + neg . x + _ -> Left "Error: neg: the operand is not a Bool" + expr_from _px_ty px_ty_end ctx (Raw op_name@"and" [raw_x, raw_y]) k = + expr_from px_ty_end px_ty_end ctx raw_x $ \ty_x (Forall_Repr_with_Context x) -> + expr_from px_ty_end px_ty_end ctx raw_y $ \ty_y (Forall_Repr_with_Context y) -> + case (ty_x, ty_y) of + ( Type_Fun_Next Type_Bool + , Type_Fun_Next Type_Bool ) -> + k ty_x $ Forall_Repr_with_Context $ + \c -> x c `and` y c + _ -> Left $ "Error: "++op_name++": at least one operand is not a Bool" + expr_from _px_ty px_ty_end ctx (Raw op_name@"or" [raw_x, raw_y]) k = + expr_from px_ty_end px_ty_end ctx raw_x $ \ty_x (Forall_Repr_with_Context x) -> + expr_from px_ty_end px_ty_end ctx raw_y $ \ty_y (Forall_Repr_with_Context y) -> + case (ty_x, ty_y) of + ( Type_Fun_Next Type_Bool + , Type_Fun_Next Type_Bool ) -> + k ty_x $ Forall_Repr_with_Context $ + \c -> x c `or` y c + _ -> Left $ "Error: "++op_name++": at least one operand is not a Bool" + expr_from _px_ty px_ty_end ctx (Raw op_name@"xor" [raw_x, raw_y]) k = + expr_from px_ty_end px_ty_end ctx raw_x $ \ty_x (Forall_Repr_with_Context x) -> + expr_from px_ty_end px_ty_end ctx raw_y $ \ty_y (Forall_Repr_with_Context y) -> + case (ty_x, ty_y) of + ( Type_Fun_Next Type_Bool + , Type_Fun_Next Type_Bool ) -> + k ty_x $ Forall_Repr_with_Context $ + \c -> x c `xor` y c + _ -> Left $ "Error: "++op_name++": at least one operand is not a Bool" + expr_from _px_ty px_ty_end ctx raw k = + expr_from (Proxy::Proxy next) px_ty_end ctx raw k +instance Expr_from Raw Type_End (Type_Fun_Bool fun Type_End) where + expr_from _px_ty _px_ty_end _ctx raw _k = + Left $ "Error: invalid Type_Fun_Bool: " ++ show raw + +expr_fun_bool_from + :: forall fun raw next. + ( Expr_from raw (Type_Fun_Bool fun next) + (Type_Fun_Bool fun next) + ) + => Proxy fun + -> Proxy next + -> raw + -> Either Error_Type + (Exists_Type_and_Repr + (Type_Fun_Bool fun next) + (Forall_Repr (Type_Fun_Bool fun next))) +expr_fun_bool_from _px_call _px_next raw = + expr_from + (Proxy::Proxy (Type_Fun_Bool fun next)) + (Proxy::Proxy (Type_Fun_Bool fun next)) + Context_Empty raw $ \ty (Forall_Repr_with_Context repr) -> + Right $ Exists_Type_and_Repr ty $ + Forall_Repr $ repr Context_Empty diff --git a/TFHOE/Expr/Bool/HLint.hs b/TFHOE/Expr/Bool/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Expr/Bool/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Expr/Bool/Test.hs b/TFHOE/Expr/Bool/Test.hs new file mode 100644 index 0000000..2d91ead --- /dev/null +++ b/TFHOE/Expr/Bool/Test.hs @@ -0,0 +1,165 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE NoMonomorphismRestriction #-} +{-# LANGUAGE Rank2Types #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# OPTIONS_GHC -fno-warn-missing-signatures #-} +module Expr.Bool.Test where + +import Test.Tasty +import Test.Tasty.HUnit + +-- import Data.Functor.Identity (Identity) +-- import Control.Monad.IO.Class (MonadIO(..)) +import Data.Proxy (Proxy(..)) +import Data.Type.Equality ((:~:)(Refl)) +import Prelude hiding (and, or) + +import TFHOE.Repr +import TFHOE.Raw +import TFHOE.Expr +import TFHOE.Type +-- import TFHOE.Expr.Trans + +-- * Class 'Expr_Bool_Vars' + +-- | A few boolean variables. +class Expr_Bool_Vars repr where + x :: repr Bool + y :: repr Bool + z :: repr Bool +instance Expr_Bool_Vars (Repr_String fun) where + x = Repr_String $ \_p _v -> "x" + y = Repr_String $ \_p _v -> "y" + z = Repr_String $ \_p _v -> "z" +{- +instance -- Trans_Boo_Const + ( Expr_Bool_Vars repr + , Expr_Lit repr + ) => Expr_Bool_Vars (Trans_Bool_Const repr) where + x = trans_lift x + y = trans_lift y + z = trans_lift z +-} + +-- * 'Expr's +e1 = bool True `and` bool False +e2 = (bool True `and` bool False) `or` (bool True `and` bool True) +e3 = (bool True `or` bool False) `and` (bool True `or` bool True) +e4 = bool True `and` neg (bool False) +e5 = bool True `and` neg x +e6 = x `xor` y +e7 = (x `xor` y) `xor` z +e8 = x `xor` (y `xor` bool True) + +(==>) raw expected@(ty_expected::Type_Fun_Bool_Int IO Type_End h, _::h, _::String) = + testCase (show raw) $ + (>>= (@?= Right expected)) $ + case expr_fun_bool_int_from Proxy Proxy raw of + Left err -> return $ Left err + Right (Exists_Type_and_Repr ty (Forall_Repr r)) -> + case ty `type_eq` ty_expected of + Nothing -> return $ Left "Type mismatch" + Just Refl -> do + h <- host_repr r + return $ + Right + ( ty + , h + , string_repr r + -- , (string_repr :: Repr_String IO h -> String) r + ) + +tests :: TestTree +tests = testGroup "Bool" $ + [ Raw "bool" [Raw "True" []] ==> + ( Type_Fun_Next Type_Bool + , True + , "True" ) + , Raw "xor" + [ Raw "bool" [Raw "True" []] + , Raw "bool" [Raw "True" []] + ] ==> + ( Type_Fun_Next Type_Bool + , False + , "(True | True) & !(True & True)" ) + , Raw "app" + [ Raw "val" + [ Raw "x" [] + , Raw "Bool" [] + , Raw "var" [Raw "x" []] + ] + , Raw "bool" [Raw "True" []] + ] ==> + ( Type_Fun_Next Type_Bool + , True + , "(\\x0 -> x0) True" ) + , Raw "app" + [ Raw "val" + [ Raw "x" [] + , Raw "Bool" [] + , Raw "xor" + [ Raw "var" [Raw "x" []] + , Raw "bool" [Raw "True" []] + ] + ] + , Raw "bool" [Raw "True" []] + ] ==> + ( Type_Fun_Next Type_Bool + , False + , "(\\x0 -> (x0 | True) & !(x0 & True)) True" ) + ] + +{- +-- * Bool +raw_ty_bool :: Raw +raw_ty_bool = Raw "Bool" [] + +ty_bool + :: forall repr. + Either Error_Type (Type_Fun_Bool_End repr Bool) +ty_bool = type_from raw_ty_bool $ \(ty::Type_Fun_Bool_End repr h) -> + case ty of + Type_Fun_Next Type_Bool -> Right ty + _ -> Left "error" + +-- ** Bool -> Bool +raw_ty_bool2bool :: Raw +raw_ty_bool2bool = Raw "->" [Raw "Bool" [], Raw "Bool" []] + +ty0_bool2bool + :: forall repr. + Either Error_Type (Type_Fun_Bool_End repr (repr Bool -> repr Bool)) +ty0_bool2bool = type_from raw_ty_bool2bool $ \(ty::Type_Fun_Bool_End repr h) -> + case ty of + Type_Fun + (Type_Fun_Next Type_Bool) + (Type_Fun_Next Type_Bool) -> Right ty + _ -> Left "error" + +-- ** Bool -> Bool +raw_xor_true :: Raw +raw_xor_true = + Raw "lam" + [ Raw "x" [] + , raw_ty_bool + , Raw "xor" + [ Raw "var" [Raw "x" []] + , Raw "bool" [Raw "True" []] + ] + ] + +expr_bool_xor_true + :: forall repr. MonadIO repr => + Either Error_Type (repr (Repr_Host repr Bool -> Repr_Host repr Bool)) +expr_bool_xor_true = + expr_fun_bool_int_from + (Proxy::Proxy Type_End) + raw_xor_true $ \ty (repr::Repr_Host repr h) -> + case ty of + Type_Fun + (Type_Fun_Next Type_Bool) + (Type_Fun_Next Type_Bool) -> + Right $ meta_repr repr + _ -> Left "error" +-} diff --git a/TFHOE/Expr/Common.hs b/TFHOE/Expr/Common.hs new file mode 100644 index 0000000..bdf4cda --- /dev/null +++ b/TFHOE/Expr/Common.hs @@ -0,0 +1,53 @@ +{-# LANGUAGE ConstraintKinds #-} +{-# LANGUAGE ExistentialQuantification #-} +{-# LANGUAGE KindSignatures #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE Rank2Types #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE TypeFamilies #-} +module TFHOE.Expr.Common where + +import Data.Proxy (Proxy(..)) +import GHC.Prim (Constraint) + +import TFHOE.Type + +-- * Class 'Expr_from' + +class Expr_from raw (ty:: {-h-}* -> *) (ty_end:: {-h-}* -> *) where + expr_from + :: forall hs ret + . Proxy ty + -> Proxy ty_end + -> Context (Var ty_end) hs + -> raw + -> (forall h. ty_end h -> Forall_Repr_with_Context ty_end hs h + -> Either Error_Type ret) + -> Either Error_Type ret + +-- ** Type 'Expr_from_Type' + +-- | A type family recursively accumulating the expressions +-- an interpreter will have to support. +type family Expr_from_Type (ty:: * -> *) (repr:: * -> *) :: Constraint +type instance Expr_from_Type Type_End repr = () + +-- ** Type 'Forall_Repr_with_Context' + +-- | A data type embedding a universal quantification over @repr@ +-- to construct an expression polymorphic enough to stay +-- interpretable by different interpreters; +-- moreover the expression is abstracted by a 'Context' +-- built at parsing time. +data Forall_Repr_with_Context ty hs h + = Forall_Repr_with_Context + ( forall repr. Expr_from_Type ty repr => + Context repr hs -> repr h ) + +-- ** Type 'Forall_Repr' + +data Forall_Repr ty h + = Forall_Repr + { unForall_Repr :: forall repr + . Expr_from_Type ty repr + => repr h } diff --git a/TFHOE/Expr/Fun.hs b/TFHOE/Expr/Fun.hs new file mode 100644 index 0000000..e737cc8 --- /dev/null +++ b/TFHOE/Expr/Fun.hs @@ -0,0 +1,150 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE FlexibleInstances #-} +-- {-# LANGUAGE FunctionalDependencies #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE NoImplicitPrelude #-} +{-# LANGUAGE OverloadedStrings #-} +{-# LANGUAGE Rank2Types #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE TypeFamilies #-} +{-# OPTIONS_GHC -fno-warn-orphans #-} +module TFHOE.Expr.Fun where + +import Data.Either (Either(..)) +import Data.Eq (Eq(..)) +import Data.Function (($)) +-- import Data.Functor.Identity (Identity) +import Data.Maybe (Maybe(..)) +-- import Data.Monoid ((<>)) +import Data.Proxy (Proxy(..)) +-- import Data.Proxy (Proxy(..)) +-- import Data.String (String) +import Data.Type.Equality ((:~:)(Refl)) +-- import Data.Type.Equality ((:~:)(Refl)) +-- import Text.Show (Show(..)) + +import TFHOE.Raw +import TFHOE.Type +import TFHOE.Expr.Common +import TFHOE.Repr.Dup + +-- * Class 'Expr_Fun' + +-- | /Tagless-final symantics/ for /lambda abstraction/ +-- in /higher-order abstract syntax/ (HOAS), +-- and with argument @arg@ and result @res@ of 'Fun' +-- wrapped inside 'fun': to control the calling +-- in the 'Repr_Host' instance. +class (fun ~ Fun_from_Repr repr) => Expr_Fun fun repr where + -- | This type constructor is used like + -- the functional dependency: @repr -> fun@ + -- (ie. knowing @repr@ one can determine @fun@) + -- in order to avoid to introduce a 'Proxy' @fun@ + -- in 'let_inline', 'let_val' and 'let_lazy'. + -- + -- Distinguishing between @fun@ and @repr@ is used to maintain + -- the universal polymorphism of @repr@ in 'Expr_from', + -- the downside with this however is that + -- to be an instance of 'Expr_Fun' for all @fun@, + -- the @repr@ type of an interpreter + -- has to be parameterized by @fun@, + -- even though it does not actually need @fun@ to do its work. + -- + -- Basically this means having sometimes to add a type annotation + -- to the interpreter call to specify @fun@. + type Fun_from_Repr repr :: {-fun-}(* -> *) + + -- | Lambda application. + app :: repr (Fun fun arg res) -> repr arg -> repr res + + -- | /Call-by-name/ lambda. + inline :: (repr arg -> repr res) -> repr (Fun fun arg res) + -- | /Call-by-value/ lambda. + val :: (repr arg -> repr res) -> repr (Fun fun arg res) + -- | /Call-by-need/ lambda (aka. /lazyness/): lazy shares its argument, no matter what. + lazy :: (repr arg -> repr res) -> repr (Fun fun arg res) + + -- | Convenient 'inline' wrapper. + let_inline + :: Expr_Fun fun repr + => repr arg -> (repr arg -> repr res) -> repr res + let_inline x y = inline y `app` x + -- | Convenient 'val' wrapper. + let_val + :: Expr_Fun fun repr + => repr arg -> (repr arg -> repr res) -> repr res + let_val x y = val y `app` x + -- | Convenient 'lazy' wrapper. + let_lazy + :: Expr_Fun fun repr + => repr arg -> (repr arg -> repr res) -> repr res + let_lazy x y = lazy y `app` x + +infixl 5 `app` + +type instance Expr_from_Type (Type_Fun fun next) repr + = ( Expr_Fun fun repr + , Expr_from_Type next repr ) + +instance -- Expr_Fun Dup + ( Expr_Fun fun r1 + , Expr_Fun fun r2 + ) => Expr_Fun fun (Dup r1 r2) where + type Fun_from_Repr (Dup r1 r2) = Fun_from_Repr r1 + app (f1 `Dup` f2) (x1 `Dup` x2) = app f1 x1 `Dup` app f2 x2 + inline f = dup1 (inline f) `Dup` dup2 (inline f) + val f = dup1 (val f) `Dup` dup2 (val f) + lazy f = dup1 (lazy f) `Dup` dup2 (lazy f) +instance -- Expr_from Raw Type_Fun Type_Fun + ( Type_from Raw next + , Expr_from Raw next (Type_Fun fun next) + ) => Expr_from Raw (Type_Fun fun next) (Type_Fun fun next) where + expr_from _px_ty _px_ty_end ctx (Raw "var" [Raw name []]) k = + go ctx k + where + go :: forall hs ret. + Context (Var (Type_Fun fun next)) hs + -> (forall h. Type_Fun fun next h + -> Forall_Repr_with_Context (Type_Fun fun next) hs h + -> Either Error_Type ret) + -> Either Error_Type ret + go c k' = + case c of + Context_Empty -> Left "Error: var: unbound variable" + Var n ty `Context_Next` _ | n == name -> + k' ty $ Forall_Repr_with_Context $ + \(repr `Context_Next` _) -> repr + _ `Context_Next` ctx' -> + go ctx' $ \ty (Forall_Repr_with_Context repr) -> + k' ty $ Forall_Repr_with_Context $ + \(_ `Context_Next` c') -> repr c' + expr_from _px_ty px_ty_end ctx (Raw "app" [raw_lam, raw_val]) k = + expr_from px_ty_end px_ty_end ctx raw_lam $ \ty_lam (Forall_Repr_with_Context lam) -> + expr_from px_ty_end px_ty_end ctx raw_val $ \ty_val (Forall_Repr_with_Context val_) -> + case ty_lam of + ty_arg `Type_Fun` ty_res + | Just Refl <- ty_arg `type_eq` ty_val -> + k ty_res $ Forall_Repr_with_Context $ + \c -> lam c `app` val_ c + _ -> Left "Error: app: bad lambda application" + expr_from _px_ty px_ty_end ctx (Raw "inline" [Raw name [], raw_ty_arg, raw_body]) k = + type_from raw_ty_arg $ \ty_arg -> + expr_from px_ty_end px_ty_end (Var name ty_arg `Context_Next` ctx) raw_body $ + \ty_res (Forall_Repr_with_Context res) -> + k (ty_arg `Type_Fun` ty_res) $ Forall_Repr_with_Context $ + \c -> inline $ \arg -> res (arg `Context_Next` c) + expr_from _px_ty px_ty_end ctx (Raw "val" [Raw name [], raw_ty_arg, raw_body]) k = + type_from raw_ty_arg $ \ty_arg -> + expr_from px_ty_end px_ty_end (Var name ty_arg `Context_Next` ctx) raw_body $ + \ty_res (Forall_Repr_with_Context res) -> + k (ty_arg `Type_Fun` ty_res) $ Forall_Repr_with_Context $ + \c -> val $ \arg -> res (arg `Context_Next` c) + expr_from _px_ty px_ty_end ctx (Raw "lazy" [Raw name [], raw_ty_arg, raw_body]) k = + type_from raw_ty_arg $ \ty_arg -> + expr_from px_ty_end px_ty_end (Var name ty_arg `Context_Next` ctx) raw_body $ + \ty_res (Forall_Repr_with_Context res) -> + k (ty_arg `Type_Fun` ty_res) $ Forall_Repr_with_Context $ + \c -> lazy $ \arg -> res (arg `Context_Next` c) + expr_from _px_ty px_ty_end ctx raw k = + expr_from (Proxy::Proxy next) px_ty_end ctx raw k diff --git a/TFHOE/Expr/Fun/HLint.hs b/TFHOE/Expr/Fun/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Expr/Fun/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Expr/Fun/Test.hs b/TFHOE/Expr/Fun/Test.hs new file mode 100644 index 0000000..4f84f04 --- /dev/null +++ b/TFHOE/Expr/Fun/Test.hs @@ -0,0 +1,28 @@ +{-# LANGUAGE NoMonomorphismRestriction #-} +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE AllowAmbiguousTypes #-} +{-# OPTIONS_GHC -fno-warn-missing-signatures #-} + +module Expr.Fun.Test where + +import Test.Tasty + +import Prelude hiding (or, and) + +import TFHOE.Expr.Fun +import TFHOE.Expr.Bool + +e1 = val $ \x -> val $ \y -> (x `or` y) `and` neg (x `and` y) +e2 = val $ \x -> val $ \y -> (x `and` neg y) `or` (neg x `and` y) +e3 = let_val (bool True) $ \x -> x `and` x +e4 = let_val (val $ \x -> x `and` x) $ \f -> f `app` bool True +e5 = val $ \x0 -> val $ \x1 -> x0 `and` x1 +e6 = let_val (bool True) id `and` bool False +e7 = val $ \f -> (f `app` bool True) `and` bool True +e8 = val $ \f -> f `app` (bool True `and` bool True) + +tests :: TestTree +tests = + testGroup "Fun" + [ + ] diff --git a/TFHOE/Expr/HLint.hs b/TFHOE/Expr/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Expr/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Expr/Int.hs b/TFHOE/Expr/Int.hs new file mode 100644 index 0000000..2ca6dce --- /dev/null +++ b/TFHOE/Expr/Int.hs @@ -0,0 +1,79 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE Rank2Types #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE TypeFamilies #-} +{-# OPTIONS_GHC -fno-warn-orphans #-} +module TFHOE.Expr.Int where + +import Data.Proxy (Proxy(..)) + +import TFHOE.Raw +import TFHOE.Type +import TFHOE.Expr.Common +import TFHOE.Expr.Fun () +import TFHOE.Expr.Bool () +import TFHOE.Repr.Dup + +-- * Class 'Expr_Int' + +-- | Symantics combinable with 'Type_Int'. +class Expr_Int repr where + int :: Int -> repr Int + add :: repr Int -> repr Int -> repr Int + +type instance Expr_from_Type (Type_Int next) repr + = ( Expr_Int repr + , Expr_from_Type next repr ) + +instance -- Expr_Int Dup + ( Expr_Int r1 + , Expr_Int r2 + ) => Expr_Int (Dup r1 r2) where + int x = int x `Dup` int x + add (x1 `Dup` x2) (y1 `Dup` y2) = add x1 y1 `Dup` add x2 y2 +instance -- Expr_from Raw + ( Type_from Raw next + , Expr_from Raw next (Type_Fun_Bool_Int fun next) + ) => Expr_from Raw (Type_Int next) + (Type_Fun_Bool_Int fun next) where + expr_from _px_ty _px_ty_end _ctx (Raw "int" [Raw raw_int []]) k = do + (i::Int) <- read_safe raw_int + k (Type_Fun_Next $ Type_Bool_Next Type_Int) $ Forall_Repr_with_Context $ + \_c -> int i + expr_from _px_ty px_ty_end ctx (Raw "add" [raw_x, raw_y]) k = + expr_from px_ty_end px_ty_end ctx raw_x $ \ty_x (Forall_Repr_with_Context x) -> + expr_from px_ty_end px_ty_end ctx raw_y $ \ty_y (Forall_Repr_with_Context y) -> + case (ty_x, ty_y) of + ( Type_Fun_Next (Type_Bool_Next Type_Int) + , Type_Fun_Next (Type_Bool_Next Type_Int) ) -> + k ty_x $ Forall_Repr_with_Context $ + \c -> x c `add` y c + _ -> Left "Error: add: at least one operand is not an Int" + expr_from _px_ty px_ty_end ctx raw k = + expr_from (Proxy::Proxy next) px_ty_end ctx raw k +instance Expr_from Raw Type_End (Type_Fun_Bool_Int repr Type_End) where + expr_from _px_ty _px_ty_end _ctx raw _k = + Left $ "Error: invalid Type_Fun_Bool_Int: " ++ show raw + +expr_fun_bool_int_from + :: forall fun raw next. + ( Expr_from raw (Type_Fun_Bool_Int fun next) + (Type_Fun_Bool_Int fun next) + ) + => Proxy fun + -> Proxy next + -> raw + -> Either Error_Type + (Exists_Type_and_Repr + (Type_Fun_Bool_Int fun next) + (Forall_Repr (Type_Fun_Bool_Int fun next))) +expr_fun_bool_int_from _px_call _px_next raw = + expr_from + (Proxy::Proxy (Type_Fun_Bool_Int fun next)) + (Proxy::Proxy (Type_Fun_Bool_Int fun next)) + Context_Empty raw $ \ty (Forall_Repr_with_Context repr) -> + Right $ Exists_Type_and_Repr ty $ + Forall_Repr $ repr Context_Empty diff --git a/TFHOE/Expr/Test.hs b/TFHOE/Expr/Test.hs new file mode 100644 index 0000000..3d24620 --- /dev/null +++ b/TFHOE/Expr/Test.hs @@ -0,0 +1,13 @@ +module Expr.Test where + +import Test.Tasty + +import qualified Expr.Fun.Test as Fun +import qualified Expr.Bool.Test as Bool + +tests :: TestTree +tests = + testGroup "Expr" + [ Fun.tests + , Bool.tests + ] diff --git a/TFHOE/HLint.hs b/TFHOE/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Lib/Control/HLint.hs b/TFHOE/Lib/Control/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Lib/Control/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Lib/Control/Monad.hs b/TFHOE/Lib/Control/Monad.hs new file mode 100644 index 0000000..6a60367 --- /dev/null +++ b/TFHOE/Lib/Control/Monad.hs @@ -0,0 +1,40 @@ +module TFHOE.Lib.Control.Monad where + +import Control.Applicative (Applicative(..)) +import Control.Monad (Monad(..), (=<<), liftM2, liftM3, liftM4, join) +import Data.Bool +import Data.Maybe (Maybe(..), maybe) + +-- * 'Monad'ic utilities + +-- | Perform some operation on 'Just', given the field inside the 'Just'. +whenJust :: Applicative m => Maybe a -> (a -> m ()) -> m () +whenJust mg f = maybe (pure ()) f mg + +-- | Like 'when', but where the test can be 'Monad'-ic. +whenM :: Monad m => m Bool -> m () -> m () +whenM b t = ifM b t (return ()) + +-- | Like 'unless', but where the test can be 'Monad'-ic. +unlessM :: Monad m => m Bool -> m () -> m () +unlessM b = ifM b (return ()) + +-- | Like @if@, but where the test can be 'Monad'-ic. +ifM :: Monad m => m Bool -> m a -> m a -> m a +ifM b t f = do b' <- b; if b' then t else f + +-- | Like 'liftM' but 'join' the result of the lifted function. +liftMJoin :: Monad m => (a -> m b) -> m a -> m b +liftMJoin = (=<<) + +-- | Like 'liftM2' but 'join' the result of the lifted function. +liftM2Join :: Monad m => (a -> b -> m c) -> m a -> m b -> m c +liftM2Join f ma mb = join (liftM2 f ma mb) + +-- | Like 'liftM3' but 'join' the result of the lifted function. +liftM3Join :: Monad m => (a -> b -> c -> m d) -> m a -> m b -> m c -> m d +liftM3Join f ma mb mc = join (liftM3 f ma mb mc) + +-- | Like 'liftM3' but 'join' the result of the lifted function. +liftM4Join :: Monad m => (a -> b -> c -> d -> m e) -> m a -> m b -> m c -> m d -> m e +liftM4Join f ma mb mc md = join (liftM4 f ma mb mc md) diff --git a/TFHOE/Lib/HLint.hs b/TFHOE/Lib/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Lib/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Raw.hs b/TFHOE/Raw.hs new file mode 100644 index 0000000..8a2cee7 --- /dev/null +++ b/TFHOE/Raw.hs @@ -0,0 +1,14 @@ +module TFHOE.Raw where + +-- * Type 'Raw' + +-- | Data type on the wire. +data Raw + = Raw String [Raw] + deriving (Show) + +read_safe :: Read a => String -> Either String a +read_safe s = + case reads s of + [(x, "")] -> Right x + _ -> Left $ "Read error: " ++ s diff --git a/TFHOE/Raw/HLint.hs b/TFHOE/Raw/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Raw/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Raw/Test.hs b/TFHOE/Raw/Test.hs new file mode 100644 index 0000000..8c25902 --- /dev/null +++ b/TFHOE/Raw/Test.hs @@ -0,0 +1,15 @@ +module Raw.Test where + +import Test.Tasty +-- import Test.Tasty.HUnit + +tests :: TestTree +tests = testGroup "Raw" $ + [ ] + +{- +main :: IO () +main = do + print $ ($ 42) <$> expr_int_succ -- Right 43 + print $ ($ 42) <$> expr_bool_const_true -- Right True +-} diff --git a/TFHOE/Repr.hs b/TFHOE/Repr.hs new file mode 100644 index 0000000..f348b1c --- /dev/null +++ b/TFHOE/Repr.hs @@ -0,0 +1,9 @@ +module TFHOE.Repr + ( module TFHOE.Repr.Dup + , module TFHOE.Repr.Host + , module TFHOE.Repr.String + ) where + +import TFHOE.Repr.Dup +import TFHOE.Repr.Host +import TFHOE.Repr.String diff --git a/TFHOE/Repr/Dup.hs b/TFHOE/Repr/Dup.hs new file mode 100644 index 0000000..83d81bb --- /dev/null +++ b/TFHOE/Repr/Dup.hs @@ -0,0 +1,11 @@ +module TFHOE.Repr.Dup where + +-- | Data type to duplicate an expression +-- in order to evaluate it with different interpreters; +-- this is a more verbose and somehow less elegant alternative +-- to maintaining the universal polymorphism of @repr@ at parsing time. +data Dup repr1 repr2 a + = Dup + { dup1 :: repr1 a + , dup2 :: repr2 a + } diff --git a/TFHOE/Repr/HLint.hs b/TFHOE/Repr/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Repr/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Repr/Host.hs b/TFHOE/Repr/Host.hs new file mode 100644 index 0000000..d780e5a --- /dev/null +++ b/TFHOE/Repr/Host.hs @@ -0,0 +1,55 @@ +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GeneralizedNewtypeDeriving #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE TypeFamilies #-} +module TFHOE.Repr.Host where + +import Control.Monad.IO.Class (MonadIO(..)) +import Data.IORef + +import TFHOE.Lib.Control.Monad +import TFHOE.Expr + +-- * Type 'Repr_Host' + +-- | Host-circular interpreter, +-- producing a host-term of host-type @h@, +-- wrapped inside @fun@ because of 'Expr_Fun' +-- ability to control its callings ('inline', 'val', and 'lazy'). +newtype Repr_Host fun h + = Repr_Host + { unRepr_Host :: fun h } + deriving (Applicative, Functor, Monad, MonadIO) + +instance MonadIO fun => Expr_Fun fun (Repr_Host fun) where + type Fun_from_Repr (Repr_Host fun) = fun + app = liftM2Join $ \f a -> Repr_Host $ f $ return a + inline f = return $ unRepr_Host . f . Repr_Host + val f = return $ (>>= unRepr_Host . f . Repr_Host . return) + lazy f = return $ ((>>= unRepr_Host . f . Repr_Host) . expr_fun_lazy_share) +instance Monad repr => Expr_Bool (Repr_Host repr) where + bool = return + neg = liftMJoin $ return . not + and = liftM2Join $ \x y -> return $ x && y + or = liftM2Join $ \x y -> return $ x || y +instance Monad repr => Expr_Int (Repr_Host repr) where + int = return + add = liftM2Join $ \x y -> return $ x + y +--instance Monad m => Expr_Eq (Host m) where +-- eq = liftM2Join $ \x y -> return $ x == y + +host_repr :: Repr_Host repr h -> repr h +host_repr = unRepr_Host + +-- | Utility for storing arguments of 'lazy' into an 'IORef'. +expr_fun_lazy_share :: MonadIO m => m a -> m (m a) +expr_fun_lazy_share m = do + r <- liftIO $ newIORef (False, m) + return $ do + (already_evaluated, m') <- liftIO $ readIORef r + if already_evaluated + then m' + else do + v <- m' + liftIO $ writeIORef r (True, return v) + return v diff --git a/TFHOE/Repr/Host/HLint.hs b/TFHOE/Repr/Host/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Repr/Host/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Repr/Host/Test.hs b/TFHOE/Repr/Host/Test.hs new file mode 100644 index 0000000..f555337 --- /dev/null +++ b/TFHOE/Repr/Host/Test.hs @@ -0,0 +1,63 @@ +{-# LANGUAGE ConstraintKinds #-} +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE OverloadedStrings #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE Rank2Types #-} + +module Repr.Host.Test where + +-- import Data.Function (($)) +-- import Data.Functor.Identity (Identity) +import Test.Tasty +import Test.Tasty.HUnit + +import TFHOE.Type +import TFHOE.Repr +import TFHOE.Expr +import qualified Expr.Fun.Test as Fun.Test +import qualified Expr.Bool.Test as Bool.Test + +tests :: TestTree +tests = testGroup "Host" $ + let (==>) (expr::forall repr. Expr_from_Type (Type_Fun_Bool_End IO) repr => repr h) expected = + testCase ((string_repr :: Repr_String IO _h -> String) $ expr) $ + (>>= (@?= expected)) $ + host_repr expr in + [ testGroup "Bool" + [ Bool.Test.e1 ==> False + , Bool.Test.e2 ==> True + , Bool.Test.e3 ==> True + , Bool.Test.e4 ==> True + ] + , testGroup "Fun" + [ testGroup "Bool" + [ (Fun.Test.e1 `app` bool True `app` bool True) ==> False + , (Fun.Test.e1 `app` bool True `app` bool False) ==> True + , (Fun.Test.e1 `app` bool False `app` bool True) ==> True + , (Fun.Test.e1 `app` bool False `app` bool False) ==> False + + , (Fun.Test.e2 `app` bool True `app` bool True) ==> False + , (Fun.Test.e2 `app` bool True `app` bool False) ==> True + , (Fun.Test.e2 `app` bool False `app` bool True) ==> True + , (Fun.Test.e2 `app` bool False `app` bool False) ==> False + + , Fun.Test.e3 ==> True + , Fun.Test.e4 ==> True + + , (Fun.Test.e5 `app` bool True `app` bool True) ==> True + , (Fun.Test.e5 `app` bool True `app` bool False) ==> False + , (Fun.Test.e5 `app` bool False `app` bool True) ==> False + , (Fun.Test.e5 `app` bool False `app` bool False) ==> False + + , Fun.Test.e6 ==> False + , (Fun.Test.e7 `app` val id) ==> True + , (Fun.Test.e7 `app` val neg) ==> False + ] + ] + {-, testGroup "If" + [ If.e1 ==> "if True then False else True" + , If.e2 ==> "if True & True then False else True" + ] + -}] + + diff --git a/TFHOE/Repr/String.hs b/TFHOE/Repr/String.hs new file mode 100644 index 0000000..3132d07 --- /dev/null +++ b/TFHOE/Repr/String.hs @@ -0,0 +1,152 @@ +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GeneralizedNewtypeDeriving #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE TypeFamilies #-} +module TFHOE.Repr.String where + +-- import Data.Functor.Identity (Identity) +import Data.Monoid ((<>)) +import Data.String (IsString(..)) + +import TFHOE.Expr + +-- * Type 'Repr_String' + +-- | 'String' interpreter. +newtype Repr_String (fun:: * -> *) h + = Repr_String + { unRepr_String + -- Inherited attributes: + :: Precedence + -> Repr_String_Lambda_Depth + -- Synthetised attributes: + -> String + } +type Repr_String_Lambda_Depth = Int + +string_repr :: Repr_String fun h -> String +string_repr r = unRepr_String r precedence_Toplevel 0 + +string_repr_any :: ty h -> Repr_String fun h -> Either err String +string_repr_any _ty = return . string_repr + +instance Show (Repr_String fun a) where + show = string_repr + +instance Expr_Fun fun (Repr_String fun) where + type Fun_from_Repr (Repr_String fun) = fun + app (Repr_String f) (Repr_String x) = Repr_String $ \p v -> + let p' = precedence_App in + paren p p' $ + f p' v <> " " <> x p' v + inline = repr_string_fun "!" + val = repr_string_fun "" + lazy = repr_string_fun "~" + + let_inline = repr_string_let "!" + let_val = repr_string_let "" + let_lazy = repr_string_let "~" + +-- ** Instance 'Fun' helpers +repr_string_fun :: String -> (Repr_String fun a2 -> Repr_String fun a1) -> Repr_String fun a +repr_string_fun mode e = + Repr_String $ \p v -> + let p' = precedence_Fun in + let x = "x" <> show v in + paren p p' $ + "\\" <> mode <> x <> " -> " <> + unRepr_String (e (Repr_String $ \_p _v -> x)) p' (succ v) +repr_string_let + :: String + -> Repr_String fun a1 + -> (Repr_String fun a3 -> Repr_String fun a2) + -> Repr_String fun a +repr_string_let mode e in_ = + Repr_String $ \p v -> + let p' = precedence_Let in + let x = "x" <> show v in + paren p p' $ + "let" <> mode <> " " <> x <> " = " <> unRepr_String e p (succ v) <> " in " <> + unRepr_String (in_ (Repr_String $ \_p _v -> x)) p (succ v) + +instance Expr_Bool (Repr_String fun) where + bool a = Repr_String $ \_p _v -> show a + neg (Repr_String x) = + Repr_String $ \p v -> + let p' = precedence_Neg in + paren p p' $ "!" <> x (precedence_succ p') v + and (Repr_String x) (Repr_String y) = + Repr_String $ \p v -> + let p' = precedence_And in + paren p p' $ x p' v <> " & " <> y p' v + or (Repr_String x) (Repr_String y) = + Repr_String $ \p v -> + let p' = precedence_Or in + paren p p' $ x p' v <> " | " <> y p' v + {-xor (Repr_String x) (Repr_String y) = + Repr_String $ \p v -> + let p' = precedence_Xor in + paren p p' $ x p' v <> " * " <> y p' v + -} +instance Expr_Int (Repr_String fun) where + int a = Repr_String $ \_p _v -> show a + add (Repr_String x) (Repr_String y) = + Repr_String $ \p v -> + let p' = precedence_Add in + paren p p' $ x p' v <> " + " <> y p' v +{- +instance Expr_If Repr_String where + if_ + (Repr_String cond) + (Repr_String ok) + (Repr_String ko) = + Repr_String $ \p v -> + let p' = precedence_If in + paren p p' $ + "if " <> cond p' v <> + " then " <> ok p' v <> + " else " <> ko p' v + when_ (Repr_String cond) (Repr_String ok) = + Repr_String $ \p v -> + let p' = precedence_If in + paren p p' $ + "when " <> cond p' v <> + " " <> ok p' v +-} + +-- ** Type 'Precedence' + +newtype Precedence = Precedence Int + deriving (Eq, Ord, Show) +precedence_pred :: Precedence -> Precedence +precedence_pred (Precedence p) = Precedence (pred p) +precedence_succ :: Precedence -> Precedence +precedence_succ (Precedence p) = Precedence (succ p) +paren :: (Monoid s, IsString s) => Precedence -> Precedence -> s -> s +paren prec prec' x = + if prec >= prec' + then fromString "(" <> x <> fromString ")" + else x + +precedence_Toplevel :: Precedence +precedence_Toplevel = Precedence 0 +precedence_Fun :: Precedence +precedence_Fun = Precedence 1 +precedence_Let :: Precedence +precedence_Let = Precedence 2 +precedence_If :: Precedence +precedence_If = Precedence 3 +precedence_Or :: Precedence +precedence_Or = Precedence 4 +precedence_Add :: Precedence +precedence_Add = precedence_Or +precedence_Xor :: Precedence +precedence_Xor = Precedence 5 +precedence_And :: Precedence +precedence_And = Precedence 6 +precedence_App :: Precedence +precedence_App = Precedence 7 +precedence_Neg :: Precedence +precedence_Neg = Precedence 8 +precedence_Atomic :: Precedence +precedence_Atomic = Precedence 9 diff --git a/TFHOE/Repr/String/HLint.hs b/TFHOE/Repr/String/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Repr/String/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Repr/String/Test.hs b/TFHOE/Repr/String/Test.hs new file mode 100644 index 0000000..9ae4f8b --- /dev/null +++ b/TFHOE/Repr/String/Test.hs @@ -0,0 +1,43 @@ +module Repr.String.Test where + +import Test.Tasty +import Test.Tasty.HUnit + +import TFHOE.Repr +import qualified Expr.Fun.Test as Fun.Test +import qualified Expr.Bool.Test as Bool.Test + +tests :: TestTree +tests = testGroup "String" $ + let (==>) expr expected = + testCase expected $ + string_repr expr @?= + expected + in + [ testGroup "Bool" + [ Bool.Test.e1 ==> "True & False" + , Bool.Test.e2 ==> "True & False | True & True" + , Bool.Test.e3 ==> "(True | False) & (True | True)" + , Bool.Test.e4 ==> "True & !False" + , Bool.Test.e5 ==> "True & !x" + , Bool.Test.e6 ==> "(x | y) & !(x & y)" + , Bool.Test.e7 ==> "((x | y) & !(x & y) | z) & !(((x | y) & !(x & y)) & z)" + , Bool.Test.e8 ==> "(x | (y | True) & !(y & True)) & !(x & ((y | True) & !(y & True)))" + ] + , testGroup "Fun" + [ Fun.Test.e1 ==> "\\x0 -> (\\x1 -> (x0 | x1) & !(x0 & x1))" + , Fun.Test.e2 ==> "\\x0 -> (\\x1 -> x0 & !x1 | !x0 & x1)" + , Fun.Test.e3 ==> "let x0 = True in x0 & x0" + , Fun.Test.e4 ==> "let x0 = \\x1 -> x1 & x1 in x0 True" + , Fun.Test.e5 ==> "\\x0 -> (\\x1 -> x0 & x1)" + , Fun.Test.e6 ==> "(let x0 = True in x0) & False" + , Fun.Test.e7 ==> "\\x0 -> x0 True & True" + , Fun.Test.e8 ==> "\\x0 -> x0 (True & True)" + ] + {-, testGroup "If" + [ If.e1 ==> "if True then False else True" + , If.e2 ==> "if True & True then False else True" + ] + -}] + + diff --git a/TFHOE/Repr/Test.hs b/TFHOE/Repr/Test.hs new file mode 100644 index 0000000..6287f0a --- /dev/null +++ b/TFHOE/Repr/Test.hs @@ -0,0 +1,12 @@ +module Repr.Test where + +import Test.Tasty +import qualified Repr.Host.Test as Host +import qualified Repr.String.Test as String + +tests :: TestTree +tests = + testGroup "Repr" + [ Host.tests + , String.tests + ] diff --git a/TFHOE/Test.hs b/TFHOE/Test.hs new file mode 100644 index 0000000..e7c8b0a --- /dev/null +++ b/TFHOE/Test.hs @@ -0,0 +1,25 @@ +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE OverloadedStrings #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE TupleSections #-} +{-# OPTIONS_GHC -fno-warn-orphans #-} +module Test where + +import Test.Tasty + +import qualified Expr.Test as Expr +import qualified Raw.Test as Raw +import qualified Repr.Test as Repr +import qualified Type.Test as Type +-- import qualified Trans.Test as Trans + +main :: IO () +main = + defaultMain $ + testGroup "TFHOE" + [ Repr.tests + , Raw.tests + , Expr.tests + , Type.tests + -- , Trans.tests + ] diff --git a/TFHOE/Type.hs b/TFHOE/Type.hs new file mode 100644 index 0000000..00d320b --- /dev/null +++ b/TFHOE/Type.hs @@ -0,0 +1,11 @@ +module TFHOE.Type + ( module TFHOE.Type.Common + , module TFHOE.Type.Fun + , module TFHOE.Type.Int + , module TFHOE.Type.Bool + ) where + +import TFHOE.Type.Common +import TFHOE.Type.Fun +import TFHOE.Type.Int +import TFHOE.Type.Bool diff --git a/TFHOE/Type/Bool.hs b/TFHOE/Type/Bool.hs new file mode 100644 index 0000000..8186c3b --- /dev/null +++ b/TFHOE/Type/Bool.hs @@ -0,0 +1,50 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE TypeFamilies #-} +module TFHOE.Type.Bool where + +import Data.Maybe (isJust) +import Data.Type.Equality ((:~:)(Refl)) + +import TFHOE.Raw +import TFHOE.Type.Common +import TFHOE.Type.Fun + +-- * Type 'Type_Bool' + +-- | GADT for integer type: +-- +-- * singleton (bijective mapping between Haskell type @h@ and the GADT's terms), +-- * and extensible (through @next@). +data Type_Bool (next:: * -> *) h where + Type_Bool :: Type_Bool next Bool -- Introduce an 'Bool' type. + Type_Bool_Next :: next h -> Type_Bool next h -- Introduce a type extension @next@. + +type Type_Fun_Bool fun next = Type_Fun fun (Type_Bool next) +type Type_Fun_Bool_End fun = Type_Fun_Bool fun Type_End + +instance -- Type_Eq + Type_Eq next => + Type_Eq (Type_Bool next) where + type_eq Type_Bool Type_Bool = Just Refl + type_eq (Type_Bool_Next x) (Type_Bool_Next y) = x `type_eq` y + type_eq _ _ = Nothing +instance -- Eq + Type_Eq next => + Eq (Type_Bool next h) where + x == y = isJust $ type_eq x y +instance -- Type_from Raw + Type_from Raw next => + Type_from Raw (Type_Bool next) where + type_from (Raw "Bool" []) k = k Type_Bool + type_from raw k = type_from raw $ k . Type_Bool_Next +instance -- String_from_Type + String_from_Type next => + String_from_Type (Type_Bool next) where + string_from_type Type_Bool = "Bool" + string_from_type (Type_Bool_Next t) = string_from_type t +instance -- Show + String_from_Type next => + Show (Type_Bool next h) where + show = string_from_type diff --git a/TFHOE/Type/Common.hs b/TFHOE/Type/Common.hs new file mode 100644 index 0000000..df37c26 --- /dev/null +++ b/TFHOE/Type/Common.hs @@ -0,0 +1,91 @@ +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE ExistentialQuantification #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE KindSignatures #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE Rank2Types #-} +{-# LANGUAGE TypeFamilies #-} +{-# LANGUAGE TypeOperators #-} +module TFHOE.Type.Common where + +import Data.Maybe (isJust) +import Data.Type.Equality ((:~:)(Refl)) + +-- * Class 'Type_Eq' + +-- | Test two types for equality, +-- returning an Haskell type-level proof +-- of the equality when it holds. +class Type_Eq ty where + type_eq :: forall h1 h2. ty h1 -> ty h2 -> Maybe (h1 :~: h2) + +-- * Class 'Type_from' + +class Type_Eq ty => Type_from raw ty where + type_from + :: raw + -> (forall h. ty h -> Either Error_Type ret) + -> Either Error_Type ret + +type Error_Type = String + +-- * Class 'String_from_Type' + +class String_from_Type ty where + string_from_type :: ty h -> String + +-- * Type 'Var' + +-- | Join a name and a type; +-- used to handle lambda variables by name +-- (and not DeBruijn indices). +data Var ty h + = Var String (ty h) + +-- * Type 'Context' + +-- | GADT for a typing context, +-- accumulating an @item@ at each lambda; +-- used to accumulate object-types of lambda variables in 'Expr_from' +-- or meta-terms of lambda variables in 'Repr_Host'. +data Context :: (* -> *) -> [*] -> * where + Context_Empty :: Context item '[] + Context_Next :: item h -> Context item hs -> Context item (h ': hs) +infixr 5 `Context_Next` + +-- ** Type 'Type_End' + +-- | Close an extensible type. +data Type_End h where + Type_End :: Type_End () + +instance Type_Eq Type_End where + type_eq Type_End Type_End = Just Refl +instance Eq (Type_End h) where + _ == _ = True +instance String_from_Type Type_End where + string_from_type _ = "" +instance Type_from raw Type_End where + type_from _raw k = k Type_End + +-- * Type 'Exists_Type' + +-- | Existential data type to wrap an indexed type. +data Exists_Type ty + = forall h. Exists_Type (ty h) +instance -- Eq + Type_Eq ty => + Eq (Exists_Type ty) where + Exists_Type xh == Exists_Type yh = + isJust $ type_eq xh yh +instance -- Show + String_from_Type ty => + Show (Exists_Type ty) where + show (Exists_Type ty) = string_from_type ty + +-- * Type 'Exists_Type_and_Repr' + +data Exists_Type_and_Repr ty repr + = forall h. + Exists_Type_and_Repr (ty h) (repr h) diff --git a/TFHOE/Type/Fun.hs b/TFHOE/Type/Fun.hs new file mode 100644 index 0000000..bd81709 --- /dev/null +++ b/TFHOE/Type/Fun.hs @@ -0,0 +1,63 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE TypeFamilies #-} +module TFHOE.Type.Fun where + +import Data.Maybe (isJust) +import Data.Type.Equality ((:~:)(Refl)) + +import TFHOE.Raw +import TFHOE.Type.Common + +-- * Type 'Type_Fun' + +data Type_Fun fun next h where + Type_Fun :: Type_Fun fun next arg + -> Type_Fun fun next res + -> Type_Fun fun next (Fun fun arg res) + Type_Fun_Next :: next h -> Type_Fun fun next h + +instance -- Type_Eq + Type_Eq next => + Type_Eq (Type_Fun fun next) where + type_eq + (arg1 `Type_Fun` res1) + (arg2 `Type_Fun` res2) + | Just Refl <- arg1 `type_eq` arg2 + , Just Refl <- res1 `type_eq` res2 + = Just Refl + type_eq (Type_Fun_Next x) + (Type_Fun_Next y) = x `type_eq` y + type_eq _ _ = Nothing +instance -- Eq + Type_Eq next => + Eq (Type_Fun fun next h) where + x == y = isJust $ type_eq x y +instance -- Type_from Raw + Type_from Raw next => + Type_from Raw (Type_Fun fun next) where + type_from (Raw "->" [raw_arg, raw_res]) k = + type_from raw_arg $ \ty_arg -> + type_from raw_res $ \ty_res -> + k (ty_arg `Type_Fun` ty_res) + type_from raw k = type_from raw $ k . Type_Fun_Next +instance -- String_from_Type + String_from_Type next => + String_from_Type (Type_Fun fun next) where + string_from_type (arg `Type_Fun` res) = + "(" ++ string_from_type arg ++ " -> " + ++ string_from_type res ++ ")" + string_from_type (Type_Fun_Next t) = string_from_type t +instance -- Show + String_from_Type next => + Show (Type_Fun fun next h) where + show = string_from_type + +-- ** Type 'Fun' + +-- | A type synonym for the host-type function, +-- wrapping argument and result within a type constructor @fun@, +-- which is used in the 'Repr_Host' instance of 'Expr_Fun' +-- to implement 'val' and 'lazy'. +type Fun fun arg res = (fun arg -> fun res) diff --git a/TFHOE/Type/HLint.hs b/TFHOE/Type/HLint.hs new file mode 120000 index 0000000..ab18269 --- /dev/null +++ b/TFHOE/Type/HLint.hs @@ -0,0 +1 @@ +../HLint.hs \ No newline at end of file diff --git a/TFHOE/Type/Int.hs b/TFHOE/Type/Int.hs new file mode 100644 index 0000000..36deab6 --- /dev/null +++ b/TFHOE/Type/Int.hs @@ -0,0 +1,51 @@ +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE TypeFamilies #-} +module TFHOE.Type.Int where + +import Data.Maybe (isJust) +import Data.Type.Equality ((:~:)(Refl)) + +import TFHOE.Raw +import TFHOE.Type.Common +import TFHOE.Type.Bool + +-- * Type 'Type_Int' + +-- | GADT for integer type: +-- +-- * singleton (bijective mapping between Haskell type @h@ and the GADT's terms), +-- * and extensible (through @next@). +data Type_Int (next:: * -> *) h where + Type_Int :: Type_Int next Int -- Introduce an 'Int' type. + Type_Int_Next :: next h -> Type_Int next h -- Introduce a type extension @next@. + +type Type_Fun_Bool_Int repr next = Type_Fun_Bool repr (Type_Int next) +type Type_Fun_Bool_Int_End repr = Type_Fun_Bool_Int repr Type_End + +instance -- Type_Eq + Type_Eq next => + Type_Eq (Type_Int next) where + type_eq Type_Int Type_Int = Just Refl + type_eq (Type_Int_Next x) (Type_Int_Next y) = x `type_eq` y + type_eq _ _ = Nothing +instance -- Eq + Type_Eq next => + Eq (Type_Int next h) where + x == y = isJust $ type_eq x y +instance -- Type_from Raw + Type_from Raw next => + Type_from Raw (Type_Int next) where + type_from (Raw "Int" []) k = k Type_Int + type_from raw k = type_from raw $ k . Type_Int_Next +instance -- String_from_Type + String_from_Type next => + String_from_Type (Type_Int next) where + string_from_type Type_Int = "Int" + string_from_type (Type_Int_Next t) = string_from_type t +instance -- Show + String_from_Type next => + Show (Type_Int next h) where + show = string_from_type diff --git a/TFHOE/Type/Test.hs b/TFHOE/Type/Test.hs new file mode 100644 index 0000000..3928174 --- /dev/null +++ b/TFHOE/Type/Test.hs @@ -0,0 +1,28 @@ +{-# LANGUAGE ScopedTypeVariables #-} +module Type.Test where + +import Test.Tasty +import Test.Tasty.HUnit + +import TFHOE.Raw +import TFHOE.Type + +tests :: TestTree +tests = testGroup "Type" $ + let (==>) raw expected = + testCase (show raw) $ + type_from raw (Right . Exists_Type) @?= + Right (Exists_Type expected) in + [ Raw "->" [Raw "Bool" [], Raw "Bool" []] + ==> (Type_Fun_Next Type_Bool `Type_Fun` Type_Fun_Next Type_Bool + :: Type_Fun_Bool_End repr (repr Bool -> repr Bool)) + , Raw "Bool" [] + ==> (Type_Fun_Next Type_Bool + :: Type_Fun_Bool_End repr Bool) + , Raw "Int" [] + ==> (Type_Fun_Next (Type_Bool_Next Type_Int) + :: Type_Fun_Bool_Int_End repr Int) + , Raw "->" [Raw "Bool" [], Raw "Int" []] + ==> (Type_Fun_Next Type_Bool `Type_Fun` Type_Fun_Next (Type_Bool_Next Type_Int) + :: Type_Fun_Bool_Int_End repr (repr Bool -> repr Int)) + ] diff --git a/test.sh b/test.sh new file mode 100755 index 0000000..e0c98a4 --- /dev/null +++ b/test.sh @@ -0,0 +1,2 @@ +#!/bin/sh -x +cabal test tfhoe-test --test-option=--color --test-option=always --show-details always "$@" -- 2.44.1