AspectAG 0.7.0.1 → 0.8.0.0
raw patch · 19 files changed
+3357/−2560 lines, 19 filesdep +AspectAGdep −containersdep −ghc-primdep −loch-thdep ~basedep ~mtldep ~poly-recsetup-changed
Dependencies added: AspectAG
Dependencies removed: containers, ghc-prim, loch-th, template-haskell
Dependency ranges changed: base, mtl, poly-rec, requirements
Files
- AspectAG.cabal +47/−139
- CHANGELOG.md +5/−0
- ChangeLog.md +0/−5
- LICENSE +253/−588
- Setup.hs +0/−2
- src/Control/IMonad.hs +16/−0
- src/Language/AspectAG.hs +1222/−0
- src/Language/AspectAG/EADT.hs +195/−0
- src/Language/AspectAG/Example2.hs +237/−0
- src/Language/AspectAG/Example3.hs +55/−0
- src/Language/AspectAG/RecordInstances.hs +412/−0
- src/Language/AspectAG/RunningExample.lhs +552/−0
- src/Language/AspectAG/Types.hs +359/−0
- src/Language/Grammars/AspectAG.hs +0/−1122
- src/Language/Grammars/AspectAG/HList.hs +0/−86
- src/Language/Grammars/AspectAG/RecordInstances.hs +0/−284
- src/Language/Grammars/AspectAG/TH.hs +0/−281
- src/Language/Grammars/AspectAG/THGen.hs +0/−53
- test/Main.hs +4/−0
AspectAG.cabal view
@@ -1,143 +1,51 @@--- Initial AspectAG.cabal generated by cabal init. For further--- documentation, see http://haskell.org/cabal/users-guide/---- The name of the package.-name: AspectAG---- The package version. See the Haskell package versioning policy (PVP)--- for standards guiding when and how versions should be incremented.--- https://wiki.haskell.org/Package_versioning_policy--- PVP summary: +-+------- breaking API changes--- | | +----- non-breaking API additions--- | | | +--- code changes with no API change-version: 0.7.0.1---- A short (one-line) description of the package.-synopsis: Strongly typed Attribute Grammars implemented using type-level programming.---- A longer description of the package.-description: An EDSL implementing strongly typed -and strongly kinded!- attribute grammars- implemented using type-level programming. We make an effort to encode precise EDSL- type errors.---- URL for the project homepage or repository.-homepage: www.fing.edu.uy/~jpgarcia/AspectAG---- The license under which the package is released.-license: GPL-3---- The file containing the license text.-license-file: LICENSE---- The package author(s).-author: Juan García Garland, Marcos Viera---- An email address to which users can send suggestions, bug reports, and--- patches.-maintainer: jpgarcia@fing.edu.uy--category: Language, Aspect Oriented Programming, --build-type: Simple---- Extra files to be distributed with the package, such as examples or a--- README.-extra-source-files: ChangeLog.md,- LICENSE------source-repository:--- type: git--- location: https://gitlab.fing.edu.uy/jpgarcia/attribute-grammars---- Constraint on the version of Cabal needed to build this package.-cabal-version: >=1.10+cabal-version: 3.0+name: AspectAG+version: 0.8.0.0+synopsis: First-class Attribute Grammars implemented using type-level programming.+-- description:+license: GPL-2.0-or-later+license-file: LICENSE+author: Juan García-Garland, Marcos Viera, Alberto Pardo+maintainer: jpgarcia@fing.edu.uy+-- copyright:+category: Language+build-type: Simple+extra-doc-files: CHANGELOG.md+-- extra-source-files: +common warnings+ ghc-options: library- -- Modules exported by the library.- exposed-modules: Language.Grammars.AspectAG,- Language.Grammars.AspectAG.TH,- Language.Grammars.AspectAG.THGen,- Language.Grammars.AspectAG.HList,- Language.Grammars.AspectAG.RecordInstances---- LANGUAGE extensions used by modules in this package.- other-extensions: TypeInType,- TypeFamilies,- FlexibleContexts,- ScopedTypeVariables,- NoMonomorphismRestriction,- AllowAmbiguousTypes,- ImplicitParams,- ExtendedDefaultRules,- UnicodeSyntax,- DataKinds,- GADTs,- KindSignatures,- TypeOperators,- MultiParamTypeClasses,- FlexibleInstances,- StandaloneDeriving,- UndecidableInstances,- FunctionalDependencies,- ConstraintKinds,- PolyKinds,- RankNTypes,- InstanceSigs-- -- Other library packages from which modules are imported.- build-depends: base >=4.11 && <4.18,- containers,- ghc-prim,- mtl >= 2.0,- poly-rec >=0.7.0 && <0.7.1,- requirements >=0.7.0 && <0.7.1,- template-haskell >= 2.13,- loch-th- -- -- Directories containing source files.- hs-source-dirs: src-- -- Base language which the package is written in.- default-language: Haskell2010---- Test-Suite test-Repmin--- type: exitcode-stdio-1.0--- main-is: test/Repmin.hs--- build-depends: base >=4.11 && <4.12,--- tagged >=0.8 && <0.9,--- AspectAG >= 0.4,--- QuickCheck--- default-language: Haskell2010---- Test-Suite test-Repmin-TH--- type: exitcode-stdio-1.0--- main-is: test/RepminTH.hs--- build-depends: base >=4.11 && <4.12,--- tagged >=0.8 && <0.9,--- AspectAG >= 0.4,--- QuickCheck--- default-language: Haskell2010- --- Test-Suite test-Arith--- type: exitcode-stdio-1.0--- main-is: test/Arith.hs--- build-depends: base >=4.11 && <4.12,--- containers >= 0.5,--- tagged >=0.8 && <0.9,--- AspectAG >= 0.4,--- QuickCheck--- default-language: Haskell2010+ import: warnings+ exposed-modules: Language.AspectAG,+ Language.AspectAG.Types,+ Language.AspectAG.RecordInstances,+ Language.AspectAG.Example2,+ Language.AspectAG.Example3,+ Language.AspectAG.RunningExample,+ Language.AspectAG.EADT,+ Control.IMonad+ -- other-modules:+ -- other-extensions:+ build-depends: base >=4.20.0.0 && < 4.21,+ poly-rec >=0.7.0.4,+ requirements >=0.7.0.3,+ mtl+ + hs-source-dirs: src+ default-language: GHC2021 --- Test-Suite test-Graphs--- type: exitcode-stdio-1.0--- main-is: test/Graphs.hs--- build-depends: base >=4.11 && <4.12,--- tagged >=0.8 && <0.9,--- AspectAG >= 0.4,--- containers >= 0.5,--- QuickCheck--- default-language: Haskell2010+test-suite AspectAG2-test+ import: warnings+ default-language: GHC2021+ -- other-modules:+ -- other-extensions:+ type: exitcode-stdio-1.0+ hs-source-dirs: test+ main-is: Main.hs+ build-depends:+ base ^>=4.20.0.0,+ AspectAG, + poly-rec >=0.7.0.4 && <0.7.1,+ requirements >=0.7.0.3 && <0.7.1
+ CHANGELOG.md view
@@ -0,0 +1,5 @@+# Revision history for AspectAG2++## 0.1.0.0 -- YYYY-mm-dd++* First version. Released on an unsuspecting world.
− ChangeLog.md
@@ -1,5 +0,0 @@-# Revision history for AspectAG--## 0.4 -- YYYY-mm-dd--* First version. Released on an unsuspecting world.
LICENSE view
@@ -1,626 +1,285 @@- GNU GENERAL PUBLIC LICENSE- Version 3, 29 June 2007+ GNU GENERAL PUBLIC LICENSE+ Version 2, June 1991 - Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 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.+ Preamble - 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+ The licenses for most software are designed to take away your+freedom to share and change it. By contrast, the GNU General Public+License is intended to guarantee your freedom to share and change free+software--to make sure the software is free for all its users. This+General Public License applies to most of the Free Software+Foundation's software and to any other program whose authors commit to+using it. (Some other Free Software Foundation software is covered by+the GNU Lesser General Public License instead.) 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.+this service 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.+ To protect your rights, we need to make restrictions that forbid+anyone to deny you these rights or to ask you to surrender the rights.+These restrictions translate to certain responsibilities for you if you+distribute copies of the software, or if you modify it. 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.+gratis or for a fee, you must give the recipients all the rights that+you have. 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. - 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.+ We protect your rights with two steps: (1) copyright the software, and+(2) offer you this license which gives you legal permission to copy,+distribute and/or modify the software. - 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.+ Also, for each author's protection and ours, we want to make certain+that everyone understands that there is no warranty for this free+software. If the software is modified by someone else and passed on, we+want its recipients to know that what they have is not the original, so+that any problems introduced by others will not reflect on the original+authors' reputations. - 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.+ Finally, any free program is threatened constantly by software+patents. We wish to avoid the danger that redistributors of a free+program will individually obtain patent licenses, in effect making the+program proprietary. To prevent this, we have made it clear that any+patent must be licensed for everyone's free use or not licensed at all. 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+ GNU GENERAL PUBLIC LICENSE+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - d) Limiting the use for publicity purposes of names of licensors or- authors of the material; or+ 0. This License applies to any program or other work which contains+a notice placed by the copyright holder saying it may be distributed+under the terms of this General Public License. The "Program", below,+refers to any such program or work, and a "work based on the Program"+means either the Program or any derivative work under copyright law:+that is to say, a work containing the Program or a portion of it,+either verbatim or with modifications and/or translated into another+language. (Hereinafter, translation is included without limitation in+the term "modification".) Each licensee is addressed as "you". - e) Declining to grant rights under trademark law for use of some- trade names, trademarks, or service marks; or+Activities other than copying, distribution and modification are not+covered by this License; they are outside its scope. The act of+running the Program is not restricted, and the output from the Program+is covered only if its contents constitute a work based on the+Program (independent of having been made by running the Program).+Whether that is true depends on what the Program does. - 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.+ 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the+notices that refer to this License and to the absence of any warranty;+and give any other recipients of the Program a copy of this License+along with the Program. - 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.+You may charge a fee for the physical act of transferring a copy, and+you may at your option offer warranty protection in exchange for a fee. - 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.+ 2. You may modify your copy or copies of the Program or any portion+of it, thus forming a work based on the Program, and copy and+distribute such modifications or work under the terms of Section 1+above, provided that you also meet all of these conditions: - 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.+ a) You must cause the modified files to carry prominent notices+ stating that you changed the files and the date of any change. - 8. Termination.+ b) You must cause any work that you distribute or publish, that in+ whole or in part contains or is derived from the Program or any+ part thereof, to be licensed as a whole at no charge to all third+ parties under the terms of this License. - 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).+ c) If the modified program normally reads commands interactively+ when run, you must cause it, when started running for such+ interactive use in the most ordinary way, to print or display an+ announcement including an appropriate copyright notice and a+ notice that there is no warranty (or else, saying that you provide+ a warranty) and that users may redistribute the program under+ these conditions, and telling the user how to view a copy of this+ License. (Exception: if the Program itself is interactive but+ does not normally print such an announcement, your work based on+ the Program is not required to print an announcement.) - 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.+These requirements apply to the modified work as a whole. If+identifiable sections of that work are not derived from the Program,+and can be reasonably considered independent and separate works in+themselves, then this License, and its terms, do not apply to those+sections when you distribute them as separate works. But when you+distribute the same sections as part of a whole which is a work based+on the Program, the distribution of the whole must be on the terms of+this License, whose permissions for other licensees extend to the+entire whole, and thus to each and every part regardless of who wrote it. - 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.+Thus, it is not the intent of this section to claim rights or contest+your rights to work written entirely by you; rather, the intent is to+exercise the right to control the distribution of derivative or+collective works based on the Program. - 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.+In addition, mere aggregation of another work not based on the Program+with the Program (or with a work based on the Program) on a volume of+a storage or distribution medium does not bring the other work under+the scope of this License. - 9. Acceptance Not Required for Having Copies.+ 3. You may copy and distribute the Program (or a work based on it,+under Section 2) in object code or executable form under the terms of+Sections 1 and 2 above provided that you also do one of the following: - 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.+ a) Accompany it with the complete corresponding machine-readable+ source code, which must be distributed under the terms of Sections+ 1 and 2 above on a medium customarily used for software interchange; or, - 10. Automatic Licensing of Downstream Recipients.+ b) Accompany it with a written offer, valid for at least three+ years, to give any third party, for a charge no more than your+ cost of physically performing source distribution, a complete+ machine-readable copy of the corresponding source code, to be+ distributed under the terms of Sections 1 and 2 above on a medium+ customarily used for software interchange; or, - 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.+ c) Accompany it with the information you received as to the offer+ to distribute corresponding source code. (This alternative is+ allowed only for noncommercial distribution and only if you+ received the program in object code or executable form with such+ an offer, in accord with Subsection b above.) - 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.+The source code for a work means the preferred form of the work for+making modifications to it. For an executable work, complete source+code means all the source code for all modules it contains, plus any+associated interface definition files, plus the scripts used to+control compilation and installation of the executable. However, as a+special exception, the source code distributed need not include+anything that is normally distributed (in either source or binary+form) with the major components (compiler, kernel, and so on) of the+operating system on which the executable runs, unless that component+itself accompanies the executable. - 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.+If distribution of executable or object code is made by offering+access to copy from a designated place, then offering equivalent+access to copy the source code from the same place counts as+distribution of the source code, even though third parties are not+compelled to copy the source along with the object code. - 11. Patents.+ 4. You may not copy, modify, sublicense, or distribute the Program+except as expressly provided under this License. Any attempt+otherwise to copy, modify, sublicense or distribute the Program is+void, and will automatically terminate your rights under this License.+However, parties who have received copies, or rights, from you under+this License will not have their licenses terminated so long as such+parties remain in full compliance. - 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".+ 5. You are not required to accept this License, since you have not+signed it. However, nothing else grants you permission to modify or+distribute the Program or its derivative works. These actions are+prohibited by law if you do not accept this License. Therefore, by+modifying or distributing the Program (or any work based on the+Program), you indicate your acceptance of this License to do so, and+all its terms and conditions for copying, distributing or modifying+the Program or works based on it. - 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+ 6. Each time you redistribute the Program (or any work based on the+Program), the recipient automatically receives a license from the+original licensor to copy, distribute or modify the Program subject to+these terms and conditions. You may not impose any further+restrictions on the recipients' exercise of the rights granted herein.+You are not responsible for enforcing compliance by third parties to 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+ 7. If, as a consequence of a court judgment or allegation of patent+infringement or for any other reason (not limited to patent issues),+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.+excuse you from the conditions of this License. If you cannot+distribute so as to satisfy simultaneously your obligations under this+License and any other pertinent obligations, then as a consequence you+may not distribute the Program at all. For example, if a patent+license would not permit royalty-free redistribution of the Program by+all those who receive copies directly or indirectly through you, then+the only way you could satisfy both it and this License would be to+refrain entirely from distribution of the Program. - 13. Use with the GNU Affero General Public License.+If any portion of this section is held invalid or unenforceable under+any particular circumstance, the balance of the section is intended to+apply and the section as a whole is intended to apply in other+circumstances. - 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.+It is not the purpose of this section to induce you to infringe any+patents or other property right claims or to contest validity of any+such claims; this section has the sole purpose of protecting the+integrity of the free software distribution system, which is+implemented by public license practices. Many people have made+generous contributions to the wide range of software distributed+through that system in reliance on consistent application of that+system; it is up to the author/donor to decide if he or she is willing+to distribute software through any other system and a licensee cannot+impose that choice. - 14. Revised Versions of this License.+This section is intended to make thoroughly clear what is believed to+be a consequence of the rest 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+ 8. If the distribution and/or use of the Program is restricted in+certain countries either by patents or by copyrighted interfaces, the+original copyright holder who places the Program under this License+may add an explicit geographical distribution limitation excluding+those countries, so that distribution is permitted only in or among+countries not thus excluded. In such case, this License incorporates+the limitation as if written in the body of this License.++ 9. The Free Software Foundation may publish revised and/or new versions+of the 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.+Each version is given a distinguishing version number. If the Program+specifies a version number of this License which applies to it and "any+later version", you have the option of following the terms and conditions+either of that version or of any later version published by the Free+Software Foundation. If the Program does not specify a version number of+this License, you may choose any version ever published by the Free Software+Foundation. - 16. Limitation of Liability.+ 10. If you wish to incorporate parts of the Program into other free+programs whose distribution conditions are different, write to the author+to ask for permission. For software which is copyrighted by the Free+Software Foundation, write to the Free Software Foundation; we sometimes+make exceptions for this. Our decision will be guided by the two goals+of preserving the free status of all derivatives of our free software and+of promoting the sharing and reuse of software generally. - 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.+ NO WARRANTY - 17. Interpretation of Sections 15 and 16.+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. - 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.+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR+REDISTRIBUTE 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. - END OF TERMS AND CONDITIONS+ END OF TERMS AND CONDITIONS - How to Apply These Terms to Your New Programs+ 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@@ -628,15 +287,15 @@ 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+convey 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+ 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+ the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful,@@ -644,31 +303,37 @@ 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 <https://www.gnu.org/licenses/>.+ You should have received a copy of the GNU General Public License along+ with this program; if not, write to the Free Software Foundation, Inc.,+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 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:+If the program is interactive, 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'.+ Gnomovision version 69, Copyright (C) year name of author+ Gnomovision 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".+parts of the General Public License. Of course, the commands you use may+be called something other than `show w' and `show c'; they could even be+mouse-clicks or menu items--whatever suits your program. - 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-<https://www.gnu.org/licenses/>.+You should also get your employer (if you work as a programmer) or your+school, if any, to sign a "copyright disclaimer" for the program, if+necessary. Here is a sample; alter the names: - 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-<https://www.gnu.org/licenses/why-not-lgpl.html>.+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program+ `Gnomovision' (which makes passes at compilers) written by James Hacker.++ <signature of Ty Coon>, 1 April 1989+ Ty Coon, President of Vice++This 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.
− Setup.hs
@@ -1,2 +0,0 @@-import Distribution.Simple-main = defaultMain
+ src/Control/IMonad.hs view
@@ -0,0 +1,16 @@+{-# LANGUAGE TypeFamilies #-}++module Control.IMonad where++import Data.Kind (Type)++class Return (m :: Type -> Type) where+ preturn :: a -> m a++class Bind (m :: Type -> Type) (m' :: Type -> Type) where+ type m :>>= m' :: Type -> Type+ (>>=.) :: m a -> (a -> m' b) -> (m :>>= m') b+ (>>.) :: m a -> m' b -> (m :>>= m') b+ m >>. f = m >>=. \_ -> f++class (Return m) => App m where {}
+ src/Language/AspectAG.hs view
@@ -0,0 +1,1222 @@+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE NoMonomorphismRestriction #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE IncoherentInstances #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE ImpredicativeTypes #-}+{-# LANGUAGE ExplicitForAll #-}+{-# LANGUAGE QuantifiedConstraints #-}+{-# LANGUAGE RebindableSyntax #-}+{-# LANGUAGE UndecidableSuperClasses #-}+++module Language.AspectAG where++import Prelude hiding ((>>), (>>=), return)+import Language.AspectAG.Types++import Data.GenRec (Rec(..), TagField(..), WrapField, UnWrap,+ OpLJoin(..), OpLookup(..), OpLeftProj(..),+ OpExtend(..), (.=.), (.//), (.*.),+ LabelsOf, Cmp)+import Data.Label (Label(..))++import Data.Kind+import Language.AspectAG.RecordInstances+import Data.Type.Require+import Data.Proxy+++import Control.IMonad++import Language.AspectAG.EADT++import Control.Monad.Reader++import Control.Monad qualified as M++import Data.Type.Equality+import Data.Type.Ord (Compare(..))++import Data.Type.Bool+import GHC.TypeLits+import Data.HList+import Data.GenRec.RecInstances.Record++-- | The data type 'Fam' stores a mapping from children to attributions,+-- and an attribution for the father.+data Fam (c :: [(ChildName, [(AttName, Type)])])+ (p :: [(AttName, Type)]) :: Type+ where+ Fam :: ChAttsRec c -> Attribution p -> Fam c p+++-- | The data type 'Rule' stores a mapping from an input family+-- (synthesized attributes of children, inherited from father) to the+-- output family (inherited to children, synthesized of father). It is+-- always related to a production 'prd'.+type Rule (prd :: (NTName,ProdName)) ip sc ic sp+ = Fam ip sc -> Fam ic sp++-- | The type family 'Ext' computes the constraints needed so+-- @Fam prd scsc' ipip' icic' spsp'@ ' is the result of combining+-- @Fam prd sc ip ic sp@ and @Fam prd sc' ip' ic' sp' @+type family Ext (prd :: (NTName, ProdName))+ (sc :: [(ChildName, [(AttName, Type)])])+ (ip :: [(AttName, Type)])+ (ic :: [(ChildName, [(AttName, Type)])])+ (sp :: [(AttName, Type)])+ (sc' :: [(ChildName, [(AttName, Type)])])+ (ip' :: [(AttName, Type)])+ (ic' :: [(ChildName, [(AttName, Type)])])+ (sp' :: [(AttName, Type)])+ (scsc' :: [(ChildName, [(AttName, Type)])])+ (ipip' :: [(AttName, Type)])+ (icic' :: [(ChildName, [(AttName, Type)])])+ (spsp' :: [(AttName, Type)])+ where+ Ext prd sc ip ic sp sc' ip' ic' sp' scsc' ipip' icic' spsp'+ = (ReqR (OpLeftProj AttReco (LabelsOf ip') ipip')+ ~ Rec AttReco ip',+ ReqR (OpLeftProj AttReco (LabelsOf ip) ipip') ~ Rec AttReco ip,+ ReqR (OpLJoin AttReco ip ip') ~ Rec AttReco ipip',+ ReqR (OpLJoin AttReco sp sp') ~ Rec AttReco spsp',+ ReqR (OpChiMerge ic ic') ~ Rec ChiReco icic',+ ReqR (OpChiMerge sc sc') ~ Rec ChiReco scsc',+ ProjChi scsc' sc', ProjChi scsc' sc,+ Require (OpLeftProj AttReco (LabelsOf ip') ipip') '[ ],+ Require (OpLeftProj AttReco (LabelsOf ip) ipip') '[ ],+ sp :|: sp',+ Require (OpChiMerge ic ic') '[])++-- | @ext@ combines two rules for the same production.+ext :: (Ext prd sc ip ic sp sc' ip' ic' sp' scsc' ipip' icic' spsp')+ => Rule prd sc ip ic sp+ -> Rule prd sc' ip' ic' sp'+ -> Rule prd scsc' ipip' icic' spsp'+ext (rule_1 :: Rule prd sc ip ic sp)+ (rule_2 :: Rule prd sc' ip' ic' sp') =+ \inp@(Fam (scv :: ReqR (OpChiMerge sc sc'))+ (ipv :: ReqR (OpLJoin AttReco ip ip')))+ -> let scv_1 = projChi (Proxy @sc) scv+ scv_2 = projChi (Proxy @sc') scv+ ipv_1 = Label @(LabelsOf ip) .// ipv+ ipv_2 = Label @(LabelsOf ip') .// ipv+ (Fam icv_1 spv) = rule_1 (Fam scv_1 ipv_1)+ (Fam icv_2 spv') = rule_2 (Fam scv_2 ipv_2)+ in (Fam (icv_1 .::><: icv_2) (spv .:>< spv'))++-- | operator version of ext+(.+.) :: Ext prd sc ip ic sp sc' ip' ic' sp' scsc' ipip' icic' spsp' =>+ CRule prd sc ip ic sp+ -> CRule prd sc' ip' ic' sp' -> CRule prd scsc' ipip' icic' spsp'+(CRule f) .+. (CRule g)+ = CRule (f `ext` g)++-- the following function merges child records.+-- it assumes children records have the same shape (same domain).+-- This should be controlled as a requirement.+-- We can generalize this function. it will be useful if we want to make+-- productions extensible.++++-- | builds an empty children record (i.e a record with one empty attribution+-- for non-terminals, and a singleton attribution for terminals) +class EmptyChiAtts prd (chs :: [(ChildName, GSym)]) where+ type ChiAtts (b :: Bool) prd chs :: [(ChildName, [(AttName, Type)])]+ emptyChiAtts :: Proxy chs -> Proxy prd -> Proxy b+ -> ChAttsRec (ChiAtts b prd chs)++class EmptyChiAttsNormal prd (chs :: [(ChildName, GSym)]) ipsp where+ type ChiAttsNormal (b :: Bool) prd chs + (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ :: [(ChildName, [(AttName, Type)])]+ emptyChiAttsNormal :: Proxy chs -> Proxy prd -> Proxy b -> Proxy ipsp+ -> ChAttsRec (ChiAttsNormal b prd chs ipsp)++instance EmptyChiAttsNormal prd '[] ipsp where+ type ChiAttsNormal b prd '[] ipsp = '[]+ emptyChiAttsNormal _ _ _ _ = EmptyRec++instance EmptyChiAtts prd '[] where+ type ChiAtts b prd '[]= '[]+ emptyChiAtts _ _ _ = EmptyRec+++-- | in case of a non-terminal, the empty child has an empty attribution+instance+ ( EmptyChiAtts prd chs)+ => EmptyChiAtts prd ( '(chi, 'NonTer nt) ': chs) where+ type ChiAtts b prd ( '(chi, 'NonTer nt) ': chs)+ = '(chi, '[]) ': ChiAtts b prd chs+ emptyChiAtts p q r = (Label .= emptyAtt)+ `ConsRec` (emptyChiAtts (pTail p) (Proxy @prd) r)+++instance+ ( EmptyChiAttsNormal prd chs ipsp)+ => EmptyChiAttsNormal prd ( '(chi, 'NonTer nt) ': chs) ipsp where+ type ChiAttsNormal b prd ( '(chi, 'NonTer nt) ': chs) ipsp+ = '(chi, If b (S nt ipsp) ('[])) ': ChiAttsNormal b prd chs ipsp+ emptyChiAttsNormal p q r s = (Label .= undefined)+ `ConsRec` (emptyChiAttsNormal (pTail p) q r s)++pTail :: Proxy (t ': ts) -> Proxy ts+pTail Proxy = Proxy++lTail :: Label (t ': ts) -> Label ts+lTail Label = Label++mkLabel :: l a -> Label a+mkLabel _ = Label++instance+ (EmptyChiAtts prd chs)+ => EmptyChiAtts prd ( '(chi, 'Ter t) ': chs) where+ type ChiAtts b prd ( '(chi, 'Ter t) ': chs)+ = '(chi, If b ('[ '("term", t)]) ('[])) ': ChiAtts b prd chs+ emptyChiAtts p q r+ = (Label .= undefined) `ConsRec` (emptyChiAtts (pTail p) (Proxy @prd) r)++instance+ (EmptyChiAttsNormal prd chs ipsp)+ => EmptyChiAttsNormal prd ( '(chi, 'Ter t) ': chs) ipsp where+ type ChiAttsNormal b prd ( '(chi, 'Ter t) ': chs) ipsp+ = '(chi, If b ('[ '("term", t)]) ('[])) ': ChiAttsNormal b prd chs ipsp+ emptyChiAttsNormal pChs pPrd pBool pIPSP+ = (Label .= undefined) `ConsRec`+ (emptyChiAttsNormal (pTail pChs) pPrd pBool pIPSP)++class+ EmptyChiAtts pnam (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam)+ =>+ EmptyRule (g :: Grammar) (nt :: NTName) (pnam :: ProdName) where+ emptyRule :: Label g -> Label (Prd pnam ('NT nt))+ -> CRule '(nt,pnam)+ (ChiAtts 'True pnam (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam))+ '[]+ (ChiAtts 'False pnam (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam))+ '[]++class+ EmptyRuleNormal (g :: Grammar) (nt :: NTName) (pnam :: ProdName)+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ where+ type EmptyRuleNormalR g nt pnam ipsp++ emptyRuleNormal :: Label g -> Label pnam -> Label nt -> Label ipsp+ -> EmptyRuleNormalR g nt pnam ipsp++instance EmptyChiAtts pnam (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam)+ =>+ EmptyRule (g :: Grammar) (nt :: NTName) (pnam :: ProdName) where+ emptyRule Label Label =+ let pr = Proxy @(GetTChildrenOfProd (GetTProdsOfNT g nt) pnam)+ in CRule $ \fam -> Fam (emptyChiAtts pr (Proxy @pnam) (Proxy @'False)) emptyAtt ++instance EmptyChiAttsNormal pnam+ (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam) ipsp+ =>+ EmptyRuleNormal (g :: Grammar) (nt :: NTName) (pnam :: ProdName) ipsp where+ type EmptyRuleNormalR g nt pnam ipsp =+ CRule '(nt, pnam)+ (ChiAttsNormal 'True pnam (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam) ipsp)+ (I nt ipsp)+ (ChiAttsNormal 'False pnam (GetTChildrenOfProd (GetTProdsOfNT g nt) pnam) ipsp)+ '[]+ emptyRuleNormal lG lPnam lNT lIPSP =+ let pr = Proxy @(GetTChildrenOfProd (GetTProdsOfNT g nt) pnam)+ in CRule $ \fam -> Fam (emptyChiAttsNormal pr (lp lPnam) (Proxy @'False)+ (lp lIPSP)) emptyAtt +--- hay que "proyectar" una regla: i e: +lp :: Label a -> Proxy a+lp Label = Proxy+++-- | Rules with context (used to print domain specific type errors).+ -- without tx now+newtype CRule (prd :: (NTName,ProdName)) sc ip ic sp+ = CRule { mkRule :: (Rule prd sc ip ic sp)}+++-- * Combinators to define rules ++-- | syndef builds a rule to compute a synthesized attribute @att@ at production @prd@+syndef (att :: Label ('Att att t))+ (prd :: Label ('Prd prd nt))+ f+ = CRule $ \inp+ -> Fam EmptyRec $ Label @att .=. (f inp) .*. EmptyRec++-- | syndef builds a rule to compute an inherited attribute @att@ at child+-- @ch@ of production @prd@+inhdef (att :: Label ('Att att t))+ (prd :: Label ('Prd prd nt))+ (ch :: Label ('Chi ch ('Prd prd nt) ntch))+ f+ = CRule $ \inp+ -> Fam (Label @ch .=. (Label @att .=. (f inp) .*. EmptyRec) .*. EmptyRec) EmptyRec+++-- | takes chis proxy+syndefC :: EmptyChiAtts prdn chs+ => Proxy chs+ -> Label ('Att att v)+ -> Label ('Prd prdn ('NT nt))+ -> (Fam sc ip -> v)+ -> CRule '(nt, prdn) sc ip (ChiAtts 'False prdn chs) '[ '(att, v)]+syndefC (p :: Proxy chs)+ (att :: Label ('Att att t))+ (prd :: Label ('Prd prdn ('NT nt)))+ f+ = CRule $ \inp+ -> Fam (emptyChiAtts p (Proxy @prdn) (Proxy @False))+ $ Label @att .=. (f inp) .*. emptyAtt+++++class Monad m => At pos att (ctx :: [ErrorMessage]) m+ | pos att ctx -> m where+ type ResAt pos att ctx m+ at :: Label pos -> Label att -> m (ResAt pos att ctx m)+++instance At ('Chi ch ('Prd prdnam nt) ('NonTer nt')) ('Att att t) ctx + (Reader (Fam '[ '(ch, '[ '(att,t)])] '[]))+ where+ type ResAt ('Chi ch ('Prd prdnam nt) ('NonTer nt')) ('Att att t) ctx+ (Reader (Fam '[ '(ch, '[ '(att,t)])] '[]))+ = ReqR (OpLookup AttReco att+ (UnWrap @AttName @Type+ (ReqR (OpLookup ChiReco ch+ '[ '(ch, '[ '(att,t)])] ))))+ at (ch :: Label ('Chi ch ('Prd prdnam nt) ('NonTer nt')))+ (att :: Label ('Att att t)) =+ M.liftM (\(Fam chi _)+ -> let atts = req Proxy (OpLookup (Label @ch) chi)+ in req Proxy (OpLookup (Label @att) atts))+ ask++def = runReader++data LHS = LHS+lhs = Label @LHS++-- ter = undefined+ter :: Label ('Chi ch ('Prd prdnam nt) ('Ter t))+ -> (Reader (Fam '[ '(ch, '[ '("term", t)] )] '[])) t+ter (Label :: Label ('Chi ch ('Prd prdnam nt) ('Ter t)))+ = M.liftM (\(Fam chi _)+ -> req Proxy (OpLookup (Label @"term") (req Proxy (OpLookup (Label @ch) chi)))) ask++instance At LHS ('Att att t) ctx+ (Reader (Fam '[] '[ '(att, t)]))+ where+ type ResAt LHS ('Att att t) ctx+ (Reader (Fam '[] '[ '(att, t)]))+ = ReqR (OpLookup AttReco att '[ '(att, t)])+ at (Label :: Label LHS) (att :: Label ('Att att t))=+ M.liftM (\(Fam _ par) -> req Proxy (OpLookup (Label @att) par)) ask++syndefM ::+ (RequireEq t t' '[])+ => Label ('Att att t')+ -> Label ('Prd prd ('NT nt))+ -> Reader (Fam sc ip) t+ -> CRule '(nt, prd) sc ip '[] '[ '(att, t)]+syndefM att prd f+ = (syndef att prd . runReader) f++syndefMI ::+ forall att prd nt t sc ip.+ Reader (Fam sc ip) t+ -> CRule '(nt, prd) sc ip '[] '[ '(att, t)]+syndefMI = syndefM Label Label++inhdefM+ :: Label ('Att att t)+ -> Label ('Prd prd ('NT nt))+ -> Label ('Chi ch ('Prd prd ('NT nt)) ntch)+ -> Reader (Fam sc ip) v+ -> CRule '(nt, prd) sc ip '[ '(ch, '[ '(att, v)])] '[]+inhdefM att prd ch f+ = (inhdef att prd ch . runReader) f+++++instance Return (Reader (Fam sc ip)) where+ preturn a = M.return a -- we know it is a monad!+++-- annoying but neccesary, otherwise the last monad of a chain of >>=.+-- cannot be inferred (therefore any), perhaps there is a way... +ret = preturn @(Reader (Fam '[] '[]))+++instance+ ( ip :|: ip'+ , ProjChiOp (OpChiMerge sc sc') sc+ , ProjChiOp (OpChiMerge sc sc') sc'+ )+ =>+ Bind (Reader (Fam sc ip))+ (Reader (Fam sc' ip')) where+ type (Reader (Fam sc ip))+ :>>=+ (Reader (Fam sc' ip'))+ = (Reader (Fam (UnWrap (ReqR (OpChiMerge sc sc')))+ (UnWrap (ReqR (OpLJoin AttReco ip ip')))+ ))+ m >>=. f = reader $ \inp+ -> let (Fam scsc' ipip') = inp+ inp1 = Fam (projChi(Proxy @sc) scsc')+ ((Label @(LabelsOf ip).// ipip') :: Attribution ip)+ inp2 = Fam (projChi(Proxy @sc') scsc')+ ((Label @(LabelsOf ip').// ipip') :: Attribution ip')+ in runReader (f (runReader m inp1)) inp2+++-- | Aspects, tagged with context. 'Aspect' is a record instance having+-- productions as labels, containing 'Rule's as fields.+newtype CAspect (asp :: [((NTName,ProdName), Type)] )+ = CAspect { mkAspect :: Aspect asp}++-- | Recall that Aspects are mappings from productions to rules. They+-- have a record-like interface to build them. This is the constructor+-- for the empty Aspect.+emptyAspect :: CAspect '[]+emptyAspect = CAspect $ EmptyRec++-- | combination of two Aspects. It merges them. When both aspects+-- have rules for a given production, in the resulting Aspect the rule+-- at that field is the combination of the rules for the arguments+-- (with 'ext').+comAspect ::+ ( Require (OpComAsp al ar) '[]+ , ReqR (OpComAsp al ar) ~ Aspect asp+ )+ => CAspect al -> CAspect ar -> CAspect asp+comAspect al ar+ = CAspect $ req (Proxy @'[]) (OpComAsp (mkAspect al) (mkAspect ar))+++-- | add rule to an aspect+data OpComAsp (al :: [((NTName, ProdName), Type)])+ (ar :: [((NTName, ProdName), Type)]) where+ OpComAsp :: Aspect al -> Aspect ar -> OpComAsp al ar++instance+ Require (OpComAsp '[] ar) ctx where+ type ReqR (OpComAsp '[] ar) = Aspect ar+ req ctx (OpComAsp _ ar) = ar++instance+ ( (ReqR (OpComRA prd (CRule prd sc ip ic sp) ar))+ ~ (Rec PrdReco+ (UnWrap+ (ReqR (OpComRA prd (CRule prd sc ip ic sp) ar))))+ , ReqR (OpComRA prd (CRule prd sc ip ic sp) ar)+ ~ Rec PrdReco ar0+ , (Require (OpComAsp al ar0) ctx)+ , (Require+ (OpComRA prd (CRule prd sc ip ic sp) ar) ctx)+ ) =>+ Require (OpComAsp+ ('(prd, CRule prd sc ip ic sp) ': al) ar) ctx where+ type ReqR (OpComAsp ('(prd, CRule prd sc ip ic sp) ': al) ar) =+ ReqR (OpComAsp al+ (UnWrap (ReqR+ (OpComRA prd (CRule prd sc ip ic sp) ar))))+ req ctx (OpComAsp (ConsRec (TagField _ _ rul) al) ar)+ = req ctx (OpComAsp al (req ctx (OpComRA rul ar)))++type family IC (rule :: Type) where+ IC (CRule prd sc ip ic sp) = ic+-- IC (Rule prd sc ip ic sp) = ic+type family SP (rule :: Type) where+ SP (CRule prd sc ip ic sp) = sp+-- SP (Rule prd sc ip ic sp) = sp+type family SC (rule :: Type) where+ SC (CRule prd sc ip ic sp) = sc+-- SC (Rule prd sc ip ic sp) = sc+type family IP (rule :: Type) where+ IP (CRule prd sc ip ic sp) = ip+-- IP (Rule prd sc ip ic sp) = ip+++-- | combine a rule with an aspect (wrapper)+data OpComRA (prd :: (NTName, ProdName))+ (rule :: Type) -- TODO : doc this+ (a :: [((NTName, ProdName), Type)]) where+ OpComRA :: CRule prd sc ip ic sp+ -> Aspect a -> OpComRA prd (CRule prd sc ip ic sp) a++-- | combine a rule with an aspect (inner)+data OpComRA' (cmp :: Ordering)+ (prd :: (NTName, ProdName))+ (rule :: Type) -- TODO : doc this+ (a :: [((NTName, ProdName), Type)]) where+ OpComRA' :: Proxy cmp+ -> CRule prd sc ip ic sp+ -> Aspect a+ -> OpComRA' cmp prd (CRule prd sc ip ic sp) a++type instance (WrapField PrdReco (CRule prd sc ip ic sp))+ = CRule prd sc ip ic sp+type instance (WrapField PrdReco rule)+ = rule++instance Require (OpComRA prd rule '[]) ctx where+ type ReqR (OpComRA prd rule '[])+ = Aspect '[ '(prd, rule)]+ req ctx (OpComRA rule _) = ConsRec ((Label @prd) .=. rule) EmptyRec++instance+ (Require (OpComRA' (Cmp prd prd') prd+ (CRule prd sc ip ic sp)+ ( '(prd', rul) ': a)) ctx)+ =>+ Require (OpComRA prd (CRule prd sc ip ic sp)+ ( '(prd', rul) ': a)) ctx where+ type ReqR (OpComRA prd (CRule prd sc ip ic sp)+ ( '(prd', rul) ': a))+ = ReqR (OpComRA' (Cmp prd prd') prd (CRule prd sc ip ic sp)+ ( '(prd', rul) ': a))+ req ctx (OpComRA rule a)+ = req ctx (OpComRA' (Proxy @(Cmp prd prd'))rule a)++instance Require (OpComRA' 'LT prd (CRule prd sc ip ic sp)+ a) ctx where+ type ReqR (OpComRA' 'LT prd (CRule prd sc ip ic sp) a)+ = Aspect ( '(prd, CRule prd sc ip ic sp) ': a)+ req ctx (OpComRA' _ rule asp)+ = (Label @prd .=. rule) `ConsRec` asp++instance+ ( Require (OpComRA prd rule a) ctx+ , ReqR (OpComRA prd rule a)+ ~ Rec PrdReco (UnWrap @(NTName, ProdName) @Type (ReqR+ (OpComRA prd rule + (a))))+ )+ =>+ Require (OpComRA' 'GT prd rule+ ( '(prd', rule') ': a)) ctx where+ type ReqR (OpComRA' 'GT prd rule+ ( '(prd', rule') ': a))+ = Aspect ( '(prd', rule') ': (UnWrap @(NTName, ProdName)+ (ReqR (OpComRA prd rule+ (a)))))+ req ctx (OpComRA' p rule (ConsRec tgrule' asp))+ = tgrule' `ConsRec` (req ctx (OpComRA rule asp))++-- TODO: Do not allow mods+instance+ ( Ext prd sc ip ic sp sc' ip' ic' sp' scsc' ipip' icic' spsp'+ , scsc' ~ (UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge sc sc')))+ , ipip' ~ (UnWrap @AttName (ReqR (OpLJoin AttReco ip ip')))+ , icic' ~ (UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge ic ic')))+ , spsp' ~ (UnWrap @AttName (ReqR (OpLJoin AttReco sp sp')))+ )+ => Require (OpComRA' 'EQ prd+ (CRule prd sc ip ic sp)+ ( '(prd, CRule prd sc' ip' ic' sp') ': a)) ctx where+ type ReqR (OpComRA' 'EQ prd+ (CRule prd sc ip ic sp)+ ( '(prd, CRule prd sc' ip' ic' sp') ': a))+ = Aspect ( '(prd, CRule prd+ {-scsc'-} (UnWrap @ChildName @[(ProdName, Type)]+ (ReqR (OpChiMerge sc sc')))+ {-ipip'-} (UnWrap @AttName (ReqR (OpLJoin AttReco ip ip')))+ {-icic'-} (UnWrap @ChildName @[(ProdName,Type)]+ (ReqR (OpChiMerge ic ic')))+ {-spsp'-} (UnWrap @AttName (ReqR (OpLJoin AttReco sp sp')))+ ) ': a)+ req ctx (OpComRA' p rulef (ConsRec (TagField c l ruleg)+ (asp :: Aspect a)))+ = (TagField c l $ rulef .+. ruleg)+ `ConsRec` asp+++extAspect+ :: ExtAspect prd sc ip ic sp a asp =>+ CRule prd sc ip ic sp+ -> CAspect a -> CAspect asp+extAspect rule (CAspect fasp)+ = CAspect $ req (Proxy @'[]) (OpComRA rule (fasp))++type ExtAspect prd sc ip ic sp a asp+ = (Require+ (OpComRA prd (CRule prd sc ip ic sp) a) '[],+ ReqR (OpComRA prd (CRule prd sc ip ic sp) a)+ ~ Rec PrdReco asp) ++-- | An operator, alias for 'extAspect'. It combines a rule with an+-- aspect, to build a bigger one.++(.+:)+ :: (RequireR (OpComRA prd (CRule prd sc ip ic sp) a)+ (Rec PrdReco asp) '[]+ ) =>+ CRule prd sc ip ic sp -> CAspect a -> CAspect asp+(.+:) = extAspect+infixr 3 .+:++-- | Unicode version of 'extAspect' or '.+:' (\\triangleleft)+(◃) = extAspect+infixr 3 ◃++-- | The other way, combines an aspect with a rule. It is a `flip`ped+-- 'extAspect'.+(.:+.) = flip extAspect+infixl 3 .:+.++-- | Unicode operator for '.:+.' or `flip extAspect`.+(▹) = flip extAspect+infixl 3 ▹+++-- | Operator for 'comAspect'. It takes two 'CAspect's to build the+-- combination of both.+(.:+:) = comAspect+infixr 4 .:+:++-- | Unicode operator for 'comAspect' or '.:+:'. (\\bowtie)+(⋈) = comAspect+infixr 4 ⋈+++-- rebinding syntax+(>>=) = (>>=.)+(>>) = (>>.)+return = ret+++class EmptyAspect (g :: Grammar) where+ type EmptyAspectR (g :: Grammar) :: [((NTName, ProdName), Type)]+ emptyAspectFromGrammar :: Label g -> CAspect (EmptyAspectR g)+++instance EmptyAspect ('Grammar '[]) where+ type EmptyAspectR ('Grammar '[]) = '[]+ emptyAspectFromGrammar Label = emptyAspect++instance+ EmptyAspect ('Grammar nts)+ =>+ EmptyAspect ('Grammar ( '(nt, '[]) ': nts)) where+ type EmptyAspectR ('Grammar ( '(nt, '[]) ': nts )) =+ EmptyAspectR ('Grammar nts)+ emptyAspectFromGrammar Label+ = emptyAspectFromGrammar (Label @('Grammar nts))++instance+ ( RequireR+ (OpComRA ntprd+ (CRule ntprd+ (ChiAtts 'True prd (GetTChildrenOfProd ('(prd, chis) : prds) prd))+ '[]+ (ChiAtts 'False prd (GetTChildrenOfProd ('(prd, chis) : prds) prd))+ '[])+ (EmptyAspectR ('Grammar ( '(nt, prds) ': nts)))+ )+ (Rec PrdReco+ (UnWrap @(NTName, ProdName) @Type+ (ReqR (OpComRA ntprd+ (CRule ntprd+ (ChiAtts 'True prd (GetTChildrenOfProd ('(prd, chis) : prds) prd))+ '[]+ (ChiAtts 'False prd (GetTChildrenOfProd ('(prd, chis) : prds) prd))+ '[])+ (EmptyAspectR ('Grammar ( '(nt, prds) ': nts))))))+ ) '[]+ , ntprd ~ '(nt,prd)+ , EmptyAspect ('Grammar ( '(nt, prds) ': nts))+ , EmptyRule ('Grammar ( '(nt, '(prd, chis) ': prds) ': nts)) nt prd+ )+ => + EmptyAspect ('Grammar ( '(nt, '(prd, chis) ': prds) ': nts)) where+ type EmptyAspectR+ ('Grammar ( '(nt, '(prd, chis) ': prds) ': nts)) =+ UnWrap+ (ReqR (OpComRA '(nt, prd)+ (CRule '(nt, prd)+ (ChiAtts 'True prd (GetTChildrenOfProd ('(prd, chis) : prds) prd))+ '[]+ (ChiAtts 'False prd (GetTChildrenOfProd ('(prd, chis) : prds) prd))+ '[])+ (EmptyAspectR ('Grammar ( '(nt, prds) ': nts )))))+ emptyAspectFromGrammar lgram+ = (emptyRule lgram (Label @(Prd prd ('NT nt))))+ .+: emptyAspectFromGrammar (Label @('Grammar ( '(nt, prds) ': nts)))++emptyAspG = emptyAspectFromGrammar+ +att :: forall (name :: AttName) (ty :: Type) . Label ('Att name ty)+att = Label++prd :: forall (g :: Grammar) (prd :: ProdName) .+ (ProdG g prd) => --the way it is implemented requires both args instantiated+ Label ('Prd prd (NTOfProd g prd))+prd = Label++++chi :: forall (g :: Grammar) (chi :: ChildName) .+ MemChiGram g chi ~ 'True => Label (GetChildL g chi)+chi = Label++class Kn (fcr :: [(ChildName, Type)]) where+ type ICh fcr :: [(ChildName, [(AttName, Type)])]+ type SCh fcr :: [(ChildName, [(AttName, Type)])]+ kn :: Record fcr -> ChAttsRec (ICh fcr) -> ChAttsRec (SCh fcr)++instance Kn '[] where+ type ICh '[] = '[]+ type SCh '[] = '[] + kn _ _ = emptyCh++instance+ Kn fc+ =>+ Kn ( '(lch , Attribution ich -> Attribution sch) ': fc) where+ type ICh ( '(lch , Attribution ich -> Attribution sch) ': fc)+ = '(lch , ich) ': ICh fc+ type SCh ( '(lch , Attribution ich -> Attribution sch) ': fc)+ = '(lch , sch) ': SCh fc+ kn ((ConsRec (TagField _ lch fch) (fcr :: Record fc)))+ = \((ConsRec (TagField _ _ ich) icr)+ :: ChAttsRec ( '(lch, ich) ': ICh fc))+ -> let scr = kn fcr icr+ in ConsRec (TaggedChAttr lch+ (fch ich)) scr++knit ::+ Kn (fc :: [(ChildName, Type)])+ => Proxy ctx+ -> CRule prd (SCh fc) ip (ICh fc) sp+ -> Record fc+ -> Attribution ip+ -> Attribution sp+knit ctx rule fc ip+ = let (Fam ic sp) = mkRule rule (Fam sc ip)+ sc = kn fc ic+ in sp++-- building the argument of knit+class FC (g :: Grammar) (chis :: [(ChildName, GSym)])+ (prd :: ProdName)+ asp+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ where+ type BuildFC g chis prd asp ipsp :: [(ChildName, Type)]+ buildFC :: Label g -> Label chis -> Label prd -> Label ipsp+ -> CAspect asp+ -> HList (ChList2HList g chis)+ -> Record (BuildFC g chis prd asp ipsp)++instance FC g '[] prd asp ipsp where+ type BuildFC g '[] prd asp ipsp = '[]+ buildFC Label Label Label Label asp HNil = emptyRecord++instance+ ( FC g chis prd asp ipsp+ , ReqR (OpExtend @ChildName @Type Reco chnam+ (Attribution '[] -> Attribution '[ '("term", t)])+ (BuildFC g chis prd asp ipsp))+ ~ Rec @Type @ChildName @Type Reco+ ( '(chnam, Attribution '[] -> Attribution '[ '("term", t)])+ ': (BuildFC g chis prd asp ipsp))+ , ChList2HList g ('(chnam, 'Ter t) : chis)+ ~ (t : xs) + )+ =>+ FC g ( '(chnam, 'Ter t) ': chis) prd asp ipsp where+ type BuildFC g ( '(chnam, 'Ter t) ': chis) prd asp ipsp+ = '(chnam, Attribution '[] -> Attribution '[ '("term", t)])+ ': BuildFC g chis prd asp ipsp+ buildFC prG pChis pprd p asp (HCons x xs)+ = (Label @chnam .=. sem_Lit x) `ConsRec`+ buildFC @g @_+ prG (lTail pChis) pprd p asp xs++instance+ ( FC g chis prd r a+ , SemAG' g a r nt (I nt a)(S nt a)+ , GetChildL g chnam ~ Chi chnam ('Prd prdch nt2) nt1 + )+ =>+ FC g ( '(chnam, 'NonTer nt) ': chis) prd r a where+ type BuildFC g ( '(chnam, 'NonTer nt) ': chis) prd r a+ = '(chnam, Attribution (I nt a)+ -> Attribution (S nt a))+ ': BuildFC g chis prd r a+ buildFC prG pChis pPrd pIPSP asp (HCons x xs)+ = (Label @chnam .=. semAG' pIPSP asp x)+ `ConsRec` buildFC prG (lTail pChis) pPrd pIPSP asp xs+ +-- | Semantic functions++class SemLit a where+ sem_Lit :: a -> Attribution ('[] :: [(AttName,Type)])+ -> Attribution '[ '("term", a)]+ lit :: Label ('Att "term" a)+instance SemLit a where+ sem_Lit a _ = (Label =. a) *. emptyAtt+ lit = Label @('Att "term" a)++-- | The function 'sem' is the semantic function for an AG (g, ipsps, asp).+-- (corresponding to (G,A,R) in the usual definition).++type AttrTy = [(AttName, Type)]+type AttrCol = [(NTName, AttrTy, AttrTy)]+class SemAG' (g :: Grammar) (a :: AttrCol) r (nt :: NTName) ip sp where+ semAG' :: Label a -> CAspect r -> EADT g nt + -> Attribution ip -> Attribution sp++class SemAGPrds (prds :: [(ProdName, [(ChildName, GSym)])])+ (g :: Grammar) (a :: AttrCol) r (nt :: NTName) ip sp+ where+ semAGPrds :: Label prds -> Label a -> CAspect r -> EADT g nt+ -> Attribution ip -> Attribution sp++instance+ SemAGPrds (GetTProdsOfNT g nt) g a r nt ip sp+ =>+ SemAG' g a r nt ip sp where+ semAG' p asp v = semAGPrds (Label @(GetTProdsOfNT g nt)) p asp v++instance+ (KnownSymbol prd+ , ChList2HList g (GetTChildrenOfProd (GetTProdsOfNT g nt) prd)+ ~ ChList2HList g chis+ , RequireR (OpLookup PrdReco '(nt, prd) r)+ (CRule '(nt, prd)+ (SCh (BuildFC g chis prd r a))+ ip+ (ICh (BuildFC g chis prd r a))+ sp) '[]+ , FC g chis prd r a+ , Kn (BuildFC g chis prd r a)+ )+ => SemAGPrds '[ '(prd, chis)] g a r nt ip sp+ where+ semAGPrds lprds lipsp asp (Variant (lprd :: SSymbol prd') args)+ = case sameSymbol lprd (symbolSing @prd) of+ Just p@Refl -> knitAspect (Label @'(nt, prd)) asp+ (buildFC (Label @g) (Label @chis)+ (Label @prd) (Label @a) asp args)+ _ -> error "impossible"++instance+ ( ChList2HList g (GetTChildrenOfProd (GetTProdsOfNT g nt) prd)+ ~ ChList2HList g chis+ , (GetTChildrenOfProd (GetTProdsOfNT g nt) prd) ~ chis+ , KnownSymbol prd+ , RequireR (OpLeftProj AttReco (LabelsOf (I nt ipsp)) ip)+ (Rec AttReco (I nt ipsp)) '[]+ , RequireR (OpLookup PrdReco '(nt,prd) asp)+ (CRule '(nt, prd)+ (SCh (BuildFC g chis prd asp ipsp))+ (I nt ipsp)+ (ICh (BuildFC g chis prd asp ipsp))+ (SP (Lookup1 nt asp)))+ '[]+ , FC g chis prd asp ipsp+ , Kn (BuildFC g chis prd asp ipsp)+ , SemAGPrds prds g ipsp asp nt ip sp+ , IP (Lookup1 nt asp) ~ I nt ipsp+ , SP (Lookup1 nt asp) ~ S nt ipsp+ , S nt ipsp ~ sp+ , I nt ipsp ~ ip+ )+ =>+ SemAGPrds ( '(prd, chis) ': prds) g ipsp asp nt ip sp where+ semAGPrds pprds pipsp asp v@(Variant (lprd :: SSymbol prd') args)+ = case sameSymbol lprd (symbolSing @prd) of+ Just p@Refl -> knitAspect (Label @('(nt,prd))) asp+ (buildFC (Label @g) (Label @chis)+ (Label @prd) (Label @ipsp) asp args)+ Nothing -> semAGPrds (lTail pprds) pipsp asp v++-- exported++type family SemAG g a r nt ip sp where+ SemAG g a r nt ip sp = ( SemAG' g a (NormalizeAspR g r a) nt ip sp+ , NormalizeAsp g r a )++semAG ::+ ( SemAG g a r nt ip sp+ , Check g a (NormalizeAspR g r a)+ )+ => Label a -> CAspect r -> EADT g nt+ -> Attribution ip -> Attribution sp+semAG a r (e :: EADT g nt) = semAG' a (normalizeAsp (Label @g) r a) e++type Sem :: Grammar+ -> [((NTName, ProdName), Type)]+ -> NTName+ -> [(AttName, Type)]+ -> [(AttName, Type)]+ -> Constraint++type family Sem g r nt ip sp++type instance Sem g r nt ip sp+ = ( SemAG g (Infer g r) r nt ip sp+ , Check g (Infer g r) (NormalizeAspR g r (Infer g r)))+-- TODO: es mas elegante asi pero recomputamos Infer,+-- debería ser más eficiente agregar estas constraints a sem:+-- ( SemAG g a r nt ip sp+-- , Check g a (NormalizeAspR g r a)+-- , a ~ Infer g r)+--+-- se puede mejorar tambien con una tf intermedia,+-- igual no sabemos como va a decidir reducirse la tf...+-- | Semantic function, inferring the attribute occurrences @a@+sem :: Sem g r nt ip sp+ => CAspect r -> EADT g nt+ -> Attribution ip -> Attribution sp+sem (r :: CAspect r) (e :: EADT g nt) = semAG (Label @(Infer g r)) r e++knitAspect ::+ (RequireR (OpLookup PrdReco ntprd asp)+ (CRule ntprd (SCh fc)+ ip (ICh fc)+ sp) '[]+ , Kn fc+ , ntprd ~ '(nt, prd)+ )+ => Label ntprd+ -> CAspect asp+ -> Record fc+ -> Attribution ip+ -> Attribution sp+knitAspect (prd :: Label ntprd) asp fc ip+ = let ctx = Proxy @'[]+ in let rul = req ctx (OpLookup prd (mkAspect asp))+ in knit ctx rul fc ip+-- | given a non-terminal 'nt' and an attribute declaration 'ipsp',+-- gets the inherited attributes+type family I + (nt :: NTName)+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ :: [(AttName, Type)]+ where+ I nt ( '(nt, ip, sp) ': ipsps ) = ip+ I nt ( _ ': ipsps ) = I nt ipsps+ I nt '[] = '[] -- cuidado++type family S+ (nt :: NTName)+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ :: [(AttName, Type)]+ where+ S nt ( '(nt, ip, sp) ': ipsps ) = sp+ S nt ( _ ': ipsps ) = S nt ipsps+ S nt '[] = '[]++class NormalizeAsp (g :: Grammar) asp+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ where+ type NormalizeAspR g asp ipsp :: [((NTName, ProdName), Type)]+ normalizeAsp :: Label g -> CAspect asp -> Label ipsp+ -> CAspect (NormalizeAspR g asp ipsp)++instance NormalizeAsp g '[] ipsp where+ type NormalizeAspR g '[] ipsp = '[]+ normalizeAsp g asp ipsp = asp++instance+ ( NormalizeAsp g asp ipsp+ , NormalizeRule g prd nt (CRule '(nt, prd) sc ip ic sp) ipsp+ )+ => NormalizeAsp g ( '( '(nt, prd) , CRule '(nt, prd) sc ip ic sp) ': asp) ipsp+ where+ type NormalizeAspR g ( '( '(nt, prd) , CRule '(nt, prd) sc ip ic sp) ': asp) ipsp+ = '( '(nt, prd) , NormalizeRuleR g prd nt (CRule '(nt, prd) sc ip ic sp) ipsp)+ ': NormalizeAspR g asp ipsp+ normalizeAsp lG (CAspect (ConsRec (TagField (c@Label) l r) asp)) lIPSP+ = CAspect $ (ConsRec (TagField c l+ (normalizeRule lG (Label @prd) (Label @nt) r lIPSP))+ (mkAspect $ normalizeAsp lG (CAspect asp) lIPSP))++class NormalizeRule (g :: Grammar)+ (prd :: ProdName)+ (nt :: NTName)+ (rule :: Type)+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ where+ type NormalizeRuleR g prd nt rule ipsp :: Type+ normalizeRule :: Label g -> Label prd -> Label nt-> rule -> Label ipsp+ -> NormalizeRuleR g prd nt rule ipsp++instance+ ( EmptyRuleNormal g nt prd ipsp+ , ReqR (OpChiMerge sc (SC (EmptyRuleNormalR g nt prd ipsp)))+ ~ Rec ChiReco scsc'+ , Ext '(prd, nt) sc ip ic sp+ (SC (EmptyRuleNormalR g nt prd ipsp))+ (IP (EmptyRuleNormalR g nt prd ipsp))+ (IC (EmptyRuleNormalR g nt prd ipsp))+ (SP (EmptyRuleNormalR g nt prd ipsp))+ scsc' ipip' ic sp+ , ReqR (OpLeftProj AttReco (LabelsOf (I nt ipsp)) ipip')+ ~ Rec AttReco (I nt ipsp)+ , ReqR (OpLJoin AttReco ip (I nt ipsp)) ~ Rec AttReco ipip'+ , Require (OpLJoin AttReco sp '[]) '[]+ , ReqR (OpLJoin AttReco sp '[]) ~ Rec AttReco sp+ , ReqR (OpChiMerge ic (ChiAttsNormal False prd+ (GetTChildrenOfProd' (GetTProdsOfNT g nt)+ (GetTProdsOfNT g nt) prd) ipsp))+ ~ Rec ChiReco ic+ , EmptyChiAttsNormal prd+ (GetTChildrenOfProd' (GetTProdsOfNT g nt) (GetTProdsOfNT g nt) prd)+ ipsp+ )+ => NormalizeRule g prd nt (CRule '(nt, prd) sc ip ic sp) ipsp where+ type NormalizeRuleR g prd nt (CRule '(nt, prd) sc ip ic sp) ipsp+ = CRule '(nt, prd)+ (UnWrap @ChildName+ (ReqR (OpChiMerge sc (SC (EmptyRuleNormalR g nt prd ipsp)))))+ (UnWrap (ReqR (OpLJoin AttReco ip (IP (EmptyRuleNormalR g nt prd ipsp)))))+ ic sp+ normalizeRule lG lPrd lNt rule lIPSP+ = rule .+. (emptyRuleNormal lG lPrd lNt lIPSP)++-- infers ipsps from aspect, grammar is used to watch nts+type family Infer+ (g :: Grammar)+ (asp :: [((NTName, ProdName), Type)])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ Infer g '[] = '[]+ Infer g ( '( '(nt, prd), CRule '(nt, prd) sc ip ic sp) ': nts)+ = CombineIPSPList '[ '[ '(nt, ip , sp)] ,+ -- cada ocurrencia fuerza la aparicion en todos, esto se puede cambiar+ InferSC g sc,+ Infer g nts ]++-- computes synthesized atts from the input fam+-- to avoid +type family InferSC+ (g :: Grammar)+ (sc :: [(ChildName,[(AttName, Type)])])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ InferSC g '[] = '[]+ InferSC g ( '(chi, atts) ': chis)+ = InferSCDec (GetNTChi (GetChildL g chi))+ g ( '(chi, atts) ': chis)+type family InferSCDec+ (b :: Maybe NTName)+ (g :: Grammar)+ (sc :: [(ChildName,[(AttName, Type)])])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ InferSCDec ('Just nt) g ( '(chi, atts) ': chis)+ = (CombineIPSPList+ '[ '[ '(nt, '[], atts)]+ , InferSC g chis])+ InferSCDec 'Nothing g ( '(chi, atts) ': chis)+ = InferSC g chis+++type family Check+ (g :: Grammar)+ (ipsps :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ (asp :: [((NTName, ProdName), Type)])+ :: Constraint where+ Check g ipsps asp = ToConstraint (CheckErrors g ipsps asp)+type family ToConstraint (e :: [ErrorMessage]) :: Constraint where+ ToConstraint '[] = ()+ ToConstraint (e ': es) = (TypeError e, ToConstraint es)++type family CheckErrors+ (g :: Grammar)+ (ipsps :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ (asp :: [((NTName, ProdName), Type)])+ :: [ErrorMessage]+ where+ CheckErrors g ipsps '[] = '[]+ CheckErrors g ipsps+ ( '( '(nt, prd), CRule '(nt, prd) sc ip ic sp) ': asp) =+ CheckIP g ipsps nt prd ip+ :++ CheckSC g ipsps nt prd sc+ -- ^ con estas hay que mirar que no se requieran args extra, TODO+ :++ CheckSP g ipsps nt prd sp -- por lo menos los atts en ipsps+ :++ CheckIC g ipsps nt prd ic -- lo mismo aca+ :++ CheckErrors g ipsps asp ++type family CheckIP g ipsps nt prd ip where+ CheckIP g ipsps nt prd ip+ = If (SubsetAtt ip (I nt ipsps)) '[]+ '[Text ("error:\n\+ \ Rule for production " :+ WrapQuotes prd+ :+ " of non-terminal " :+ WrapQuotes nt :++ "\n requires inherited attributes: ")+ :$$: ShowAsp ip+ :$$: Text+ "but it should require \+ \a subset of:"+ :$$: ShowAsp (I nt ipsps)]++type family CheckSP g ipsps nt prd sp where+ CheckSP g ipsps nt prd sp+ = If (SubsetAtt (S nt ipsps) sp) '[]+ '[Text ("error:\n\+ \ Rule for production " :+ WrapQuotes prd+ :+ " of non-terminal " :+ WrapQuotes nt :++ "\n computes synthesized attributes: ")+ :$$: ShowAsp sp+ :$$: Text+ "but from the full aspect type it is inferred it should compute:"+ :$$: ShowAsp (S nt ipsps)]+ +type family WrapQuotes (t :: Symbol) where+ WrapQuotes t = "\"" :+ t :+ "\""+type family ShowAsp asp :: ErrorMessage where+ ShowAsp asp = Text "\t" :<>: ShowType asp++type family CheckIC g ipsps nt prd ic where+ CheckIC g ipsps nt prd '[] = '[]+ CheckIC g ipsps nt prd ( '(chnam, att) ': chis)+ = CheckIC' g ipsps nt prd chnam att (GetGSymChildL (GetChildL g chnam))+ :++ CheckIC g ipsps nt prd chis+type family CheckIC' g ipsps nt prd chnam att gsym where+ CheckIC' g ipsps nt prd chnam att gsym+ = CheckIC'' g ipsps nt prd chnam att (IsNonTer gsym) gsym+type family CheckIC'' g ipsps nt prd chnam att b gsym where+ CheckIC'' g ipsps nt prd chnam att 'False gsym = '[]+ CheckIC'' g ipsps nt prd chnam att 'True ('NonTer ntch)+ = If (SubsetAtt (I ntch ipsps) att) '[]+ '[Text ("error:\n\+ \ Semantics for production " :+ WrapQuotes prd+ :+ " of non-terminal " :+ WrapQuotes nt+ :+ " at children " :+ WrapQuotes chnam+ :+ "\n define in the following inherited attributes: ")+ :$$: ShowAsp att+ :$$: Text+ "but from the full aspect type it is inferred the following are needed:"+ :$$: ShowAsp (I nt ipsps)]++type family CheckSC g ipsps nt prd sc where+ CheckSC g ipsps nt prd '[] = '[]+ CheckSC g ipsps nt prd ( '(chnam, att) ': chis)+ = CheckSC' g ipsps nt prd chnam att (GetGSymChildL (GetChildL g chnam))+ :++ CheckSC g ipsps nt prd chis+type family CheckSC' g ipsps nt prd chnam att gsym where+ CheckSC' g ipsps nt prd chnam att gsym+ = CheckSC'' g ipsps nt prd chnam att (IsNonTer gsym) gsym+type family CheckSC'' g ipsps nt prd chnam att b gsym where+ CheckSC'' g ipsps nt prd chnam att 'False gsym = '[]+ CheckSC'' g ipsps nt prd chnam att 'True ('NonTer ntch)+ = If (att == (S ntch ipsps)) '[]+ '[Text ("error:\n\+ \ Semantics for production " :+ WrapQuotes prd+ :+ " of non-terminal " :+ WrapQuotes nt+ :+ " at children " :+ WrapQuotes chnam+ :+ "\n depend on the following synthesized attributes: ")+ :$$: ShowAsp att+ :$$: Text+ "but they should depend at most of:"+ :$$: ShowAsp (S ntch ipsps)+ :$$: Text "..."]++infer :: Label g -> CAspect asp -> Label (Infer g asp)+infer Label asp = Label++check :: (Check g (Infer g asp) asp)+ => Label g -> CAspect asp -> Label (Infer g asp)+check Label asp = Label+++++type family SubsetAtt (atts :: [(AttName, Type)])+ (atts' :: [(AttName, Type)]) :: Bool where+ SubsetAtt '[] att' = 'True+ SubsetAtt ( '(att, ty) ': atts) '[] = 'False+ SubsetAtt ( '(att, ty) ': atts) + ( '(att', ty') ': atts')+ = SubsetAttAux (Compare att att')+ ( '(att, ty) ': atts) + ( '(att', ty') ': atts')++type family SubsetAttAux (o :: Ordering)+ (atts :: [(AttName, Type)])+ (atts' :: [(AttName, Type)]) :: Bool where+ SubsetAttAux 'EQ ( '(att, ty) ': atts) + ( '(att', ty') ': atts') --y si distinto tipo?+ = SubsetAtt atts atts'+ SubsetAttAux 'LT ( '(att, ty) ': atts) + ( '(att', ty') ': atts')+ = 'False + SubsetAttAux 'GT ( '(att, ty) ': atts) + ( '(att', ty') ': atts')+ = SubsetAtt ( '(att, ty) ': atts) atts'+++copyAtChi (att :: Label ('Att att t))+ (l :: Label ('Chi ch ('Prd prd ('NT nt)) ntch))+ = inhdefM att+ (Label @('Prd prd ('NT nt)))+ l (at lhs att)++class CopyAtChis (att :: Att) (g :: Grammar) (l :: [Child]) where+ type CopyAtChisR att g l :: [((NTName,ProdName), Type)]+ copyAtChis :: Label g -> Label att -> Proxy l+ -> CAspect (CopyAtChisR att g l)++copyAtChiList :: (CopyAtChis ('Att att t) g l) =>+ Label g -> Label ('Att att t)-> LList l -> CAspect (CopyAtChisR ('Att att t) g l)+copyAtChiList g att (l :: LList l) = copyAtChis g att (Proxy @l)++instance CopyAtChis att g '[] where+ type CopyAtChisR att g '[] = '[]+ copyAtChis _ att _ = emptyAspect++instance+ ( CopyAtChis ('Att att t) g chs+ , RequireR+ (OpComRA '(nt, prd)+ (CRule '(nt, prd) '[] '[ '(att, t)] '[ '(ch, '[ '(att, t)])] '[])+ (CopyAtChisR ('Att att t) g chs))+ (Rec @Type @(NTName, ProdName) @Type+ PrdReco (UnWrap (ReqR (OpComRA '(nt, prd)+ (CRule '(nt, prd) '[] '[ '(att, t)] '[ '(ch, '[ '(att, t)])] '[])+ (CopyAtChisR ('Att att t) g chs))))) '[]+ )+ => CopyAtChis ('Att att t) g ( 'Chi ch ('Prd prd ('NT nt)) ntch ': chs)+ where+ type CopyAtChisR ('Att att t) g ( 'Chi ch('Prd prd ('NT nt)) ntch ': chs)+ = UnWrap @(Symbol, Symbol)+ (ReqR (OpComRA '(nt, prd)+ (CRule '(nt, prd) '[] '[ '(att, t)] '[ '(ch, '[ '(att, t)])] '[])+ (CopyAtChisR ('Att att t) g chs)))+ copyAtChis lg att+ (Proxy :: Proxy ('Chi ch('Prd prd ('NT nt)) ntch ': chis))+ = (copyAtChi att (Label @('Chi ch('Prd prd ('NT nt)) ntch)))+ .+: (copyAtChis lg att (Proxy @chis))
+ src/Language/AspectAG/EADT.hs view
@@ -0,0 +1,195 @@+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE UndecidableSuperClasses #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE NoMonomorphismRestriction #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE IncoherentInstances #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE ImpredicativeTypes #-}+{-# LANGUAGE ExplicitForAll #-}+{-# LANGUAGE QuantifiedConstraints #-}++module Language.AspectAG.EADT where++import Language.AspectAG.Types+import Data.GenRec+import Data.HList+import Data.Kind+import GHC.TypeLits+import Data.Type.Equality+import Data.Proxy++-- builds an HList of arguments of a variant+type family Args (g :: Grammar) (nt :: NTName) (p :: ProdName) ++++type family ChList2HList (g :: Grammar)+ (chis :: [(ChildName, GSym)]) where+ ChList2HList g '[] = '[]+ ChList2HList g ( '(chi, 'NonTer nt ) ': chis)+ = EADT g nt + ': ChList2HList g chis + ChList2HList g ( '(chi, 'Ter t ) ': chis)+ = t ': ChList2HList g chis+++data EADT (g :: Grammar) (nt :: NTName)+ where+ Variant :: forall g nt prd. KnownSymbol prd => SSymbol prd+ -> HList (ChList2HList g (GetChildren g nt prd))+ -> EADT g nt+++-- theorems+-- (IsSubGram g g') => (ChList2HList g' (GetChildren g' nt prd))+-- ~ (ChList2HList g (GetChildren g nt prd))++-- primero:+-- (IsSubGram g g') => (GetChildren g' nt prd)+-- ~ (GetChildren g nt prd)++class SubGramSameChi (g :: Grammar) (g' :: Grammar) nt prd where+ subGramSameChi :: Proxy g -> Proxy g'+ -> Proxy nt -> Proxy prd+ -> (GetChildren g' nt prd) :~: (GetChildren g nt prd) ++instance SubGramSameChi ('Grammar '[]) ('Grammar '[]) nt prd where+ subGramSameChi _ _ _ _ = Refl++class+ (IsSubGram g g')+ => Inject (g :: Grammar) (g' :: Grammar) (nt :: NTName) where+ cast :: Label g -> Label g'+ -> EADT g nt -> EADT g' nt+ inject :: Label g' -> EADT g nt -> EADT g' nt+ inject lg' (v :: EADT g nt) = cast (Label :: Label g) lg' v+ inject0 :: EADT g nt -> EADT g' nt+ inject0 (v :: EADT g nt) = inject (Label @g') v++class Inject' (prds :: [ProdName]) (g :: Grammar) (g' :: Grammar) (nt :: NTName) where+ cast' :: Label prds -> Label g -> Label g'+ -> EADT g nt -> EADT g' nt++instance+ ( Inject' (MapFst (GetTProdsOfNT g nt)) g g' nt+ , IsSubGram g g'+ )+ => Inject (g :: Grammar) (g' :: Grammar) (nt :: NTName) where+ cast lg lg' (v :: EADT g nt)+ = cast' (Label @(MapFst (GetTProdsOfNT g nt))) lg lg' v -- eta++++instance+ ( ChList2HList g'+ (InjectChiR prd g g' nt (GetTChildrenOfProd (GetTProdsOfNT g nt) prd))+ ~ ChList2HList g' (GetTChildrenOfProd (GetTProdsOfNT g' nt) prd)+ , KnownSymbol prd+ , InjectChi prd g g' nt (GetTChildrenOfProd (GetTProdsOfNT g nt) prd)+ )+ => Inject' '[prd] g g' nt where+ cast' (Label :: Label '[prd]) lg lg' (Variant (lprd :: SSymbol prd') args)+ = case sameSymbol (Label @prd) lprd of+ Just p@Refl+ -> Variant lprd+ (castChi @prd @g @g' @nt+ @(GetTChildrenOfProd (GetTProdsOfNT g nt) prd)+ (Proxy @(GetTChildrenOfProd (GetTProdsOfNT g nt) prd)) args)+ _ -> error "impossible"++--no es coerce args, hay que mapear cast en cada posicion...++instance+ ( ChList2HList g'+ (InjectChiR prd g g' nt (GetTChildrenOfProd (GetTProdsOfNT g nt) prd))+ ~ ChList2HList g' (GetTChildrenOfProd (GetTProdsOfNT g' nt) prd)+ , InjectChi prd g g' nt (GetTChildrenOfProd (GetTProdsOfNT g nt) prd)+ , KnownSymbol prd+ , Inject' prds g g' nt+ )+ => Inject' (prd ': prds) g g' nt where+ cast' (Label :: Label (prd ': prds)) lg lg' v@(Variant (lprd :: SSymbol prd') args)+ = case sameSymbol (Label @prd) lprd of+ Just p@Refl -> Variant lprd+ (castChi @prd @g @g' @nt+ @(GetTChildrenOfProd (GetTProdsOfNT g nt) prd)+ (Proxy @(GetTChildrenOfProd (GetTProdsOfNT g nt) prd)) args)+ _ -> cast' (Label @prds) lg lg' v++class+ InjectChi prd g g' nt (chis :: [(ChildName, GSym)]) where+ type InjectChiR prd g g' nt chis :: [(ChildName, GSym)]+ castChi :: Proxy chis -> HList (ChList2HList g chis) -> + HList (ChList2HList g' (InjectChiR prd g g' nt chis))+++instance+ ( )+ =>+ InjectChi prd g g' nt ('[]) where+ type InjectChiR prd g g' nt '[]+ = '[] + castChi _ ch = ch+++instance+ (-- GetTChildrenOfProd (GetTProdsOfNT g nt) prd+ -- ~ ('(ch, 'Left ('NT nt)) ': chis)+ -- , + Inject' (MapFst (GetTProdsOfNT g nt)) g g' nt+ , InjectChi prd g g' nt chis+ , IsSubGram g g' )+ => InjectChi prd g g' nt ('(ch, 'NonTer nt) ': chis) where+ type InjectChiR prd g g' nt ('(ch, 'NonTer nt) ': chis)+ = '(ch, 'NonTer nt) ': InjectChiR prd g g' nt chis+ castChi _ (HCons ch chs)+ = HCons -- @_ @(ChList2HList g' (InjectChiR prd g g' nt chis))+ (cast (Label @g) (Label @g') ch)+ (castChi @prd @g @g' @nt @chis Proxy chs)++instance+ ( -- GetTChildrenOfProd (GetTProdsOfNT g nt) prd+ -- ~ ('(ch, 'Right ('T t)) ': chis)+ -- , + Inject' (MapFst (GetTProdsOfNT g nt)) g g' nt+ , InjectChi prd g g' nt chis+ )+ => InjectChi prd g g' nt ('(ch, 'Ter t) ': chis) where+ type InjectChiR prd g g' nt ('(ch, 'Ter t) ': chis)+ = '(ch, 'Ter t) ': InjectChiR prd g g' nt chis+ castChi _ (HCons ch chs)+ = HCons -- @_ @(ChList2HList g' (InjectChiR prd g g' nt chis))+ ch+ (castChi @prd @g @g' @nt @chis Proxy chs)+++++type family MapFst (l :: [(k,k')]) :: [k] where+ MapFst '[] = '[]+ MapFst ( '(a,b) ': l) = a ': MapFst l++type family MapArgs (g :: Grammar) (args :: [Type]) :: [Type] where+ MapArgs g '[] = '[]+ MapArgs g (EADT g' nt ': args) = EADT g nt ': MapArgs g args+ MapArgs g (t ': args) = t ': MapArgs g args++coerce :: (a ~ b) => a -> b+coerce a = a
+ src/Language/AspectAG/Example2.hs view
@@ -0,0 +1,237 @@++{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE AllowAmbiguousTypes #-}++{-# LANGUAGE RebindableSyntax #-}++module Language.AspectAG.Example2 where++import Language.AspectAG.Types+import Language.AspectAG+import Language.AspectAG.RecordInstances+import Data.GenRec+import Data.GenRec.RecInstances.Record+import Data.Proxy+import Language.AspectAG.EADT+import Data.HList+import Data.Type.Equality+import Data.Type.Require+import Language.AspectAG.Types++import Control.Monad.Reader --- borrar+++import GHC.TypeLits+import Prelude hiding ((>>), (>>=), return)++{-+++type ExpGrammar+ = 'Grammar '[ '("E", '[ '("Add", '[ '("l", NonTerminal "E")+ , '("r", NonTerminal "E")+ ]),+ '("Val", '[ '("val", Terminal Int)])])]++type ExpGrammarExt+ = 'Grammar '[ '("E", '[ '("Add", '[ '("l", NonTerminal "E")+ , '("r", NonTerminal "E")+ ]),+ '("Val", '[ '("val", Terminal Int)]),+ '("Var", '[ '("var", Terminal String)])])]++-- trucha:++type ExpGrammarS+ = 'Grammar '[ '("S", '[ '( "Root", '[ '("root", NonTerminal "E")] )])+ , '("E", '[ '("Add", '[ '("l", NonTerminal "E")+ , '("r", NonTerminal "E")+ ]),+ '("Val", '[ '("val", Terminal Int)])])]++gExpS+ = Label @ExpGrammarS+gExp+ = Label @ExpGrammar+gExpExt+ = Label @ExpGrammarExt++s1 = Variant @ExpGrammarS @"S" (symbolSing @"Root")+ (inject gExpS e3 .: ε)++e0 = Variant @ExpGrammar @"E" (symbolSing @"Val") (0 .: ε)+e1 = Variant @ExpGrammar @"E" (symbolSing @"Val") (1 .: ε)+e2 = Variant @ExpGrammar @"E" (symbolSing @"Add") (e1 .: e1 .: ε)+e3 = Variant @ExpGrammar @"E" (symbolSing @"Add") (e1 .: e2 .: ε)+e4 = Variant @ExpGrammar @"E" (symbolSing @"Add") (e3 .: e3 .: ε)+e5 = Variant @ExpGrammar @"E" (symbolSing @"Add") (e4 .: e4 .: ε)+e6 = Variant @ExpGrammar @"E" (symbolSing @"Add") (e5 .: e5 .: ε)+e7 = Variant @ExpGrammar @"E" (symbolSing @"Add") (e6 .: e6 .: ε)++eval = att @"eval" @Int+env = att @"env" @Env+-- TODO: obtener a partir de la gramática, por ejemplo:+-- que |chi @"l" gExp| compute ch_l++p_Root = prd @ExpGrammarS @"Root"+p_Add = prd @ExpGrammar @"Add"+p_Val = prd @ExpGrammar @"Val"+p_Var = prd @ExpGrammarExt @"Var" -- probar ExpGrammar++ch_l = chi @ExpGrammar @"l"+ch_r = chi @ExpGrammar @"r"+ch_val = chi @ExpGrammar @"val"+ch_var = chi @ExpGrammarExt @"var"++ch_root = chi @ExpGrammarS @"root"++peval = Proxy @( '[ '("E", '[ '("env" , Env)], '[ '("eval", Int)])])++type Env = [(String, Int)]++add_eval = syndefM eval p_Add $+ at ch_l eval >>=. (\l ->+ at ch_r eval >>=. (\r ->+ ret (l+r)))++ +val_eval = syndefM eval p_Val $ at lhs env >>+ ter ch_val+++add_env_l = inhdefM env p_Add ch_l $ at lhs env+add_env_r = inhdefM env p_Add ch_r $ at lhs env++asp_gExp =+ add_eval .+: val_eval .+: add_env_r .+: add_env_l+ .+: emptyAspectFromGrammar gExp+++evalExp :: EADT ExpGrammar "E" -> Env -> Int+evalExp e env+ = sem asp_gExp e (Label @"env" =. env *. emptyAtt) #. Label @"eval"++var_eval = syndefM eval p_Var $ do+ e <- at lhs env+ x <- ter ch_var+ return $ (\(Just a) -> a) $ Prelude.lookup x e++asp_gExpExt = var_eval .+: asp_gExp .:+: emptyAspectFromGrammar gExpExt++evalExpExt :: EADT ExpGrammarExt "E" -> Env -> Int+evalExpExt e env+ = sem asp_gExpExt e (Label @"env" =. env *. emptyAtt) #. Label @"eval"+++-- sem' (g :: Label (g :: Grammar)) asp e+-- = sem (asp .:+: emptyAspectFromGrammar g) (inject g e)++root_eval = syndefM eval p_Root (at ch_root eval)+root_env = inhdefM env p_Root ch_root (pret ([]::Env)) --+ --at lhs env)++-- evalS :: Variant ExpGrammarS "S" -> Env -> Int+-- evalS e env+-- = sem (root_eval .+: root_env .+:+-- asp_gExpExt .:+: emptyAspectFromGrammar gExpS)+-- e (Label @"env" =. env *.+-- emptyAtt) #. Label @"eval"++--evalS' :: Variant ExpGrammarS "S" -> Env -> Int+evalS' e envi+ = sem' p+ (root_eval .+: root_env'' .+:+ asp_gExpExt .:+: emptyAspectFromGrammar gExpS)+ e (-- Label @"env" =. envi *.+ emptyAtt) #. Label @"eval"+ where p = Proxy @('[ '("E", '[ '("env" , Env)], '[ '("eval", Int)])+ , '("S", '[], '[ '("eval", Int)])])+ root_env'' = inhdefM env p_Root ch_root (pret [])++aspall = (root_eval .+: root_env' .+:+ asp_gExpExt .:+: emptyAspectFromGrammar gExpS)++root_env' = inhdefM env p_Root ch_root (pret ([]::Env))++pret :: a -> Reader (Fam '[] '[]) a+pret = preturn++l = Label @(GetChildren ExpGrammar "T" "Add")++f = case l of {l@Label -> l}++{- GHCI++funcionan:++- evalExp ei []+- evalExpExt (inject gExpExt ei) []+++(inject :: Cast g g' nt => Label g' -> Variant g nt -> Variant g' nt)++no tipan:++- evalExpExt e0 []+pero: sí tipa si no se le anota el tipo+ se puede hacer andar trivialmente haciendo que sem inyecte, si queremos+ (queremos?)++- evalExp (inject gExpExt ei) [] (y está bien que falle, obviamente)++-}+++-- ev = sem asp e1 emptyAtt++asp = syndefM eval p_Val (ter ch_val)+ -- .+: (inhdefM env p_Add ch_l $ at lhs env )--(pret ([]::Env)))+ .+: (inhdefM env p_Add ch_l $ pret ([]::Env))+ .+: (inhdefM env p_Add ch_r $ pret ([]::Env))+ -- .+: add_eval+ .+: emptyAspectFromGrammar gExp+++exa :: (Check ExpGrammar (Infer ExpGrammar asp) asp)+ => CAspect asp -> ()+exa asp = ()++exa2 :: CAspect asp+ -> (Proxy (CheckErrors ExpGrammar (Infer ExpGrammar asp) asp))+exa2 _ = Proxy+++type ASP =+ ['( '("E", "Add"),+ CRule+ '("E", "Add")+ ['("l", '[ '("eval", Int)]), '("r", '[ '("eval", Int)])]+ '[]+ ['("l", '[ '("env", Env)]), '("r", '[])]+ '[ '("eval", Int)]),+ '( '("E", "Val"),+ CRule+ '("E", "Val")+ '[ '("val", '[ '("term", Int)])]+ '[]+ '[ '("val", '[])]+ '[ '("eval", Int)])]+-}
+ src/Language/AspectAG/Example3.hs view
@@ -0,0 +1,55 @@+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE NoMonomorphismRestriction #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE IncoherentInstances #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE ImpredicativeTypes #-}++{-# LANGUAGE RebindableSyntax #-}++module Language.AspectAG.Example3 where++import Language.AspectAG.Types+import Language.AspectAG+import Language.AspectAG.RecordInstances+import Data.GenRec+import Data.GenRec.RecInstances.Record+import Data.Proxy+import Language.AspectAG.EADT+import Data.HList+import Data.Type.Equality+import Data.Type.Require++import GHC.TypeLits+import Prelude hiding ((>>), (>>=), return)++type TreeGrammar+ = 'Grammar '[ '("T", '[ '("Fork", '[ '("l", NonTerminal "T")+ , '("r", NonTerminal "T")]),+ '("Val", '[ '("val", Terminal Int)])])]++gTree = Label @TreeGrammar++sres = att @"res" @(EADT TreeGrammar "T")+smin = att @"min" @Int+ival = att @"val" @Int+++
+ src/Language/AspectAG/RecordInstances.hs view
@@ -0,0 +1,412 @@+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE NoMonomorphismRestriction #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE IncoherentInstances #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE ImpredicativeTypes #-}+{-# LANGUAGE PatternSynonyms #-}+++module Language.AspectAG.RecordInstances where++import GHC.TypeLits (Symbol, ErrorMessage(..), TypeError)+import Data.Kind (Type, Constraint)++import Language.AspectAG.Types++import Data.GenRec hiding ((.:><))+import Data.GenRec qualified++import Data.Type.Require+import Data.Proxy++import Data.Type.Ord (Compare(..),OrdCond)++import Data.Type.Equality--(==), no se como ponerlo++----------------------------------------------------------------------------+--- Attribution +----------------------------------------------------------------------------+-- | * Attribution+-- | An attribution is a record constructed from attributes++-- | datatype implementation+type Attribution (attr :: [(AttName,Type)]) = Rec AttReco attr+{-+instead of using Att as in the old library, we use AttName (Symbol).+The type of an attribute in a label is useful to check+it when building rules, but here it is already in the field...++-}++-- | index type+data AttReco++-- | field type+type instance WrapField AttReco (v :: Type) = v++-- | type level utilities+type instance ShowRec AttReco = "Attribution"+type instance ShowField AttReco = "attribute"++type Attribute (l :: AttName) (v :: Type) = TagField AttReco l v+pattern Attribute :: v -> TagField AttReco l v+pattern Attribute v = TagField Label Label v++-- | Extending+infixr 2 *.+-- (*.) :: Attribute att val -> Attribution atts+-- -> Attribution (ReqR (OpExtend AttReco att val atts) ctx)+(l :: Attribute att val) *. (r :: Attribution atts) = l .*. r++-- ** Destructors+--infixl 7 #.++-- * Children+-- | operations for the children++-- | datatype implementation+type ChAttsRec (chs :: [(ChildName,[(AttName,Type)])])+ = Rec ChiReco chs++-- | index type+data ChiReco --(prd :: ProdName)++-- | Field type+type instance WrapField ChiReco v+ = Attribution v++-- | Type level Show utilities+type instance ShowRec ChiReco = "Children Map"+type instance ShowField ChiReco = "child labelled "++-- | Empty+emptyAtt :: Attribution '[]+emptyAtt = EmptyRec++-- ** Destructors+infixl 7 #.++(#.) ::+ ( msg ~ '[Text "looking up attribute " :<>: ShowTE l :$$:+ Text "on " :<>: ShowTE r+ ]+ , Require (OpLookup AttReco l r) msg+ )+ => Attribution r -> Label l -> ReqR (OpLookup AttReco l r)+(attr :: Attribution r) #. (l :: Label l)+ = let prctx = Proxy @'[ 'Text "looking up attribute " :<>: ShowTE l :$$:+ 'Text "on " :<>: ShowTE r+ ]+ in req prctx (OpLookup @_ @(AttReco) l attr)++++++-----+infixr 4 =.++(=.) :: Label l -> v -> Attribute l v+Label =. v = Attribute v+++-- | specialized operations++-- |union++-- TODO: hay que implementar una union disjunta en poly-rec para+-- mejorar la eficiencia, estamos computando orthogonal por todos lados+type family (l ::[(AttName, Type)]) :|: (r ::[(AttName, Type)]) ::Constraint+ where+ l :|: r = ( Require (OpLJoin AttReco l r) '[]+ , Orthogonal l r+ , RequireR (OpLeftProj AttReco (LabelsOf r)+ (UnWrap @AttName @Type (ReqR (OpLJoin AttReco l r))))+ (Rec AttReco r) '[]+ , RequireR (OpLeftProj @AttName @Type AttReco (LabelsOf l)+ (UnWrap @AttName @Type (ReqR (OpLJoin AttReco l r))))+ (Rec AttReco l)'[ ]+ ) -- TODO: las ultimas dos no son necesarias si no se va+ -- a reproyectar, por eficiencia sobre todo de compilacion+ -- podemos cambiar esto++-- esto iria en biblioteca de records+type family Orthogonal (l :: [(k,k')])(r :: [(k,k')]) :: Constraint where+ Orthogonal '[] s = ()+ Orthogonal r '[] = ()+ Orthogonal ( '(l,v)': r) ( '(l',v')': s)+ = Orthogonal' (Cmp l l') ( '(l,v)': r) ( '(l',v')': s)+type family Orthogonal' (b::Ordering)(l :: [(k,k')])(r :: [(k,k')])+ :: Constraint where+ Orthogonal' 'EQ r s = (TypeError (Text "TODO: DEFINE ERROR"))+ Orthogonal' 'LT ( '(l,_)': r) s = Orthogonal r s+ Orthogonal' 'GT r ( '(l',_)': s) = Orthogonal r s++ +(.:><) :: (l :|: r) =>+ Attribution l -> Attribution r -> ReqR (OpLJoin AttReco l r)+(.:><) = (Data.GenRec..:><)++++++-- * Children+-- | operations for the children++-- | Type level Show utilities+type instance ShowRec ChiReco = "Children Map"+type instance ShowField ChiReco = "child labelled "++-- ** Pattern synonyms++-- |since now we implement ChAttsRec as a generic record, this allows us to+-- recover pattern matching+-- pattern EmptyCh :: ChAttsRec prd '[]+-- pattern EmptyCh = EmptyRec+-- pattern ConsCh :: TaggedChAttr prd ( 'Chi ch prd nt) v -> ChAttsRec prd xs+-- -> ChAttsRec prd ( '( 'Chi ch prd nt,v) ': xs)+-- pattern ConsCh h t = ConsRec h t++-- | Attributions tagged by a child+type TaggedChAttr = TagField ChiReco+pattern TaggedChAttr :: Label l -> WrapField ChiReco v+ -> TaggedChAttr l v+pattern TaggedChAttr l v+ = TagField (Label :: Label ChiReco) l v+++-- ** Constructors+-- | Pretty constructor for tagging a child+infixr 4 .=+(.=) :: Label l -> WrapField ChiReco v -> TaggedChAttr l v+(.=) = TaggedChAttr++-- | Pretty constructors+-- infixr 2 .*+-- (tch :: TaggedChAttr prd ch attrib) .* (chs :: ChAttsRec prd attribs) = tch .*. chs+-- TODO: error instances if different prds are used?++-- | empty+emptyCh :: ChAttsRec '[]+emptyCh = EmptyRec+++-- | children merge, as an infix operator+(.::><:) ::+ (Require (OpChiMerge ch_l ch_r) '[])+ =>+ ChAttsRec ch_l+ -> ChAttsRec ch_r -> ReqR (OpChiMerge ch_l ch_r)+chl .::><: chr+ = req (Proxy @'[]) (OpChiMerge chl chr)++-- | ascii version of children merge+chiMerge = (.::><:)++-- | implementation of operations for merging+data OpChiMerge (ch_l :: [(ChildName, [(AttName, Type)])])+ (ch_r :: [(ChildName, [(AttName, Type)])]) where+ OpChiMerge :: ChAttsRec ch_l -> ChAttsRec ch_r ->+ OpChiMerge ch_l ch_r++data OpChiMerge' (b :: Ordering)+ (ch_l :: [(ChildName, [(AttName, Type)])])+ (ch_r :: [(ChildName, [(AttName, Type)])]) where+ OpChiMerge' :: Proxy b -> ChAttsRec ch_l -> ChAttsRec ch_r ->+ OpChiMerge' b ch_l ch_r+++instance+ Require (OpChiMerge '[] '[]) ctx where+ type ReqR (OpChiMerge '[] '[]) = ChAttsRec '[]+ req ctx _ = EmptyRec++instance Require (OpChiMerge (chh ': chs) '[]) ctx where+ type ReqR (OpChiMerge (chh ': chs) '[]) =+ ChAttsRec (chh ': chs)+ req ctx (OpChiMerge l _) = l++instance Require (OpChiMerge '[] (chh ': chs)) ctx where+ type ReqR (OpChiMerge '[] (chh ': chs)) =+ ChAttsRec (chh ': chs)+ req ctx (OpChiMerge _ r) = r++instance+ Require+ (OpChiMerge' (Cmp chl chr)+ ( '(chl, chlv) ': chsl)+ ( '(chr, chrv) ': chsr)) ctx+ => Require (OpChiMerge ('(chl, chlv) ': chsl)+ ('(chr, chrv) ': chsr)) ctx where+ type ReqR (OpChiMerge ( '(chl, chlv) ': chsl)+ ( '(chr, chrv) ': chsr)) =+ ReqR (OpChiMerge' (Cmp chl chr)+ ( '(chl, chlv) ': chsl) ( '(chr, chrv) ': chsr))+ req ctx (OpChiMerge l r)+ = req ctx (OpChiMerge' (Proxy @(Cmp chl chr)) l r)++instance+ (Require (OpChiMerge chsl (chr ': chsr)) ctx,+ (ReqR (OpChiMerge chsl (chr : chsr))+ ~ Rec ChiReco (UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge chsl (chr : chsr))))))+ => Require+ (OpChiMerge' 'LT (chl ': chsl) (chr ': chsr)) ctx where+ type ReqR (OpChiMerge' 'LT (chl ': chsl) (chr ': chsr))+ = ChAttsRec (chl ': UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge chsl (chr ': chsr))))+ req ctx (OpChiMerge' lt (ConsRec (TagField c chl chv) chsl) r)+ = ConsRec (TagField c chl chv) (req ctx (OpChiMerge chsl r))++instance+ (ReqR (OpChiMerge (chl : chsl) chsr)+ ~ Rec ChiReco (UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge (chl : chsl) chsr)))+ , Require (OpChiMerge (chl : chsl) chsr) ctx+ )+ => Require+ (OpChiMerge' 'GT (chl ': chsl) (chr ': chsr)) ctx where+ type ReqR (OpChiMerge' 'GT (chl ': chsl) (chr ': chsr))+ = ChAttsRec (chr ': UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge (chl ': chsl) chsr)))+ req ctx (OpChiMerge' lt l (ConsRec (TagField c chr chv) chsr))+ = ConsRec (TagField c chr chv) (req ctx (OpChiMerge l chsr))++instance + (ReqR (OpLJoin AttReco atts atts')+ ~ Attribution+ (UnWrap @AttName @Type (ReqR (OpLJoin AttReco atts atts')))+ , Require (OpLJoin AttReco atts atts') '[ ]+ , atts :|: atts'+ , (ReqR (OpChiMerge ch_l ch_r)+ ~ Rec ChiReco+ (UnWrap @ChildName @[(AttName,Type)]+ (ReqR (OpChiMerge ch_l ch_r))))+ , Require (OpChiMerge ch_l ch_r) ctx+ )+ =>+ Require (OpChiMerge' 'EQ ( '(ch, atts) ': ch_l)+ ( '(ch, atts') ': ch_r)) ctx where+ type ReqR (OpChiMerge' 'EQ ( '(ch, atts) ': ch_l)+ ( '(ch, atts') ': ch_r))+ = ChAttsRec+ ( '(ch, UnWrap (ReqR (OpLJoin AttReco atts atts')))+ ': UnWrap (ReqR (OpChiMerge ch_l ch_r)))+ req (ctx :: Proxy ctx) (OpChiMerge' p (ConsRec (TagField c l attl) chl)+ (ConsRec (TagField _ _ attr) chr))+ = TagField c l (attl .:>< attr) `ConsRec`+ req ctx (OpChiMerge chl chr)+++-- | PROJECTION+class ProjChi (ch :: [(ChildName, [(AttName, Type)])])+ (ref :: [(ChildName, [(AttName, Type)])]) where+ projChi :: Proxy ref -> ChAttsRec ch -> ChAttsRec ref++class ProjChi' (b :: Bool)+ (ch :: [(ChildName, [(AttName, Type)])])+ (ref :: [(ChildName, [(AttName, Type)])]) where+ projChi' :: Proxy b -> Proxy ref -> ChAttsRec ch -> ChAttsRec ref++type family ProjChiOp (operator :: Type)+ (ref :: [(ChildName, [(AttName, Type)])])+ where+ ProjChiOp op ref = ProjChi (UnWrap @ChildName @([(AttName, Type)])+ (ReqR op)) ref++instance ProjChi ch '[] where+ projChi Proxy _ = EmptyRec++instance+ ProjChi' (chn == chn') ( '(chn, atts)': chi) ( '(chn', attsref) ': chiref)+ => ProjChi ( '(chn, atts)': chi) ( '(chn', attsref) ': chiref) where+ projChi ref chis = projChi' (Proxy @(chn == chn')) ref chis+++-- instancia con iguales++instance+ ( ProjChi chi chiref+ , ReqR (OpLeftProj AttReco (LabelsOf attsref) atts)+ ~ Attribution attsref+ , (Require (OpLeftProj AttReco (LabelsOf attsref) atts) '[ ]) + )+ => ProjChi' 'True ( '(chn, atts)': chi) ( '(chn, attsref) ': chiref)+ where+ projChi' Proxy Proxy (ConsRec (TagField p ch atts) chi)+ = ConsRec (TagField p ch (Label @(LabelsOf attsref) .// atts))+ (projChi Proxy chi)++-- instancia con no iguales++instance+ ( ProjChi chi ( '(chn', attsref) ': chiref)+ )+ => ProjChi' 'False ( '(chn, atts)': chi) ( '(chn', attsref) ': chiref)+ where+ projChi' Proxy (ref@Proxy) (ConsRec (TagField p ch atts) chi)+ = projChi ref chi++-- | EMPTY+++-- | Aspects++data PrdReco+type Aspect (asp :: [((NTName,ProdName), Type)]) = Rec PrdReco asp+type instance ShowRec PrdReco = "Aspect"+type instance ShowField PrdReco = "production named "+++infixl 8 .#+(.#) ::+ ( c ~ ('Chi ch prd nt)+ , ctx ~ '[Text "looking up " :<>: ShowTE c :$$:+ Text "on " :<>: ShowTE r -- :$$:+ -- Text "producion: " :<>: ShowTE prd+ ]+ , Require (OpLookup ChiReco c r) ctx+ ) =>+ Rec ChiReco r -> Label c -> ReqR (OpLookup ChiReco c r)+(chi :: Rec ChiReco r) .# (l :: Label c)+ = let prctx = Proxy @'[Text "looking up " :<>: ShowTE c :$$:+ Text "on " :<>: ShowTE r -- :$$:+ -- Text "producion: " :<>: ShowTE prd+ ]+ in req prctx (OpLookup @_ @(ChiReco) l chi)++++-- | to compare keys in aspects+-- | TODO: ver si vale la pena tener constraint en poly-rec+instance OrdType (NTName, ProdName) where+ type Cmp a b = CmpAux a b++type family CmpAux (a :: (NTName, ProdName)) b where+ CmpAux '(nt , prd) '(nt', prd')+ = OrdCond (Compare nt nt')+ 'LT+ (Compare prd prd')+ 'GT+++
+ src/Language/AspectAG/RunningExample.lhs view
@@ -0,0 +1,552 @@+\begin{code}++{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE PatternSynonyms #-}++{-# LANGUAGE RebindableSyntax #-}++module Language.AspectAG.RunningExample where++import Language.AspectAG.Types+import Language.AspectAG+import Language.AspectAG.RecordInstances+import Data.GenRec+import Data.GenRec.RecInstances.Record+import Data.Proxy+import Language.AspectAG.EADT+import Data.HList+import Data.Type.Equality+import Data.Type.Require+import Language.AspectAG.Types+import Data.Maybe (fromJust)+import Control.Monad.Reader --- borrar++import Data.List (insertBy)+import GHC.TypeLits+import Prelude hiding ((>>), (>>=), return)++\end{code}++\begin{code}+type G' :: Grammar+type G'+ = MkGrammar '[ '("E", '[ '("Add", '[ '("l", 'NonTer "E")+ , '("add", 'Ter ())+ , '("r", 'NonTer "E")])+ , '("Zero", '[ '("zero",'Ter ())])+ , '("Succ", '[ '("arg", 'NonTer "E")])+ ])+ ]+\end{code}+\begin{figure}+\begin{framed}+\begin{multicols}{2}+type NTName = Symbol+type ProdName = Symbol+type ChildName = Symbol+type TProds = [TProd]+type TProd = (ProdName, + TChildren)+type TChildren = [TChild]+type TChild = (ChildName, + GSym)++data {-kind-} T = T Type+data {-kind-} NT = NT NTName+++data {-kind-} GSym + = Ter Type+ | NonTer NTName++data {-kind-} Att + = Att AttName Type+data {-kind-} Prod + = Prd Symbol NT+data {-kind-} Child + = Chi Symbol Prod GSym++data {-kind-} Grammar where+ Grammar :: [(NTName, TProds)] + -> Grammar++\end{multicols}+\label{fig:datakinddefs}+\caption{Grammar types}+\end{framed}+\end{figure}++To use the information of types such as \mi{G} at+value-level users can use proxy types (also singleton types are a+common technique, though in our library we have used mainly the+former). In \AspectAG{} we define the datatype \mi{Label}.++data Label (t :: k) where+ Label :: Label t++\noindent+For instance, we can represent the full grammar \mi{G'} with a+label:++\begin{code}+expG' = Label @G'+\end{code}+++\begin{figure}+\begin{code}+p_Add = prd @G' @"Add"+p_Zero = prd @G' @"Zero"+p_Succ = prd @G' @"Succ"++ch_l = chi @G' @"l"+ch_r = chi @G' @"r"+ch_arg = chi @G' @"arg"+\end{code}+\label{fig:labels}+\end{figure}++\begin{figure}+\begin{code}+++\end{code}+\caption{Label types}+\label{fig:labeltypes}+\end{figure}++\subsection{Representing ASTs: Extensible Algebraic Datatypes}++Once we have grammars represented as a type, we can extend and modify them+managing everything as a type-level+EDSL by using type-families. However, we want to represent languages+generated by the grammar, so at some point we must represent things at value-level. The previously defined grammar can be+represented as a Haskell datatype as follows:++\begin{code}+data E = Add E E | Val () | Succ E+\end{code}++In Haskell, neither we can write a definition like that depending on+the type \mi{Exp} without metaprogramming, nor we can extend such+datatype definitions.+We introduce extensible algebraic datatypes parameterized by a grammar+to tackle this issue, as follows.++data EADT (g :: Grammar) (nt :: NTName)+ where+ Variant :: forall g nt prd. KnownSymbol prd => SSymbol prd+ -> HList (ChList2HList g (GetChildren g nt prd))+ -> EADT g nt++Given a grammar \mi{g} and a non-terminal \mi{nt}, the values of the+GADT (\mi{EADT g nt}) will act as a suitable reified type \mi{E}.++The single constructor \mi{Variant} stores a singleton value for the+symbol \mi{prd} and takes a heterogeneous list of type+\mi{ChList2HList g (GetChildren g nt prd)}. The type family+\mi{GetChildren} just access the list of children for the production+\mi{prd}. The type family \mi{ChList2HList} computes in each position+if the argument of the constructor must be a terminal type or another+variant (for the corresponding non-terminal) in case of a non-terminal.++For instance, the following values represent ({\tt 0}), ({\tt S 0}) and ({\tt S 0 + S 0}):++\begin{code}+e0 = Variant @G' @"E" (symbolSing @"Zero") (() .: ε)+e1 = Variant @G' @"E" (symbolSing @"Succ") (e0 .: ε)+e1p1 = Variant @G' @"E" (symbolSing @"Add") (e1 .: () .: e1 .: ε)+\end{code}++The function (\mi{.: :: x -> HList xs -> HList (x ': xs)})+and the value (\mi{ε :: HList '[]}) are the `cons' and `nil' in our +heterogeneous list implementation.++Only `legal' datatypes can be built by this mannner, since the family+\mi{ChList2HList} will compute the correct list of arguments or raise+a type error otherwise.++\subsection{Semantics definition}++To provide semantics to our attribute grammar, we provide rules to+compute attributes. In an expression+language the usual semantics is the evaluation semantics. This can be+defined in this simple example by using one synthesized attribute \mi{seval}, to represent the result of+the evaluation.++Attributes in \AspectAG{} are also defined as \mi{Label}s. They have+attached the type of the computation that they represent. +Let us define our attribute:++\begin{code}+seval = att @"seval" @Int+\end{code}++The value \mi{att} has type \mi{Label ('Att name ty)} (see Figure \ref{fig:datakinddefs}). There is no+information specifying that \mi{seval} is a synthesized attribute. In+\AspectAG{} attributes are just declared giving a name and a+type. They can be used in any role. We adopt the convention of using the starting+letters `s' or `i' for, respectively, syntheized and inherited attributes.++\begin{figure}+\begin{code}+add_seval = syndefM seval p_Add $ do+ l <- at ch_l seval+ r <- at ch_r seval+ return (l + r)+zero_seval = syndefM seval p_Zero (return 0)+succ_seval = syndefM seval p_Succ $ do+ p <- at ch_arg seval+ return (p + 1)++asp_seval = zero_seval .+: add_seval .+: succ_seval.+: emptyAspG expG'++a = Label @'[ '("E", '[], '[ '("seval", Int)])]++eval :: EADT G' "E" -> Int +eval e = semAG a asp_seval e (emptyAtt) #. Label @"seval"++\end{code}+\caption{Rules to compute eval}+\label{fig:semantics}+\end{figure}+++In Figure \ref{fig:semantics} we build the rules to compute the+attribute \mi{seval}. For example, for the production+\mi{p_Add} we defined the rule denoted by the expression+\mi{add_eval}. The name \mi{add_eval} is just a Haskell identifier. We+adopt this name convention for rules: the uncapitalized name of the+production followed by the name of the attribute.++The rule is defined using the function \mi{syndefM}, which is one of+the operations available in \AspectAG{} to define synthesized+attributes. \mi{syndefM} takes an attribute label (the one for which+the semantics is being defined), a production label (where it is being+defined), and the respective computation rule for the attribute (in a+Reader monad[REF).++The computation means that we take the values of the \mi{seval}+attribute at children \mi{ch_l} and \mi{ch_r}, and combine them with+the operator (+). In the expression \mi{at ch_l seval}/\mi{at+ch_r seval} we pick up the attribute \mi{seval} from the collection+of synthesized attributes (attribution) of the child+\mi{ch_l}/\mi{ch_r}. The expression \mi{at} is just a function+exported by \AspectAG{}. Similarly we build the rules \mi{val_seval} and+\mi{var_seval}.++Rules have type \mi{CRule}, which has kind+ CRule :: (NTName, ProdName)+ -> [(ChildName, [(AttName, Type)])]+ -> [(AttName, Type)]+ -> [(ChildName, [(AttName, Type)])]+ -> [(AttName, Type)]+ -> Type++A rule is intended to compute attributes for a production of a given+non-terminal, hence the index of kind \mi{(NTName, ProdName)}. Then,+there are four association lists that represent the types of the input+family and the output family. They are, in order: synthesized of+children, inherited from the father (input family); inherited to+children, synthesized for the father (output family).+++As an example, we consider the type of \mi{add_seval}, which is the following:++\begin{code}+add_seval ::+ CRule '("E", "Add")+ ['("l", '[ '("seval", Int)]), '("r", '[ '("seval", Int)])]+ '[]+ '[]+ '[ '("seval", Int)]+\end{code}++Its type states it is a rule defined for the production \mi{"Add"} of the non-terminal+\mi{"E"}. It computes the single synthesized attribute named \mi{"seval"} of type \mi{Int} the same synthesized attribute at children named \mi{"l"}, and \mi{"r"}.++We can combine rules for the same production with the operator+\mi{(.+.)}, and then build full semantics by building \emph{aspects}+by combining rules. For instance the operator \mi{(.+:)} adds a rule+to an aspect. In this case we combine all the rules in the aspect+\mi{asp_eval}, where \mi{emptyAspG} builds an empty aspect for a+grammar (why it is applied to the argument \mi{expG'} in this case).++Finally, we can put everything together to build an evaluator.+The function \mi{sem}, with the following type:++sem :: Sem g nt asp ip sp =>+ CAspect asp -> EADT g nt -> Attribution ip -> Attribution sp++\noindent+\mi{sem} takes an aspect (semantics specification), an abstract syntax tree,+and builds the function from the inherited attributes at the root+(context) to the synthethized attributes of the root (denotation).+The type \mi{Attribution} is a record-like structure, as we will see+later. The constraint (\mi{Sem g nt asp ip sp}) is fulfilled just when+everything is correct: \mi{asp} builds semantics for the grammar+\mi{g}, \mi{ip} and \mi{sp} are correct according to the aspect+\mi{asp}, the aspect \mi{asp} is well-formed, etc.++The following is a valid evaluator:++\begin{code}++-- evalG' :: EADT G' "E" -> Int+-- evalG' e = sem asp_seval e emptyAtt #. Label @"seval"+\end{code}+\noindent+where the operator (\mi{#.}) is just the destructor for attributions,+and \mi{emptyAtt} is a way to build the empty attribution (since there+are no inherited attributes at the root in this example). To read easier the expression, note that the type of (\mi{sem asp_eval e}) is \break\nolinebreak{(\mi{Attribution '[] -> Attribution '[ '("seval", Int)]})}++\subsection{Extending Semantics}++Adding new semantics to our language is simple: we just can build new+aspects. In Figure \ref{fig:size} we show a definition for an aspect+computing the size of an expression.++\begin{figure}+\begin{framed}+\begin{code}+ssize = att @"ssize" @Int+asp_size = syndefM ssize p_Succ ((1+) <$> at ch_arg ssize)+ .+: syndefM ssize p_Zero (return 1)+ .+: syndefM ssize p_Add (do l <- at ch_l ssize+ r <- at ch_r ssize+ return (l + r))+ .+: emptyAspG expG'++\end{code}+\caption{Aspect for size}+\label{fig:size}+\end{framed}+\end{figure}++The new semantics can be used by building a funcion as we did with+\mi{evalG'}. Moreover, note we can build the following generic+traversal, parameterized by the aspect:++\begin{code}+--genEvaluator asp (e :: EADT G' "E") = sem asp e+\end{code}++We can combine aspects and rules for many (possibly orthogonal)+attributes in one, for instance the expression+\mi{ genEvalG' (asp_eval .:+: asp_size)} (where the operator \mi{(.:+:)} combines two aspects) has type:++genEvalG' (asp_eval .:+: asp_size)+ :: EADT ExpG' "E"+ -> Attribution '[]+ -> Attribution ['("seval", Int), '("ssize", Int)]}++Note that rules and aspects can be defined in different modules+(respect to the grammar, or among them).++\subsection{Extending Syntax}++Extending semantics easily in a functional language should not+surprise the reader, since it is a characteristic of the paradigm. This+section will show the true power of our library.++Let us extend the grammar of our expression language by adding a production. +We represent variables.++Until this point, we have made the effort to keep the example identical to+the grammar defined in Section \ref{ex:grammar1}, which in turn is an instance of+the classical definition of a context free grammar (Definition \ref{def:cfg}). Usually attribute grammar systems allow some extensions to make life easier, and this is the+case of \AspectAG{}. Recall that in the definition of \mi{G'}, in each+terminal child position we applied \mi{'Ter} to the unit (\mi{()})+type. We can, in fact use any type. for instance, note the following+grammar:++\begin{code}++type H :: Grammar+type H+ = MkGrammar '[ '("E", '[ '("Add", [ '("l", 'NonTer "E")+ , '("add", 'Ter ())+ , '("r", 'NonTer "E")])+ , '("Zero", '[ '("zero", 'Ter ())])+ , '("Succ", '[ '("arg", 'NonTer "E")])+ , '("Var", '[ '("var", 'Ter String)])+ ])+ ]+p_Var = prd @H @"Var"+ch_var = chi @H @"var"++\end{code}++\mi{H} is an extension of \mi{G'}. The addition is a production where+the non-terminal \mi{"E"} can rewrite to \emph{any} string. Since strings are+themselves a context-free language this kind of extension do not add+power to the formalism\footnote{no se si vale la pena aclarar que eso+es en realidad mentira :) }. They can be implemented in the vanilla definition +by adding a non-terminal symbol and defining suitable rules.++There are some ways to get the type of the new grammar+\mi{H} programmaticaly from \mi{G'} instead of writing the full grammar again as we did. +For instance, by using the+type family (\mi{AddProd :: TProd -> Grammar -> Grammar}) at type level,+or from similar functions that manipulate labels. In our system, the reason why+\mi{H} is an extension of \mi{G'} is because the former has a+superset of productions of the latter.++Semantics already defined to compute attributes for the grammar+\mi{G'} are valid for the new grammar, but the aspects \mi{asp_seval}+and \mi{asp_size} are not enough since rules for the new production+are missing. Let us build the rules for the new production. We start+with \mi{ssize} since it does not require anything complicated: we+just add a rule for the new production. Let us define the size of an+expression consisting in a variable as $1$, as usual. We can build the+evaluator with a very brief definition:++\begin{code}+-- sizeH e+-- = sem (syndefM ssize p_Var (return 1)+-- .+: asp_size) e emptyAtt #. Label @"ssize"++\end{code}++For the denotational semantics given by \mi{seval}, we want to give+the variables a value according with some context. We should, of+course use an inherited attribute passing the environment down in the+AST. Let us build the new evaluator:++\begin{code}+ienv = att @"ienv" @[(String,Int)]+asp_evalH = inhdefM ienv p_Add ch_l (at lhs ienv)+ .+: inhdefM ienv p_Add ch_r (at lhs ienv)+ .+: inhdefM ienv p_Succ ch_arg (at lhs ienv)+ .+: syndefM seval p_Var ( do+ v <- ter ch_var+ env <- at lhs ienv+ return (fromJust . Prelude.lookup v $ env))+ .+: asp_seval .:+: emptyAspG (Label @H)++-- evalH :: EADT H "E" -> [(String, Int)] -> Int+-- evalH e env+-- = semFunc asp_evalH e (Label @"ienv" =. env *. emptyAtt) #. Label @"seval"++\end{code}++We introduce an inherited attribute \mi{senv}. Its type is \mi{[(String, Int)]},+representing a mapping from variables to integer values.+To define the rules for the inherited attribute \mi{senv} +we use the combinator \mi{inhdefM}. It takes three labels: +an attribute, a production where the rule is being defined,+and a child to which the information is being distributed. +In this case we always just copy up-to-down. The value \mi{lhs} exported +in \AspectAG{} is used to access the inherited attributes from the father.+This pattern is pretty common in attribute grammars, usually named as a +\emph{copy rule}, so \AspectAG{} has combinators to do this more concisely. +We avoid adding too much constructs in this presentation.++In the fourth defined rule, we provide semantics for the attribute \mi{seval}+at the new production. The value \mi{ter} is used to get the value of the occurrence of the terminal (in this case, the concrete string in the AST). We get the environment \mi{env}+and then lookup the value of the variable.++In this case, we define an initial attribution with the environment \mi{env} as the third argument of the semantic function.++Note that the argument of \mi{evalH} is an AST for the grammar \mi{H}. Therefore, it will not accept expressions such as \mi{e1}, \mi{ex}, or+\mi{e1px}. However, when we \emph{extend} a language it is reasonable+old ASTs are still part of the new one. For that reason we provide utilities such+as \nolinebreak{(\mi{inject :: Inject g g' nt => Label g' -> EADT g nt -> EADT g'+nt})}. We will see in next Section how the class \mi{Inject} is defined, but+basically the function \mi{inject} transforms an AST of a grammar to+an AST of an extension (just manipulating types).+This can even performer `silently' when building the evaluator:++\begin{code}+-- evalH_1+-- :: (Inject g H "E") => EADT g "E" -> [(String, Int)] -> Int+-- evalH_1 e env+-- = semFunc asp_evalH (inject (Label @H) e)+-- (Label @"ienv" =. env *. emptyAtt) #. Label @"seval"++\end{code}++The function \mi{evalH_1} takes ASTs of any grammar extensible to+\mi{H}. Note that while we write the type for clarity, the+change can be even more silent if we let the type checker do the job.++In an analog way, we can build ASTs for the new grammar, using the old values:++\begin{code}+e2 = Variant @H @"E" (symbolSing @"Add")+ (inject0 e1 .: () .: inject0 e1 .: ε)+\end{code}+ +where \mi{inject0} is just a variation of \mi{inject} without label+argument (since here it is known from the context). +We could also implement this as a smart constructor building a variant, +to avoid explicit injections.+++\subsection{Adding new non-terminals}+\label{subsec:nonterminals}++\begin{code}+type G :: Grammar+type G+ = MkGrammar '[ '("E", '[ '("Add", '[ '("l", 'NonTer "E")+ , '("add", 'Ter ())+ , '("r", 'NonTer "E")])+ , '("Zero", '[ '("zero", 'Ter ())])+ , '("Succ", '[ '("arg", 'NonTer "E")])+ , '("Var", '[ '("var", 'Ter String)])+ ])+ , '("S", '[ '("Root", '[ '("root", 'NonTer "E")])])+ ]++r = Variant @G @"S" (symbolSing @"Root")+ (inject0 e2 .: ε)++pr = (prd @G @"Root")+cr = (chi @G @"root")++asp = ( syndefM seval (prd @G @"Root") (at cr seval)+ .+: inhdefM ienv (prd @G @"Root")(chi @G @"root") (return ([] :: [(String, Int)]))+ .+: asp_evalH .:+: emptyAspG (Label @G)+ )++type Expr = EADT G "S"+evalG :: [(String,Int)] -> Expr -> Int+evalG env e+ = semAG a (normalizeAsp (Label @G) asp a)+ e (Label @"ienv" =. env *. + emptyAtt) #. Label @"seval"+ where a = a'++a' = Label @'[ '("E", '[ '("ienv", [(String, Int)])], '[ '("seval", Int)] ),+ '("S", '[ '("ienv", [(String, Int)])], '[ '("seval", Int)])]++++-- pattern (:==.) :: Label l -> v -> Attribute l v+-- pattern (:==.) l v = TagField (Label :: Label AttReco) l v++-- (l :==. v) .****. (r :: Attribution r) =+-- req (Proxy @'[Text "add"]) (OpExtend l v r)++--v = Label @"a" :==. 5 *. Label @"a" :==. 3 *. Label @"b" :==. False *. emptyAtt+\end{code}
+ src/Language/AspectAG/Types.hs view
@@ -0,0 +1,359 @@+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE TypeFamilyDependencies #-}+{-# LANGUAGE PartialTypeSignatures #-}+{-# LANGUAGE UnicodeSyntax #-}+{-# LANGUAGE PatternSynonyms #-}+++module Language.AspectAG.Types where++import GHC.TypeLits (Symbol,TypeError, ErrorMessage (..))+import Data.Kind (Type, Constraint)++import Data.Type.Bool+import Data.Type.Ord+import GHC.Exts (Any)+import GHC.TypeLits (AppendSymbol)+import Data.Type.Require (RequireEqWithMsg', Eval, Exp)++type NTName = Symbol+type ProdName = Symbol+type ChildName = Symbol+type AttName = Symbol++data {-kind-} T = T Type+data {-kind-} NT = NT NTName++data GSym = Ter Type | NonTer NTName+++type TProds = [TProd]+type TProd = (ProdName, TChildren)+type TChildren = [TChild]+type TChild = (ChildName, GSym)++-- | Gramamar type:+data {-kind-} Grammar where+ Grammar :: [(NTName, TProds)] -> Grammar++type family MkGrammar (nts :: [(NTName, TProds)]) :: Grammar where+ MkGrammar g = 'Grammar g+++type family GetTProdsOfNT (g :: Grammar)+ (nt :: NTName) :: TProds+ where+ GetTProdsOfNT ( 'Grammar nts) nt+ = GetTProdsOfNT' ('Grammar nts) nts nt ++--local+type family GetTProdsOfNT' (g :: Grammar)+ (gcontent :: [(NTName, TProds)])+ (nt :: NTName) :: TProds+ where+ GetTProdsOfNT' g ( '(nt, prods) ': nts) nt+ = prods+ GetTProdsOfNT' g ( '(nt', prods) ': nts) nt+ = GetTProdsOfNT' g nts nt+ GetTProdsOfNT' g '[] nt =+ TypeError (Text "Non Terminal named " :<>: Text nt :$$:+ Text "not a member of Grammar" :$$: ShowType g)++type family GetTChildrenOfProd+ (prods :: [(ProdName, [(ChildName, GSym)])]) (prod :: ProdName)+ where+ GetTChildrenOfProd prods prod = GetTChildrenOfProd' prods prods prod+ --GetTChildrenOfProd (TypeError a) prod = TypeError a+++type family GetTChildrenOfProd'+ (orig :: [(ProdName, [(ChildName, GSym)])])+ (prods :: [(ProdName, [(ChildName, GSym)])])+ (prod :: ProdName)+ :: [(ChildName, GSym)] where+ GetTChildrenOfProd' o ( '(prodn', chis') : '(prodn, chis) : prods) prodn = chis+ GetTChildrenOfProd' o ( '(prodn, chis) : prods) prodn = chis+ GetTChildrenOfProd' o ( '(prodn', chis) : prods) prodn+ = GetTChildrenOfProd' o prods prodn+ GetTChildrenOfProd' o '[] prodn = TypeError (Text ("no production named ")+ :<>: Text prodn :$$:+ Text "prodlist:" :<>: ShowType o)++type family GetChiOfChildren (chs :: [(ChildName, GSym)])+ (chnam :: ChildName) :: GSym+ where+ GetChiOfChildren chs chnam = GetChiOfChildren' chs chs chnam++type family GetChiOfChildren' (orig :: [(ChildName, GSym)])+ (chs :: [(ChildName, GSym)])+ (chnam :: ChildName) :: GSym+ where+ GetChiOfChildren' o ( '(chnam, tnt) ': chs) chnam = tnt+ GetChiOfChildren' o ( '(chnam', tnt) ': chs) chnam =+ GetChiOfChildren' o chs chnam+ GetChiOfChildren' o '[] chnam = TypeError (Text "no child named" :<>:+ Text chnam :$$:+ Text "chlist: " :<>: ShowType o)++type family GetChildren g nt prd where+ GetChildren g nt (prd :: ProdName)+ = GetTChildrenOfProd (GetTProdsOfNT g nt) prd++type family GetNTChi (chi :: Child) :: Maybe NTName where+ GetNTChi ('Chi chnam (Prd pnam ntp) ('NonTer nt)) = 'Just nt+ GetNTChi _ = 'Nothing+++type family GetChildL (g :: Grammar)+ (chi :: ChildName) :: Child+ where+ GetChildL ('Grammar ( '(nt, prds) ': nts)) chi+ = GetChildLDec (MemChiProds prds chi) ('Grammar ( '(nt, prds) ': nts)) chi++type family GetChildLDec (b :: Bool)(g :: Grammar)+ (chi :: ChildName) :: Child+ where+ GetChildLDec 'True ('Grammar ( '(nt, prds) ': nts)) chi =+ GetChildLPrds nt prds chi+ GetChildLDec 'False ('Grammar ( '(nt, prds) ': nts)) chi =+ GetChildL ('Grammar nts) chi+++type family GetChildLPrds ntacc prds chi where+ GetChildLPrds ntacc ( '(prd, chis) ': prds) chi+ = GetChildLPrdsDec (MemChi chis chi) ntacc ( '(prd, chis) ': prds) chi++type family GetChildLPrdsDec (b :: Bool) ntacc prds chi where+ GetChildLPrdsDec 'True ntacc ( '(prd, chis) ': prds) chi+ = GetChildLChis ntacc prd chis chi+ GetChildLPrdsDec 'False ntacc ( '(prd, chis) ': prds) chi+ = GetChildLPrds ntacc prds chi+++type family GetChildLChis ntacc prdacc chis chi where+ GetChildLChis ntacc prdacc ( '(chi, tnt) ': chis) chi+ = 'Chi chi ('Prd prdacc ('NT ntacc)) tnt+ GetChildLChis ntacc prdacc ( '(chi', tnt) ': chis) chi+ = GetChildLChis ntacc prdacc chis chi++++type family MemChi (chis :: TChildren) (chi :: ChildName) :: Bool where+ MemChi ( '(chi, _) ': chis) chi = 'True+ MemChi ( '(chi', _) ': chis) chi = MemChi chis chi+ MemChi '[] _ = 'False++type family MemChiProds (prods :: TProds) (chi :: ChildName) :: Bool where+ MemChiProds '[] chi = 'False+ MemChiProds ( '(prd, chis) ': prds) chi+ = MemChi chis chi || MemChiProds prds chi+ +type family MemChiGram (g :: Grammar) (chi :: ChildName) :: Bool where+ MemChiGram ('Grammar '[]) chi = 'False+ MemChiGram ('Grammar ( '(nt, prds) ': nts)) chi+ = MemChiProds prds chi || MemChiGram ('Grammar nts) chi++++-- | Label Types++data {-kind-} Att = Att AttName Type+data {-kind-} Prod = Prd Symbol NT+data {-kind-} Child = Chi Symbol Prod GSym++-- | injections for Either T NT++type family NonTerminal (t :: Symbol) :: GSym where+ NonTerminal t = 'NonTer t+type family Terminal (t :: Type) :: GSym where+ Terminal t = 'Ter t++type family IsNonTer (gs :: GSym) where+ IsNonTer ('NonTer _) = 'True+ IsNonTer _ = 'False++type family GetGSymChildL (ch :: Child) where+ GetGSymChildL ('Chi chnam prd gsym) = gsym++class IsSubGram (g :: Grammar)(g' :: Grammar) where {}+instance (IsSubGram' g g' ~ 'True) => IsSubGram g g'+ +type family IsSubGram' (g :: Grammar)(g' :: Grammar) :: Bool where+ IsSubGram' ('Grammar '[]) ('Grammar '[]) = 'True+ IsSubGram' ('Grammar ( '(nt, prds) ': nts ))+ ('Grammar ( '(nt, prds') ': nts'))+ = (IsSubGram' ('Grammar nts)('Grammar nts'))+ && (IsSubNT prds prds') + IsSubGram' ('Grammar ( '(nt, prds) ': nts ))+ ('Grammar ( '(nt', prds') ': nts'))+ = IsSubGram' ('Grammar ( '(nt, prds) ': nts )) ('Grammar nts')+ IsSubGram' ('Grammar '[]) ('Grammar nts) = 'True+ IsSubGram' _ _ = 'False++type family IsSubNT (prds :: [(ProdName, [(ChildName, GSym)])])+ (prds' :: [(ProdName, [(ChildName, GSym)])])+ :: Bool where+ IsSubNT '[] '[] = 'True+ IsSubNT ( '(prd, chis) ': prds) ('(prd, chis) ': prds')+ = IsSubNT prds prds'+ IsSubNT ( '(prd, chis) ': prds) ('(prd, chis') ': prds')+ = 'False+ IsSubNT ( '(prd, chis) ': prds) ('(prd', chis') ': prds')+ = IsSubNT ( '(prd, chis) ': prds) prds'+ IsSubNT '[] prds+ = 'True+ IsSubNT _ _ = 'False++type family IsProdOfNT (g :: Grammar) (prd :: ProdName) (nt :: NTName) :: Bool+ where+ IsProdOfNT ('Grammar ( '(nt, prds) ': nts )) prd nt = IsProd prd prds+ IsProdOfNT ('Grammar ( '(nt, prds) ': nts )) prd nt'+ = IsProdOfNT ('Grammar nts) prd nt'+ IsProdOfNT _ _ _ = False++type family IsProd (prd :: ProdName)+ (prds :: [(ProdName, [(ChildName, GSym)])]) where+ IsProd prd ( '(prd, chis) ': prds) = 'True+ IsProd prd ( '(prd', chis) ': prds) = IsProd prd prds+ IsProd prd '[] = 'False++type family IsProdG (g :: Grammar) (prd :: ProdName) :: Bool where+ IsProdG ('Grammar ( '(nt , prods) ': nts)) prd+ = (IsProd prd prods) || (IsProdG ('Grammar nts) prd)+ IsProdG g prd = False+++type family NTOfProd (g :: Grammar) (prd :: ProdName) :: NT where+ NTOfProd ('Grammar ( '(nt , prods) ': nts)) prd+ = If (IsProdOfNT ('Grammar ( '(nt , prods) ': nts)) prd nt)+ ('NT nt)+ (NTOfProd ('Grammar nts) prd)+ NTOfProd ('Grammar '[]) prd+ = TypeError (Text "broken label") -- ver esto++class ProdG (g :: Grammar)(prd :: ProdName)++++instance (RequireEqWithMsg' (IsProdG g prd) ('True) (Eval (ProdGMsg g prd))) '[]+ => ProdG g prd where+-- this definition requires both arguments g and prd instantiated,+-- otherwise RequireEqWithMsg' will fail (at least the way it is implemented)++-- An alternative is to avoid definning ProdG at all, but the advantage is that:+{-++prd :: forall (g :: Grammar) (prd :: ProdName) .+ (ProdG g prd) => Label ('Prd prd (NTOfProd g prd))+prd = Label++with the constraint it is explicit that g is the first argument,+otherwise it is not.. (and we want the grammar as the first arg,+for cosmetic reasons)++UPDATE: without using the constrain prd @ExpGrammar still fails,+so let us keep it...++-}++data ProdGMsg (g :: Grammar)(prd :: ProdName) :: Exp ErrorMessage+type instance Eval (ProdGMsg g prd)+ = Text "production " :<>: Text prd :$$:+ Text "not member of grammar: " :$$: ShowType g+++type family InsertIP+ (nt :: NTName) (att :: (AttName, Type))+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ InsertIP nt att '[] ='[ '(nt, '[ att], '[] )]+ InsertIP nt att ( '(nt', ips, sps) ': nts)+ = OrdCond (Compare nt nt')+ ( '(nt, '[ att ], '[]) ': '(nt', ips, sps) ': nts)+ ( '(nt, InsertAtt att ips, sps) ': nts)+ ( '(nt', ips, sps) ': (InsertIP nt att nts))++type family InsertSP+ (nt :: NTName) (att :: (AttName, Type))+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ InsertSP nt att '[] ='[ '(nt, '[], '[ att])]+ InsertSP nt att ( '(nt', ips, sps) ': nts)+ = OrdCond (Compare nt nt')+ ( '(nt, '[], '[att]) ': ( '(nt', ips, sps) ': nts))+ ( '(nt, ips, InsertAtt att sps) ': nts)+ ( '(nt', ips, sps) ': InsertSP nt att nts)++type family InsertAtt+ (att :: (AttName, Type))+ (atts :: [(AttName, Type)])+ :: [(AttName, Type)]+ where+ InsertAtt att '[] = '[ att]+ InsertAtt '(attname, t) ( '(attname', t') ': atts)+ = OrdCond (Data.Type.Ord.Compare attname attname')+ ( '(attname, t) ': '(attname', t') ': atts)+ ( '(attname, t) ': atts)+ ( '(attname', t') ': InsertAtt '(attname, t) atts)++type family CombineIPSP+ (ipsp :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ (ipsp' :: [(NTName, [(AttName, Type)], [(AttName, Type)])])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ CombineIPSP '[] ipsp' = ipsp'+ CombineIPSP ( '(nt, '[], '[]) ': ipsp) ipsp'+ = CombineIPSP ipsp ipsp'+ CombineIPSP ( '(nt, att ': ip, '[]) ': ipsp) ipsp'+ = InsertIP nt att (CombineIPSP ('(nt, ip, '[]) ': ipsp) ipsp')+ CombineIPSP ( '(nt, ip, att ': sp) ': ipsp) ipsp'+ = InsertSP nt att (CombineIPSP ('(nt, ip, sp) ': ipsp) ipsp')++type family CombineIPSPList+ (ipsps :: [[(NTName, [(AttName, Type)], [(AttName, Type)])]])+ :: [(NTName, [(AttName, Type)], [(AttName, Type)])]+ where+ CombineIPSPList '[] = '[]+ CombineIPSPList (ipsp ': ipsps) = CombineIPSP ipsp (CombineIPSPList ipsps)++type family (s :: Symbol) :+ (t :: Symbol) :: Symbol where+ s :+ t = AppendSymbol s t++type family Lookup (x :: k) (l :: [(k,a)]) where+ Lookup k ('(k,a) ': ls) = a+ Lookup k ('(x,a) ': ls) = Lookup k ls++type family Lookup1 (x :: k) (l :: [((k,k'),a)]) where+ Lookup1 l ('( '(l,m),a) ': ls) = a+ Lookup1 l ( '( '(l',m),a) ': ls) = Lookup1 l ls+++++--- builders++type family AddProd (t :: TProd) (g :: Grammar) :: Grammar where {}+++type family IsJust (t :: Maybe k) :: Bool where+ IsJust ('Just a) = 'True+ IsJust ('Nothing) = 'False+type family FromJust (t :: Maybe a) :: a where+ FromJust ('Just a) = a
− src/Language/Grammars/AspectAG.hs
@@ -1,1122 +0,0 @@--{-|-Module : Language.Grammars.AspectAG-Description : Main module, First-class attribute grammars-Copyright : (c) Juan García-Garland, Marcos Viera, 2019, 2020-License : GPL-Maintainer : jpgarcia@fing.edu.uy-Stability : experimental-Portability : POSIX--}--{-# LANGUAGE PolyKinds #-}-{-# LANGUAGE KindSignatures #-}-{-# LANGUAGE DataKinds #-}-{-# LANGUAGE ConstraintKinds #-}-{-# LANGUAGE RankNTypes #-}-{-# LANGUAGE TypeOperators #-}-{-# LANGUAGE FlexibleInstances #-}-{-# LANGUAGE FlexibleContexts #-}-{-# LANGUAGE GADTs #-}-{-# LANGUAGE UndecidableInstances #-}-{-# LANGUAGE MultiParamTypeClasses #-}-{-# LANGUAGE TypeFamilies #-}-{-# LANGUAGE NoMonomorphismRestriction #-}-{-# LANGUAGE ScopedTypeVariables #-}-{-# LANGUAGE TypeFamilies #-}-{-# LANGUAGE TypeApplications #-}-{-# LANGUAGE FunctionalDependencies #-}-{-# LANGUAGE TypeFamilyDependencies #-}-{-# LANGUAGE PartialTypeSignatures #-}-{-# LANGUAGE IncoherentInstances #-}-{-# LANGUAGE AllowAmbiguousTypes #-}-{-# LANGUAGE UnicodeSyntax #-}-{-# LANGUAGE ImpredicativeTypes #-}--module Language.Grammars.AspectAG- (-- -- * Rules- Rule, CRule(..),- Fam,- chi, par,- - -- ** Defining Rules- syndef, syndefM, syn, -- syndefC,- - synmod, synmodM, -- synP,-- inh,- inhdef, inhdefM,-- inhmod, inhmodM, -- emptyRule,- emptyRuleAtPrd,- emptyRuleInst,- ext, (.+.), extP,- - -- * Aspects - -- ** Building Aspects.- - emptyAspect,- singAsp,- extAspect,- comAspect,- (.+:),(◃),- (.:+.),(▹),- (.:+:),(⋈),- (.#..), - - CAspect(..),- Label(Label), Prod(..), T(..), NT(..), Child(..), Att(..),- (.#), (#.), (=.), (.=), (.*), (*.),- emptyAtt,- ter,- at, lhs,- sem_Lit,- knitAspect,- knit,- traceAspect,- traceRule,- copyAtChi,- -- use,- emptyAspectC,- emptyAspectForProds,- module Data.GenRec,- module Language.Grammars.AspectAG.HList,- Terminal,- NonTerminal,-- (+++),- empties- )- where---import Language.Grammars.AspectAG.HList-import Language.Grammars.AspectAG.RecordInstances---import Data.Type.Require hiding (emptyCtx)--import Data.GenRec-import Data.GenRec.Label--import Data.Kind-import Data.Proxy-import GHC.TypeLits--import Data.Maybe-import Data.Type.Equality-import Control.Monad.Reader-import Data.Functor.Identity-import GHC.Types--import Debug.Trace.LocationTH--infixr 3 &&-type family (a :: Bool) && (b :: Bool) where- True && True = True- _ && _ = False--class SemLit a where- sem_Lit :: a -> Attribution ('[] :: [(Att,Type)])- -> Attribution '[ '( 'Att "term" a , a)]- lit :: Label ('Att "term" a)-instance SemLit a where- sem_Lit a _ = (Label =. a) *. emptyAtt- lit = Label @ ('Att "term" a)----- * Families and Rules---- | In each node of the grammar, the "Fam" contains a single attribution--- for the parent, and a collection (Record) of attributions for--- the children:-data Fam (prd :: Prod)- (c :: [(Child, [(Att, Type)])])- (p :: [(Att, Type)]) :: Type- where- Fam :: ChAttsRec prd c -> Attribution p -> Fam prd c p----- | getter-chi :: Fam prd c p -> ChAttsRec prd c-chi (Fam c p) = c---- | getter-par :: Fam prd c p -> Attribution p-par (Fam c p) = p---- | getter (extracts a 'Label')-prd :: Fam prd c p -> Label prd-prd (Fam c p) = Label---- | Rules are a function from the input family to the output family,--- with an extra arity to make them composable. They are indexed by a production.-type Rule- (prd :: Prod)- (sc :: [(Child, [(Att, Type)])])- (ip :: [(Att, Type)])- (ic :: [(Child, [(Att, Type)])])- (sp :: [(Att, Type)])- (ic' :: [(Child, [(Att, Type)])])- (sp' :: [(Att, Type)])- = Fam prd sc ip -> Fam prd ic sp -> Fam prd ic' sp'---- | Rules with context (used to print domain specific type errors).-newtype CRule (ctx :: [ErrorMessage]) prd sc ip ic sp ic' sp'- = CRule { mkRule :: (Proxy ctx -> Rule prd sc ip ic sp ic' sp')}--emptyRule =- CRule $ \Proxy -> \fam inp -> inp--emptyRuleInst :: KList sc -> CRule ctx prd sc ip ic sp ic sp-emptyRuleInst _ =- CRule $ \Proxy -> \fam ->- case fam of- Fam _ _ -> \fam -> fam--emptyRuleAtPrd :: Label prd -> CRule ctx prd sc ip ic' sp' ic' sp'-emptyRuleAtPrd Label = emptyRule---- | Aspects, tagged with context. 'Aspect' is a record instance having--- productions as labels, containing 'Rule's as fields.-newtype CAspect (ctx :: [ErrorMessage]) (asp :: [(Prod, Type)] )- = CAspect { mkAspect :: Proxy ctx -> Aspect asp}---- | Recall that Aspects are mappings from productions to rules. They--- have a record-like interface to build them. This is the constructor--- for the empty Aspect.-emptyAspect :: CAspect ctx '[]-emptyAspect = CAspect $ const EmptyRec---- | combination of two Aspects. It merges them. When both aspects--- have rules for a given production, in the resulting Aspect the rule--- at that field is the combination of the rules for the arguments--- (with 'ext').-comAspect ::- ( Require (OpComAsp al ar) ctx- , ReqR (OpComAsp al ar) ~ Aspect asp- )- => CAspect ctx al -> CAspect ctx ar -> CAspect ctx asp-comAspect al ar- = CAspect $ \ctx -> req ctx (OpComAsp (mkAspect al ctx) (mkAspect ar ctx))----- * Trace utils---- | |traceAspect| adds context to an aspect.-traceAspect (_ :: Proxy (e::ErrorMessage))- = mapCAspect $ \(_ :: Proxy ctx) ->- Proxy @ ((Text "- traceAspect: " :<>: e) : ctx)--traceRule (_ :: Proxy (e::ErrorMessage))- = mapCRule $ \(_ :: Proxy ctx) ->- Proxy @ (Text "- traceRule: " :<>: e : ctx)---mapCRule :: (Proxy ctx -> Proxy ctx')- -> CRule ctx' prd sc ip ic sp ic' sp'- -> CRule ctx prd sc ip ic sp ic' sp'-mapCRule fctx (CRule frule) = CRule $ frule . fctx--mapCAspect fctx (CAspect fasp) = CAspect $- mapCtxRec fctx . fasp . fctx--class MapCtxAsp (r :: [(Prod,Type)]) (ctx :: [ErrorMessage])- (ctx' :: [ErrorMessage]) where- type ResMapCtx r ctx ctx' :: [(Prod,Type)]- mapCtxRec :: (Proxy ctx -> Proxy ctx')- -> Aspect r -> Aspect (ResMapCtx r ctx ctx')--instance- ( MapCtxAsp r ctx ctx' - , ResMapCtx r ctx ctx' ~ r'- )- =>- MapCtxAsp ( '(l, CRule ctx' prd sc ip ic sp ic' sp') ': r) ctx ctx' where- type ResMapCtx ( '(l, CRule ctx' prd sc ip ic sp ic' sp') ': r) ctx ctx'- = '(l, CRule ctx prd sc ip ic sp ic' sp') ': ResMapCtx r ctx ctx'- mapCtxRec fctx (ConsRec (TagField c l r) rs) = (ConsRec (TagField c l- (mapCRule fctx r))- (mapCtxRec fctx rs))--instance MapCtxAsp ('[] :: [(Prod,Type)]) ctx ctx' where- type ResMapCtx ('[] :: [(Prod,Type)]) ctx ctx'- = '[]- mapCtxRec _ EmptyRec = EmptyRec----- | The "cons" for 'CAspect's. It adds a 'Rule' `rule`--- to a 'CAspect'. If there is no rule for that production in the--- argument it is a record extension. If the production is there, the--- rules are combined.-extAspect- :: ExtAspect ctx prd sc ip ic sp ic' sp' a asp =>- CRule ctx prd sc ip ic sp ic' sp'- -> CAspect ctx a -> CAspect ctx asp-extAspect rule (CAspect fasp)- = CAspect $ \ctx -> req ctx (OpComRA rule (fasp ctx))--type ExtAspect ctx prd sc ip ic sp ic' sp' a asp- = (Require- (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') a) ctx,- ReqR (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') a)- ~ Rec PrdReco asp) ---- | An operator, alias for 'extAspect'. It combines a rule with an--- aspect, to build a bigger one.-(.+:) = extAspect-infixr 3 .+:---- | Unicode version of 'extAspect' or '.+:' (\\triangleleft)-(◃) = extAspect-infixr 3 ◃---- | The other way, combines an aspect with a rule. It is a `flip`ped--- 'extAspect'.-(.:+.) = flip extAspect-infixl 3 .:+.---- | Unicode operator for '.:+.' or `flip extAspect`.-(▹) = flip extAspect-infixl 3 ▹----- | Operator for 'comAspect'. It takes two 'CAspect's to build the--- combination of both.-(.:+:) = comAspect-infixr 4 .:+:---- | Unicode operator for 'comAspect' or '.:+:'. (\\bowtie)-(⋈) = comAspect-infixr 4 ⋈--ext' :: RequireEq prd prd' (Text "ext":ctx) =>- CRule ctx prd sc ip ic sp ic' sp'- -> CRule ctx prd' sc ip a b ic sp- -> CRule ctx prd sc ip a b ic' sp'-(CRule f) `ext'` (CRule g)- = CRule $ \ctx input -> f ctx input . g ctx input--type PCRule p ctx prd sc ip ic sp ic' sp'- = Reader p (CRule ctx prd sc ip ic sp ic' sp') ---- | extension of polymorphic rules-extP l r = \(p ::Proxy p) -> l p `ext` r p----- | Given two rules for a given (the same) production, it combines--- them. Note that the production equality is visible in the context,--- not sintactically. This is a use of the 'Require' pattern.-ext :: RequireEq prd prd' (Text "ext":ctx) - => CRule ctx prd sc ip ic sp ic' sp'- -> CRule ctx prd' sc ip a b ic sp- -> CRule ctx prd sc ip a b ic' sp'-ext = ext'---- | Singleton Aspect. Wraps a rule to build an Aspect from it.-singAsp r- = r .+: emptyAspect--infixr 6 .+.-(.+.) = ext----- | combine a rule with an aspect (wrapper)-data OpComRA (ctx :: [ErrorMessage])- (prd :: Prod)- (rule :: Type) -- TODO : doc this- (a :: [(Prod, Type)]) where- OpComRA :: CRule ctx prd sc ip ic sp ic' sp'- -> Aspect a -> OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') a---- | combine a rule with an aspect (inner)-data OpComRA' (cmp :: Ordering)- (ctx :: [ErrorMessage])- (prd :: Prod)- (rule :: Type) -- TODO : doc this- (a :: [(Prod, Type)]) where- OpComRA' :: Proxy cmp- -> CRule ctx prd sc ip ic sp ic' sp'- -> Aspect a- -> OpComRA' cmp ctx prd (CRule ctx prd sc ip ic sp ic' sp') a--cRuleToTagField :: (CRule ctx prd sc ip ic sp ic' sp')- -> TagField PrdReco prd (CRule ctx prd sc ip ic sp ic' sp')-cRuleToTagField =- TagField Label Label--instance- Require (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') '[]) ctx where- type ReqR (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') '[]) =- Aspect '[ '(prd, CRule ctx prd sc ip ic sp ic' sp')]- req ctx (OpComRA rule EmptyRec) =- ConsRec (cRuleToTagField rule) EmptyRec--instance- Require (OpComRA' (Cmp prd prd') ctx prd rule ( '(prd', rule') ': asp )) ctx- =>- Require (OpComRA ctx prd rule ( '(prd', rule') ': asp )) ctx where- type ReqR (OpComRA ctx prd rule ( '(prd', rule') ': asp )) =- ReqR (OpComRA' (Cmp prd prd') ctx prd rule ( '(prd', rule') ': asp ))- req ctx (OpComRA rule asp) =- req ctx (OpComRA' (Proxy @ (Cmp prd prd')) rule asp)--instance- ( Require (OpUpdate PrdReco prd (CRule ctx prd sc ip ic sp ic'' sp'') a) ctx- , Require (OpLookup PrdReco prd a) ctx- , ReqR (OpLookup PrdReco prd a) ~ CRule ctx prd sc ip ic sp ic' sp'- , (IC (ReqR (OpLookup PrdReco prd a))) ~ ic- , (SP (ReqR (OpLookup PrdReco prd a))) ~ sp- ) =>- Require- (OpComRA' 'EQ ctx prd (CRule ctx prd sc ip ic' sp' ic'' sp'') a) ctx where- type ReqR (OpComRA' 'EQ ctx prd (CRule ctx prd sc ip ic' sp' ic'' sp'') a) =- ReqR (OpUpdate PrdReco prd- (CRule ctx prd sc ip- (IC (ReqR (OpLookup PrdReco prd a)))- (SP (ReqR (OpLookup PrdReco prd a)))- ic'' sp'') a)- req ctx (OpComRA' _ crule asp) =- let prd = Label @ prd- oldRule = req ctx (OpLookup prd asp)- newRule = crule `ext` oldRule- in req ctx (OpUpdate prd newRule asp)--instance- ( Require (OpComRA ctx prd rule asp) ctx- , ReqR (OpComRA ctx prd rule asp) ~ Aspect a0- )- =>- Require (OpComRA' 'GT ctx prd rule ( '(prd' , rule') ': asp)) ctx where- type ReqR (OpComRA' 'GT ctx prd rule ( '(prd' , rule') ': asp)) =- Aspect ( '(prd' , rule') ': UnWrap (ReqR (OpComRA ctx prd rule asp)))- req ctx (OpComRA' _ crule (ConsRec crule' asp)) =- ConsRec crule' $ req ctx (OpComRA crule asp)--instance - Require (OpComRA' 'LT ctx prd rule ( '(prd' , rule') ': asp)) ctx where- type ReqR (OpComRA' 'LT ctx prd rule ( '(prd' , rule') ': asp)) =- Aspect ( '(prd, rule) ': '(prd' , rule') ': asp)- req ctx (OpComRA' _ crule asp) =- ConsRec (TagField Label Label crule) asp------ | extract Rule from Aspect--- data OpGetRule (prd :: Prod)--- (a :: [(Prod, Type)]) where--- OpGetRule :: Label prd -> CAspect ctx a -> OpGetRule prd a---- instance--- (Require (OpLookup AttReco prd a) ctx,--- ReqR (OpLookup PrdReco prd a) ~ Rule prd sc ip ic sp ic' sp'--- )--- =>--- Require (OpGetRule prd a) ctx where--- type ReqR (OpGetRule prd a) = ReqR (OpLookup @Prod @Type AttReco prd a)--- req ctx (OpGetRule prd (CAspect ca)) =--- let rule = req ctx (OpLookup prd (ca Proxy))--- in CRule $ \ctx -> rule--data OpGetRA (ctx :: [ErrorMessage])- (prd :: Prod)- (a :: [(Prod, Type)]) where- OpGetRA :: Label prd -> Aspect a -> OpGetRA ctx prd a--instance- (Require (OpLookup PrdReco prd a) ctx)- =>- Require (OpGetRA ctx prd a) ctx where- type ReqR (OpGetRA ctx prd a) = ReqR (OpLookup PrdReco prd a)- req ctx (OpGetRA prd a) = req ctx (OpLookup prd a)--- todo: do not return units when not found----- (.#..)--- :: (Require (OpLookup PrdReco prd r) (('ShowType r : ctx0)),--- ReqR (OpLookup PrdReco prd r) ~ CRule ctx prd sc ip ic sp ic' sp') =>--- CAspect ctx r -> Label prd -> CRule ctx prd sc ip ic sp ic' sp'-ca .#.. prd- = (mkAspect ca Proxy) # prd------- | add rule to an aspect-data OpComAsp (al :: [(Prod, Type)])- (ar :: [(Prod, Type)]) where- OpComAsp :: Aspect al -> Aspect ar -> OpComAsp al ar--instance- Require (OpComAsp '[] ar) ctx where- type ReqR (OpComAsp '[] ar) = Aspect ar- req ctx (OpComAsp _ ar) = ar--instance- ( (ReqR (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') ar))- ~ (Rec PrdReco- (UnWrap- (ReqR (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') ar))))- , ReqR (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') ar)- ~ Rec PrdReco ar0- , (Require (OpComAsp al ar0) ctx)- , (Require- (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') ar) ctx)- ) =>- Require (OpComAsp- ('(prd, CRule ctx prd sc ip ic sp ic' sp') ': al) ar) ctx where- type ReqR (OpComAsp ('(prd, CRule ctx prd sc ip ic sp ic' sp') ': al) ar) =- ReqR (OpComAsp al- (UnWrap (ReqR- (OpComRA ctx prd (CRule ctx prd sc ip ic sp ic' sp') ar))))- req ctx (OpComAsp (ConsRec (TagField _ _ rul) al) ar)- = req ctx (OpComAsp al (req ctx (OpComRA rul ar)))--type family IC (rule :: Type) where- IC (Rule prd sc ip ic sp ic' sp') = ic- IC (CRule ctx prd sc ip ic sp ic' sp') = ic-type family SP (rule :: Type) where- SP (Rule prd sc ip ic sp ic' sp') = sp- SP (CRule ctx prd sc ip ic sp ic' sp') = sp- --type family Syndef t t' ctx att sp sp' prd prd' :: Constraint where- Syndef t t' ctx att sp sp' prd prd' =- ( RequireEqWithMsg t t' AttTypeMatch ctx--- , RequireEqWithMsg prd prd' PrdTypeMatch ctx- , RequireR (OpExtend AttReco ('Att att t) t' sp) ctx (Attribution sp')- )--data AttTypeMatch (a::k)(b::k) -- where- -- AttTypeMatch :: a -> b -> AttTypeMatch a b-type instance Eval (AttTypeMatch t1 t2) =- ( ShowTE t1 :<>: Text " /= " :<>: ShowTE t2 :$$:- Text "type mismatch in attribute definition" :$$:- Text "attribute type does not match with \- \the computation that defines it")--data PrdTypeMatch (a :: k)(b :: k)-type instance Eval (PrdTypeMatch t1 t2) =- ( ShowTE t1 :<>: Text " /= " :<>: ShowTE t2 :$$:- Text "mismatch in production type. \- \Perhaps you are trying to get data from a \- \children of a wrong production?")--data ChiPrdMatch (a :: Prod)(b :: Prod)-type instance Eval (ChiPrdMatch ('Prd att nt) ('Prd att' nt')) =- ( ShowTE ('Prd att nt) :<>: Text " /= " :<>: ShowTE ('Prd att' nt') :$$:- Text "production and child mismatch in inherited attribute definition")---data GetAttTypeMatch (a::k)(b::k) where- GetAttTypeMatch :: a -> b -> GetAttTypeMatch a b-type instance Eval (GetAttTypeMatch t1 t2) =- ( ShowTE t1 :<>: Text " /= " :<>: ShowTE t2 :$$:- Text "ill typed attribute computation")---- | The function 'syndef' adds the definition of a synthesized--- attribute. It takes an attribute label 'att' representing the--- name of the new attribute; a production label 'prd' representing--- the production where the rule is defined; a value 't'' to be--- assigned to this attribute, given a context and an input--- family. It updates the output constructed thus far.-syndef- :: Syndef t t' ctx att sp sp' prd prd' - => forall sc ip ic .- Label ('Att att t)- -> Label prd- -> (Proxy ctx -> Fam prd' sc ip -> t')- -> CRule ctx prd sc ip ic sp ic sp'-syndef att prd f- = CRule $ \ctx inp (Fam ic sp)- -> Fam ic $ req ctx (OpExtend att (f Proxy inp) sp)---data SyndefT t t' (ctx :: [ErrorMessage])- (att :: Symbol)- (sp :: [(Att, Type)])- (sp' :: [(Att, Type)]) prd prd'--class Syndef' a-instance- ( RequireEqWithMsg t t' AttTypeMatch ctx--- , RequireEqWithMsg prd prd' PrdTypeMatch ctx- , RequireR (OpExtend AttReco ('Att att t) t' sp) ctx (Attribution sp')- )- => Syndef' (SyndefT t t' ctx att sp sp' prd prd' )--data Dummy-instance Syndef' Dummy---- syndef'--- :: Syndef' (SyndefT t t' ctx att sp sp' prd prd') --- => forall sc ip ic .--- Label ('Att att t)--- -> Label prd--- -> (Proxy ctx -> Fam prd' sc ip -> t')--- -> CRule ctx prd' sc ip ic sp ic sp'--- syndef' att prd f--- = CRule $ \ctx inp (Fam ic sp)--- -> Fam ic $ req ctx (OpExtend att (f Proxy inp) sp)------- | As 'syndef', the function 'syndefM' adds the definition of a--- synthesized attribute. It takes an attribute label 'att'--- representing the name of the new attribute; a production label--- 'prd' representing the production where the rule is defined; a--- value 't'' to be assigned to this attribute, given a context and--- an input family. It updates the output constructed thus far. This--- function captures the monadic behaviour of the family--- updating. For instance, the following definition specifies a rule--- for an attribute `att_size :: Label (Att "size" Int)` at the--- prduction `p_cons :: Label (Prd "cons" (NT "List"))`. The value--- is computed from the very same attribute value at a child--- `ch_tail :: Chi "tail" (Prd "cons" (NT "List") (Left NT))`------ @--- foo = syndefM att_size p_cons $ do sizeatchi <- at ch_tail att_size--- return (sizeatchi + 1)--- @---data SyndefMsg-data InhdefMsg--type family MkMsg msgtype att t prd nt where- MkMsg SyndefMsg att t prd nt =- Text "- syndef: definition of attribute "- :<>: ShowTE ('Att att t) :$$: Text " in production "- :<>: ShowTE ('Prd prd nt)- MkMsg InhdefMsg att t prd nt =- Text "- inhdef: definition of attribute "- :<>: ShowTE ('Att att t) :$$: Text " in production "- :<>: ShowTE ('Prd prd nt)--mkSyndefMsg :: Label ('Att att t) -> Label ('Prd prd nt)- -> Proxy (MkMsg SyndefMsg att t prd nt)-mkSyndefMsg Label Label = Proxy--mkMsg :: Proxy msg -> Label ('Att att t) -> Label ('Prd prd nt)- -> Proxy (MkMsg msg att t prd nt)-mkMsg Proxy Label Label = Proxy----- | This is simply an alias for 'syndef'-syn- :: Syndef t t' (MkMsg SyndefMsg att t prd nt ': ctx) att sp sp' prd prd'- => Label ('Att att t)- -> Label ('Prd prd nt)- -> Reader (Proxy (MkMsg SyndefMsg att t prd nt ': ctx),- Fam ('Prd prd' nt) sc ip) t'- -> CRule ctx ('Prd prd nt) sc ip ic sp ic sp'-syn att prd f- = mapCRule (mkSyndefMsg att prd `consErr`) $ (syndef att prd . def) f--syndefM- :: Syndef t t' (MkMsg SyndefMsg att t prd nt ': ctx) att sp sp' prd prd'- => Label ('Att att t)- -> Label ('Prd prd nt)- -> Reader (Proxy (MkMsg SyndefMsg att t prd nt ': ctx),- Fam ('Prd prd' nt) sc ip) t'- -> CRule ctx ('Prd prd nt) sc ip ic sp ic sp'-syndefM att prd f- = mapCRule (mkMsg (Proxy @SyndefMsg) att prd `consErr`)- $ (syndef att prd . def) f---- |synthesized poly rule---synP (att :: forall v. Label ('Att k v)) prd rul--- = \(p :: Proxy p) -> syndefM (att @ p) prd rul---- | This is simply an alias for 'inhdefM'---inh = inhdefM----inhP (att :: forall v. Label ('Att k v)) prd chi rul--- = \(p :: Proxy p) -> inhdefM (att @ p) prd chi rul--synmod- :: RequireR (OpUpdate AttReco ('Att att t) t r) ctx (Attribution sp')- => Label ('Att att t)- -> Label prd- -> (Proxy- ((('Text "synmod(" ':<>: ShowTE ('Att att t)) :<>: Text ", "- ':<>: ShowTE prd :<>: Text ")")- : ctx)- -> Fam prd sc ip -> t)- -> CRule ctx prd sc ip ic' r ic' sp'-synmod att prd f- = CRule $ \ctx inp (Fam ic sp)- -> Fam ic $ req ctx (OpUpdate att (f Proxy inp) sp)---synmodM- :: RequireR (OpUpdate AttReco ('Att att t) t r) ctx (Attribution sp')- => Label ('Att att t)- -> Label prd- -> Reader ( Proxy ((('Text "synmod(" ':<>: ShowTE ('Att att t)) :<>: Text ", "- ':<>: ShowTE prd :<>: Text ")")- : ctx)- , Fam prd sc ip)- t- -> CRule ctx prd sc ip ic' r ic' sp'-synmodM att prd = synmod att prd . def---type family Inhdef t t' ctx att r v2 prd prd' nt nt' chi ntch ic ic' n- where- Inhdef t t' ctx att r v2 prd prd' nt nt' chi ntch ic ic' n- = ( RequireEqWithMsg t t' AttTypeMatch ctx- , RequireEqWithMsg ('Prd prd nt) ('Prd prd' nt') ChiPrdMatch ctx- --, RequireEq nt nt' ctx- , RequireR (OpExtend AttReco ('Att att t) t' r) ctx (Attribution v2)- , RequireR (OpUpdate (ChiReco ('Prd prd nt))- ('Chi chi ('Prd prd' nt') ntch) v2 ic) ctx- (ChAttsRec ('Prd prd' nt') ic')- , RequireR (OpLookup (ChiReco ('Prd prd nt))- ('Chi chi ('Prd prd' nt') ntch) ic) ctx (Attribution r)- --, ntch ~ ('Left n)- )--inhdef- :: Inhdef t t' ctx att r v2 prd prd' nt nt' chi ntch ic ic' n- => Label ('Att att t)- -> Label ('Prd prd nt)- -> Label ('Chi chi ('Prd prd' nt') ntch)- -> (Proxy ctx -> Fam ('Prd prd nt) sc ip -> t')- -> forall sp . CRule ctx ('Prd prd nt) sc ip ic sp ic' sp--inhdef att prd chi f =- CRule $ \ctx inp (Fam ic sp) ->- let ic' = req ctx (OpUpdate chi catts' ic)- catts = req ctx (OpLookup chi ic)- catts' = req ctx (OpExtend att (f Proxy inp) catts)- in Fam ic' sp---inhdefM- :: Inhdef t t' (MkMsg InhdefMsg att t prd nt ': ctx)- att r v2 prd prd' nt nt' chi ntch ic ic' n- => Label ('Att att t)- -> Label ('Prd prd nt)- -> Label ('Chi chi ('Prd prd' nt') ntch)- -> Reader (Proxy (MkMsg InhdefMsg att t prd nt ': ctx), Fam ('Prd prd nt) sc ip) t'- -> CRule ctx ('Prd prd nt) sc ip ic sp ic' sp-inhdefM att prd chi f = mapCRule (mkMsg (Proxy @InhdefMsg) att prd `consErr`)- $ (inhdef att prd chi . def) f--inh- :: Inhdef t t' (MkMsg InhdefMsg att t prd nt ': ctx)- att r v2 prd prd' nt nt' chi ntch ic ic' n- => Label ('Att att t)- -> Label ('Prd prd nt)- -> Label ('Chi chi ('Prd prd' nt') ntch)- -> Reader (Proxy (MkMsg InhdefMsg att t prd nt ': ctx), Fam ('Prd prd nt) sc ip) t'- -> CRule ctx ('Prd prd nt) sc ip ic sp ic' sp-inh att prd chi f = mapCRule (mkMsg (Proxy @InhdefMsg) att prd `consErr`)- $ (inhdef att prd chi . def) f---inhmod- :: ( RequireEq t t' ctx'- , RequireR (OpUpdate AttReco ('Att att t) t' r) ctx- (Attribution v2)- , RequireR (OpUpdate (ChiReco ('Prd prd nt))- ('Chi chi ('Prd prd nt) ntch) v2 ic) ctx- (ChAttsRec ('Prd prd nt) ic')- , RequireR (OpLookup (ChiReco ('Prd prd nt))- ('Chi chi ('Prd prd nt) ntch) ic) ctx- (Attribution r)- , ntch ~ ('Left n)- , ctx' ~ ((Text "inhmod("- :<>: ShowTE ('Att att t) :<>: Text ", "- :<>: ShowTE ('Prd prd nt) :<>: Text ", "- :<>: ShowTE ('Chi chi ('Prd prd nt) ntch) :<>: Text ")")- ': ctx))- =>- Label ('Att att t)- -> Label ('Prd prd nt)- -> Label ('Chi chi ('Prd prd nt) ntch)- -> (Proxy ctx' -> Fam ('Prd prd nt) sc ip -> t')- -> CRule ctx ('Prd prd nt) sc ip ic sp ic' sp-inhmod att prd chi f- = CRule $ \ctx inp (Fam ic sp)- -> let ic' = req ctx (OpUpdate chi catts' ic)- catts = req ctx (OpLookup chi ic)- catts'= req ctx (OpUpdate att (f Proxy inp) catts)- in Fam ic' sp---inhmodM- :: ( RequireEq t t' ctx'- , RequireR (OpUpdate AttReco ('Att att t) t' r) ctx- (Attribution v2)- , RequireR (OpUpdate (ChiReco ('Prd prd nt))- ('Chi chi ('Prd prd nt) ntch) v2 ic) ctx- (ChAttsRec ('Prd prd nt) ic')- , RequireR (OpLookup (ChiReco ('Prd prd nt))- ('Chi chi ('Prd prd nt) ntch) ic) ctx- (Attribution r)- , ntch ~ ('Left n)- , ctx' ~ ((Text "inhmod("- :<>: ShowTE ('Att att t) :<>: Text ", "- :<>: ShowTE ('Prd prd nt) :<>: Text ", "- :<>: ShowTE ('Chi chi ('Prd prd nt) ntch) :<>: Text ")")- ': ctx))- =>- Label ('Att att t)- -> Label ('Prd prd nt)- -> Label ('Chi chi ('Prd prd nt) ntch)- -> Reader (Proxy ctx', Fam ('Prd prd nt) sc ip) t'- -> CRule ctx ('Prd prd nt) sc ip ic sp ic' sp-inhmodM att prd chi = inhmod att prd chi . def--data Lhs-lhs :: Label Lhs-lhs = Label--class Monad m => At pos att m where- type ResAt pos att m- at :: Label pos -> Label att -> m (ResAt pos att m)---instance ( RequireR (OpLookup (ChiReco prd') ('Chi ch prd nt) chi) ctx- (Attribution r)- , RequireR (OpLookup AttReco ('Att att t) r) ctx t'- , RequireEqWithMsg prd prd' PrdTypeMatch ctx- , RequireEqWithMsg t t' GetAttTypeMatch ctx- , ReqR (OpLookup @Att @Type AttReco ('Att att t')- (UnWrap @Att @Type (Rec AttReco r)))- ~ t' - , r ~ UnWrap (Attribution r)- )- => At ('Chi ch prd nt) ('Att att t)- (Reader (Proxy ctx, Fam prd' chi par)) where- type ResAt ('Chi ch prd nt) ('Att att t) (Reader (Proxy ctx, Fam prd' chi par))- = ReqR (OpLookup AttReco ('Att att t)- (UnWrap @Att @Type (ReqR (OpLookup (ChiReco prd) ('Chi ch prd nt) chi))))- at ch att- = liftM (\(ctx, Fam chi _) -> let atts = req ctx (OpLookup ch chi)- in req ctx (OpLookup att atts))- ask----instance- ( RequireR (OpLookup @Att @Type AttReco ('Att att t) par) ctx t- , RequireEqWithMsg t t' AttTypeMatch ctx- )- =>- At Lhs ('Att att t) (Reader (Proxy ctx, Fam prd chi par)) where- type ResAt Lhs ('Att att t) (Reader (Proxy ctx, Fam prd chi par))- = ReqR (OpLookup @Att @Type AttReco ('Att att t) (UnWrap @Att @Type (Rec AttReco par)))- at lhs att- = liftM (\(ctx, Fam _ par) -> req ctx (OpLookup att par)) ask--def = curry . runReader--ter :: ( RequireR (OpLookup (ChiReco prd) pos chi) ctx- (Attribution r)- , RequireR (OpLookup AttReco ('Att "term" t) r) ctx t- , RequireEqWithMsg prd prd' PrdTypeMatch ctx- , ReqR (OpLookup AttReco ('Att "term" t) (UnWrap @Att @Type (Attribution r)))- ~ t- , RequireEq pos ('Chi ch prd rtt) ctx- , RequireEq rtt (Right ('T t)) ctx)- => Label pos -> Reader (Proxy ctx, Fam prd' chi par) t-ter (ch :: Label ('Chi ch prd rtt))- = liftM (\(ctx, Fam chi _) ->- let atts = req ctx (OpLookup ch chi)- in req ctx (OpLookup (lit @(FromT (FromRight rtt))) atts))- ask--type family FromRight (t :: Either a b) :: b where- FromRight (Right t) = t--type family FromT (t :: T) :: b where- FromT ('T t) = t----- ter :: ( RequireR (OpLookup (ChiReco prd) pos chi) ctx--- (Attribution r)--- , RequireR (OpLookup AttReco ('Att "term" t) r) ctx t--- , RequireEqWithMsg prd prd' PrdTypeMatch ctx--- , ReqR (OpLookup AttReco ('Att "term" t) (UnWrap @Att @Type (Attribution r)))--- ~ t--- , RequireEq pos ('Chi ch prd (Right ('T t))) ctx--- , m ~ Reader (Proxy ctx, Fam prd' chi par) )--- => Label pos -> m t -- (ResAt pos ('Att "term" t) m) --- ter (ch :: Label ('Chi ch prd (Right ('T t))))--- = liftM (\(ctx, Fam chi _) -> let atts = req ctx (OpLookup ch chi)--- in req ctx (OpLookup (lit @ t) atts))--- ask---type instance (UnWrap (Attribution r)) = r-type instance (UnWrap @Att @Type (Rec c r)) = r---class Kn (fcr :: [(Child, Type)]) (prd :: Prod) where- type ICh fcr :: [(Child, [(Att, Type)])]- type SCh fcr :: [(Child, [(Att, Type)])]- kn :: Record fcr -> ChAttsRec prd (ICh fcr) -> ChAttsRec prd (SCh fcr)--instance Kn '[] prod where- type ICh '[] = '[]- type SCh '[] = '[] - kn _ _ = emptyCh--instance- Kn fc prd- =>- Kn ( '(lch , Attribution ich -> Attribution sch) ': fc) prd where- type ICh ( '(lch , Attribution ich -> Attribution sch) ': fc)- = '(lch , ich) ': ICh fc- type SCh ( '(lch , Attribution ich -> Attribution sch) ': fc)- = '(lch , sch) ': SCh fc- kn ((ConsRec (TagField _ lch fch) (fcr :: Record fc)))- = \((ConsRec pich icr) :: ChAttsRec prd ( '(lch, ich) ': ICh fc))- -> let scr = kn fcr icr- ich = unTaggedChAttr pich- in ConsRec (TaggedChAttr lch- (fch ich)) scr----emptyCtx = Proxy @ '[]--knit'- :: ( Kn fc prd- , Empties fc prd)- => CRule '[] prd (SCh fc) ip (EmptiesR fc) '[] (ICh fc) sp- -> Record fc -> Attribution ip -> Attribution sp-knit' (rule :: CRule '[] prd (SCh fc) ip- (EmptiesR fc) '[] (ICh fc) sp)- (fc :: Record fc) ip =- let (Fam ic sp) = mkRule rule emptyCtx- (Fam sc ip) (Fam ec emptyAtt)- sc = kn fc ic- ec = empties fc- in sp---class Empties (fc :: [(Child,Type)]) (prd :: Prod) where- type EmptiesR fc :: [(Child, [(Att, Type)])] - empties :: Record fc -> ChAttsRec prd (EmptiesR fc)--instance Empties '[] prd where- type EmptiesR '[] = '[]- empties _ = emptyCh--instance- ( Empties fcr prd- -- , chi ~ 'Chi ch prd nt- )- =>- Empties ( '(chi, Attribution e -> Attribution a) ': fcr) prd where- type EmptiesR ( '(chi, Attribution e -> Attribution a) ': fcr) =- '(chi, '[]) ': EmptiesR fcr- empties (ConsRec (TagField labelc- (labelch :: Label chi) fch) r) =- ConsRec (TagField (Label @(ChiReco prd)) labelch emptyAtt) $ empties r---knit (ctx :: Proxy ctx)- (rule :: CRule ctx prd (SCh fc) ip (EmptiesR fc) '[] (ICh fc) sp)- (fc :: Record fc)- (ip :: Attribution ip)- = let (Fam ic sp) = mkRule rule ctx- (Fam sc ip) (Fam ec emptyAtt)- sc = kn fc ic- ec = empties fc- in sp---knitAspect (prd :: Label prd) asp fc ip- = let ctx = Proxy @ '[]- ctx' = Proxy @ '[Text ("knit:" `AppendSymbol` FromEM (ShowTE prd))]- in knit ctx (req ctx' (OpLookup prd ((mkAspect asp) ctx))) fc ip---- | use-class Use (att :: Att) (prd :: Prod) (nts :: [NT]) (a :: Type) sc- where- usechi :: Label att -> Label prd -> KList nts -> (a -> a -> a) -> ChAttsRec prd sc- -> Maybe a--class Use' (mnts :: Bool) (att :: Att) (prd :: Prod) (nts :: [NT])- (a :: Type) sc- where- usechi' :: Proxy mnts -> Label att -> Label prd -> KList nts- -> (a -> a -> a)- -> ChAttsRec prd sc -> Maybe a--instance Use prd att nts a '[] where- usechi _ _ _ _ _ = Nothing--instance- ( HMember' nt nts- , HMemberRes' nt nts ~ mnts- , Use' mnts att prd nts a ( '( 'Chi ch prd ('Left nt), attr) ': cs))- =>- Use att prd nts a ( '( 'Chi ch prd ('Left nt), attr) ': cs) where- usechi att prd nts op ch- = usechi' (Proxy @ mnts) att prd nts op ch--instance- Use att prd nts a cs- =>- Use att prd nts a ( '( 'Chi ch prd ('Right t), attr) ': cs) where- usechi att prd nts op (ConsRec _ ch)- = usechi att prd nts op ch---instance- Use att prd nts a cs- =>- Use' False att prd nts a ( '( 'Chi ch prd ('Left nt), attr) ': cs) where- usechi' _ att prd nts op (ConsRec _ cs) = usechi att prd nts op cs--instance- ( Require (OpLookup AttReco att attr)- '[('Text "looking up attribute " ':<>: ShowTE att)- ':$$: ('Text "on " ':<>: ShowTE attr)]- , ReqR (OpLookup AttReco att attr) ~ a- , Use att prd nts a cs- , WrapField (ChiReco prd) attr ~ Attribution attr) --ayudín- =>- Use' True att prd nts a ( '( 'Chi ch prd ('Left nt), attr) : cs) where- usechi' _ att prd nts op (ConsRec lattr scr) =- let attr = unTaggedChAttr lattr- val = attr #. att- in Just $ maybe val (op val) $ usechi att prd nts op scr----- | Defines a rule to compute an attribute 'att' in the production--- 'prd', by applying an operator to the values of 'att' in each non--- terminal in the list 'nts'.---- use--- :: UseC att prd nts t' sp sc sp' ctx--- => Label ('Att att t')--- -> Label prd--- -> KList nts--- -> (t' -> t' -> t')--- -> t'--- -> forall ip ic' . CRule ctx prd sc ip ic' sp ic' sp'--- use att prd nts op unit--- = syndef att prd--- $ \_ fam -> maybe unit id (usechi att prd nts op $ chi fam)---type UseC att prd nts t' sp sc sp' ctx =- ( Require (OpExtend AttReco ('Att att t') t' sp) ctx- , Use ('Att att t') prd nts t' sc- , ReqR (OpExtend AttReco ('Att att t') t' sp)- ~ Rec AttReco sp'- )--class EmptyAspectSameShape (es1 :: [k]) (es2 :: [m])--instance (es2 ~ '[]) => EmptyAspectSameShape '[] es2-instance (EmptyAspectSameShape xs ys, es2 ~ ( '(y1,y2,y3,y4) ': ys))- => EmptyAspectSameShape (x ': xs) es2----- require KLIST de prods?, NO, eso está en el kind!-class- EmptyAspectSameShape prds polyArgs- =>- EmptyAspect (prds :: [Prod])- (polyArgs :: [([(Child, [(Att, Type)])], [(Att, Type)],- [(Child, [(Att, Type)])], [(Att, Type)] )])- ctx where- type EmptyAspectR prds polyArgs ctx :: [(Prod, Type)]- emptyAspectC :: KList prds -> Proxy polyArgs- -> CAspect ctx (EmptyAspectR prds polyArgs ctx)--instance- EmptyAspect '[] '[] ctx where- type EmptyAspectR '[] '[] ctx = '[]- emptyAspectC _ _ = emptyAspect--instance- ( EmptyAspect prds polys ctx- , ExtAspect ctx prd sc ip ic sp ic sp- (EmptyAspectR prds polys ctx)- (EmptyAspectR (prd ': prds) ( '(sc, ip, ic, sp) ': polys) ctx)- )- =>- EmptyAspect (prd ': prds) ( '(sc, ip, ic, sp) ': polys) ctx where- type EmptyAspectR (prd ': prds) ( '(sc, ip, ic, sp) ': polys) ctx =- UnWrap (ReqR (OpComRA '[] prd ((CRule '[] prd sc ip ic sp ic sp))- (EmptyAspectR prds polys ctx)))- emptyAspectC (KCons prd prds) (p :: Proxy ( '(sc, ip, ic, sp) ': polys)) =- (emptyRule :: CRule ctx prd sc ip ic sp ic sp) - .+: emptyAspectC @prds @polys prds (Proxy @ polys)--emptyAspectForProds prdList = emptyAspectC prdList Proxy---- ** copy rules---- | a rule to copy one attribute `att` from the parent to the children `chi`--copyAtChi att chi- = inhdef att (prdFromChi chi) chi (at lhs att)----copyAtChiP (att :: forall t. Label ('Att "" t)) chi--- = \(p :: Proxy val) -> inhP (att @val) (prdFromChi chi) chi (at lhs att)----- | to copy at many children-class CopyAtChiList (att :: Att)- (chi :: [Child])- (polyArgs :: [([(Child, [(Att, Type)])], [(Att, Type)],- [(Child, [(Att, Type)])], [(Att, Type)],- [(Child, [(Att, Type)])], [(Att, Type)] )])- ctx where- type CopyAtChiListR att chi polyArgs ctx :: [(Prod, Type)]- copyAtChiList :: Label att -> KList chi -> Proxy polyArgs- -> CAspect ctx (CopyAtChiListR att chi polyArgs ctx)--instance CopyAtChiList att '[] '[] ctx where- type CopyAtChiListR att '[] '[] ctx = '[]- copyAtChiList _ _ _ = emptyAspect---- instance--- ( CopyAtChiList ('Att att t) chi polys ctx--- , prd ~ Prd p nt--- , tnt ~ Left nc--- )--- =>--- CopyAtChiList ('Att att t) (Chi ch prd tnt ': chi)--- ('(sc, ip, ic, sp, ic', sp') ': polys) ctx where--- type CopyAtChiListR ('Att att t) (Chi ch prd tnt ': chi)--- ('(sc, ip, ic, sp, ic', sp') ': polys) ctx =--- UnWrap (ReqR (OpComRA '[] prd ((CRule '[] prd sc ip ic sp ic' sp'))--- (CopyAtChiListR ('Att att t) chi polys ctx)))--- copyAtChiList att (KCons chi chs :: KList ('Chi ch prd tnt ': chs) )--- (p :: Proxy ( '(sc, ip, ic, sp, ic', sp') ': polys))--- = copyAtChi att chi--- .+: copyAtChiList @('Att att t) @chs att chs (Proxy @polys)------- * Productions---data Symbol = N String | Te Name-type family Terminal s :: Either NT T where- Terminal s = 'Right ('T s)--type family NonTerminal s where- NonTerminal s = 'Left s---(+++) :: Proxy e1 -> Proxy e2 -> Proxy (e1 :$$: e2)-Proxy +++ Proxy = Proxy--consErr :: Proxy e -> Proxy es -> Proxy (e : es)-consErr Proxy Proxy = Proxy
− src/Language/Grammars/AspectAG/HList.hs
@@ -1,86 +0,0 @@-{-|-Module : Language.Grammars.AspectAG.HList-Description : Heterogeneous Lists for AAG, inspired on HList-Copyright : (c) Juan García Garland, 2018 -License : LGPL-Maintainer : jpgarcia@fing.edu.uy-Stability : experimental-Portability : POSIX--Implementation of strongly typed heterogeneous lists.--}--{-# LANGUAGE TypeInType,- GADTs,- KindSignatures,- TypeOperators,- TypeFamilies,- MultiParamTypeClasses,- FlexibleInstances,- FlexibleContexts,- StandaloneDeriving,- UndecidableInstances,- FunctionalDependencies,- ConstraintKinds,- ScopedTypeVariables-#-}--module Language.Grammars.AspectAG.HList where--import Data.Type.Bool-import Data.GenRec.Label-import Data.Proxy-import Data.Type.Equality-import Data.Kind-import GHC.Exts---- |Heterogeneous lists are implemented as a GADT-data HList (l :: [Type]) :: Type where- HNil :: HList '[]- HCons :: x -> HList xs -> HList (x ': xs)----- | HMember is a test membership function.---Since we are in Haskell the value level function computes with the evidence -class HMember (t :: Type) (l :: [Type]) where- type HMemberRes t l :: Bool- hMember :: Label t -> HList l -> Proxy (HMemberRes t l)--instance HMember t '[] where- type HMemberRes t '[] = 'False- hMember _ _ = Proxy--instance HMember t (t' ': ts) where- type HMemberRes t (t' ': ts) = t == t' || HMemberRes t ts- hMember _ _ = Proxy---- | HMember' is a test membership function.--- But looking up in a list of Labels-class HMember' (t :: k) (l :: [k]) where- type HMemberRes' t l :: Bool- hMember' :: f t -> KList l -> Proxy (HMemberRes' t l)--instance HMember' t '[] where- type HMemberRes' t '[] = 'False- hMember' _ _ = Proxy--instance HMember' t (t' ': ts) where- type HMemberRes' t (t' ': ts) = t == t' || HMemberRes' t ts- hMember' _ _ = Proxy----- | No other functionality is needed for AAG--infixr 2 .:-(.:) = HCons-ε = HNil---- | a polykinded heteogeneous list-data KList (l :: [k]) :: Type where- KNil :: KList '[]- KCons :: Label h -> KList l -> KList (h ': l)--infixr 2 .:.-(.:.) = KCons-eL = KNil-
− src/Language/Grammars/AspectAG/RecordInstances.hs
@@ -1,284 +0,0 @@--{-# OPTIONS_GHC -fno-warn-missing-methods #-}--{-# LANGUAGE DataKinds,- TypeOperators,- PolyKinds,- GADTs,- TypeInType,- RankNTypes,- StandaloneDeriving,- FlexibleInstances,- FlexibleContexts,- ConstraintKinds,- MultiParamTypeClasses,- FunctionalDependencies,- UndecidableInstances,- ScopedTypeVariables,- TypeFamilies,- InstanceSigs,- AllowAmbiguousTypes,- TypeApplications,- PatternSynonyms,- PartialTypeSignatures-#-}--module Language.Grammars.AspectAG.RecordInstances where--import Data.Type.Require-import Data.GenRec-import GHC.TypeLits-import Data.Kind-import Data.Proxy--data Att = Att Symbol Type -- deriving Eq-data Prod = Prd Symbol NT -- deriving Eq-data Child = Chi Symbol Prod (Either NT T) -- deriving Eq-data NT = NT Symbol -- deriving Eq-data T = T Type -- deriving Eq--prdFromChi :: Label (Chi nam prd tnt) -> Label prd-prdFromChi _ = Label---instance OrdType Att where- type Cmp ('Att a _) ('Att b _)- = CmpSymbol a b--instance OrdType Prod where - type Cmp ('Prd a _) ('Prd b _)- = CmpSymbol a b--instance OrdType Child where- type Cmp ('Chi a _ _) ('Chi b _ _) = CmpSymbol a b---type instance ShowTE ('Att l t) = Text ("(" `AppendSymbol` l- `AppendSymbol` ":" `AppendSymbol` FromEM(ShowTE t) `AppendSymbol`- ")")--type instance ShowTE ('Prd l nt) = Text ( "(" `AppendSymbol` l- `AppendSymbol` " of " `AppendSymbol` FromEM (ShowTE nt)- `AppendSymbol` ")")--type instance ShowTE ('Chi l p s) = Text ("Child " `AppendSymbol` l- `AppendSymbol` " of producion " `AppendSymbol` FromEM (ShowTE p))- -type instance ShowTE ('Left l) = ShowTE l-type instance ShowTE ('Right r) = ShowTE r-type instance ShowTE ('NT l) = Text ("Non-Terminal " `AppendSymbol` l)-type instance ShowTE ('T l)- = Text ("Terminal " `AppendSymbol` FromEM (ShowTE l))----type instance ShowLabel (l :: Symbol) = l---type instance ShowLabel (c :: k) = FromEM (ShowTE c)---- | * Records---- | datatype definition-type Record = Rec Reco---- | index type-data Reco---- | field type-type instance WrapField Reco (v :: Type) = v---- | Type level show utilities-type instance ShowRec Reco = "Record"-type instance ShowField Reco = "field"---type Tagged = TagField Reco-pattern Tagged :: v -> Tagged l v-pattern Tagged v = TagField Label Label v----- ** Constructors---- -- | Pretty Constructor--- infixr 4 .=.--- (.=.) :: Label l -> v -> Tagged l v--- l .=. v = Tagged v---- -- | For the empty Record--- emptyRecord :: Record '[]--- emptyRecord = EmptyRec---- unTagged :: Tagged l v -> v--- unTagged (TagField _ _ v) = v---- -- * Destructors--- -- | Get a label--- label :: Tagged l v -> Label l--- label _ = Label---- -- | Same, mnemonically defined--- labelTChAtt :: Tagged l v -> Label l--- labelTChAtt _ = Label----- -- | Show instance, used for debugging--- instance Show (Record '[]) where--- show _ = "{}"---- instance (Show v, Show (Record xs)) =>--- Show (Record ( '(l,v) ': xs ) ) where--- show (ConsRec lv xs) = let tail = show xs--- in "{" ++ show (unTagged lv)--- ++ "," ++ drop 1 tail------ | * Attribution--- | An attribution is a record constructed from attributes---- | datatype implementation-type Attribution (attr :: [(Att,Type)]) = Rec AttReco attr---- | index type-data AttReco---- | field type-type instance WrapField AttReco (v :: Type) = v---- | type level utilities-type instance ShowRec AttReco = "Attribution"-type instance ShowField AttReco = "attribute"---- | Pattern Synonyms--- pattern EmptyAtt :: Attribution '[]--- pattern EmptyAtt = EmptyRec--- pattern ConsAtt :: LabelSet ( '(att, val) ': atts) =>--- Attribute att val -> Attribution atts -> Attribution ( '(att,val) ': atts)--- pattern ConsAtt att atts = ConsRec att atts---- | Attribute--type Attribute (l :: Att) (v :: Type) = TagField AttReco l v-pattern Attribute :: v -> TagField AttReco l v-pattern Attribute v = TagField Label Label v---- ** Constructors--- | Apretty constructor for an attribute -infixr 4 =.--(=.) :: Label l -> v -> Attribute l v-Label =. v = Attribute v----- | Extending-infixr 2 *.--- (*.) :: Attribute att val -> Attribution atts--- -> Attribution (ReqR (OpExtend AttReco att val atts) ctx)-(l :: Attribute att val) *. (r :: Attribution atts) = l .*. r---- | Empty-emptyAtt :: Attribution '[]-emptyAtt = EmptyRec---- ** Destructors-infixl 7 #.--(#.) ::- ( msg ~ '[Text "looking up attribute " :<>: ShowTE l :$$:- Text "on " :<>: ShowTE r- ]- , Require (OpLookup AttReco l r) msg- )- => Attribution r -> Label l -> ReqR (OpLookup AttReco l r)-(attr :: Attribution r) #. (l :: Label l)- = let prctx = Proxy @ '[Text "looking up attribute " :<>: ShowTE l :$$:- Text "on " :<>: ShowTE r- ]- in req prctx (OpLookup @_ @(AttReco) l attr)----- * Children--- | operations for the children---- | datatype implementation-type ChAttsRec prd (chs :: [(Child,[(Att,Type)])])- = Rec (ChiReco prd) chs---- | index type-data ChiReco (prd :: Prod)---- | Field type-type instance WrapField (ChiReco prd) v- = Attribution v---- | Type level Show utilities-type instance ShowRec (ChiReco a) = "Children Map"-type instance ShowField (ChiReco a) = "child labelled "---- ** Pattern synonyms---- |since now we implement ChAttsRec as a generic record, this allows us to--- recover pattern matching--- pattern EmptyCh :: ChAttsRec prd '[]--- pattern EmptyCh = EmptyRec--- pattern ConsCh :: (LabelSet ( '( 'Chi ch prd nt, v) ': xs)) =>--- TaggedChAttr prd ( 'Chi ch prd nt) v -> ChAttsRec prd xs--- -> ChAttsRec prd ( '( 'Chi ch prd nt,v) ': xs)--- pattern ConsCh h t = ConsRec h t---- | Attributions tagged by a child-type TaggedChAttr prd = TagField (ChiReco prd)-pattern TaggedChAttr :: Label l -> WrapField (ChiReco prd) v- -> TaggedChAttr prd l v-pattern TaggedChAttr l v- = TagField (Label :: Label (ChiReco prd)) l v----- ** Constructors--- | Pretty constructor for tagging a child-infixr 4 .=-(.=) :: Label l -> WrapField (ChiReco prd) v -> TaggedChAttr prd l v-(.=) = TaggedChAttr---- | Pretty constructors-infixr 2 .*-(tch :: TaggedChAttr prd ch attrib) .* (chs :: ChAttsRec prd attribs) = tch .*. chs--- TODO: error instances if different prds are used?---- | empty-emptyCh :: ChAttsRec prd '[]-emptyCh = EmptyRec---- ** Destructors-unTaggedChAttr :: TaggedChAttr prd l v -> WrapField (ChiReco prd) v-unTaggedChAttr (TaggedChAttr _ a) = a--labelChAttr :: TaggedChAttr prd l a -> Label l-labelChAttr _ = Label--infixl 8 .#-(.#) ::- ( c ~ ('Chi ch prd nt)- , ctx ~ '[Text "looking up " :<>: ShowTE c :$$:- Text "on " :<>: ShowTE r :$$:- Text "producion: " :<>: ShowTE prd- ]- , Require (OpLookup (ChiReco prd) c r) ctx- ) =>- Rec (ChiReco prd) r -> Label c -> ReqR (OpLookup (ChiReco prd) c r)-(chi :: Rec (ChiReco prd) r) .# (l :: Label c)- = let prctx = Proxy @ '[Text "looking up " :<>: ShowTE c :$$:- Text "on " :<>: ShowTE r :$$:- Text "producion: " :<>: ShowTE prd- ]- in req prctx (OpLookup @_ @(ChiReco prd) l chi)------ * Productions--data PrdReco--type instance WrapField PrdReco (rule :: Type)- = rule--type Aspect (asp :: [(Prod, Type)]) = Rec PrdReco asp-type instance ShowRec PrdReco = "Aspect"-type instance ShowField PrdReco = "production named "
− src/Language/Grammars/AspectAG/TH.hs
@@ -1,281 +0,0 @@-{-|-Module : Language.Grammars.AspectAG.TH-Description : Boilerplate generation-Copyright : (c) Juan García Garland-License : GPL-Maintainer : jpgarcia@fing.edu.uy-Stability : experimental-Portability : POSIX--}--{-# LANGUAGE PolyKinds #-}-{-# LANGUAGE KindSignatures #-}-{-# LANGUAGE DataKinds #-}-{-# LANGUAGE ConstraintKinds #-}-{-# LANGUAGE RankNTypes #-}-{-# LANGUAGE TypeOperators #-}-{-# LANGUAGE FlexibleInstances #-}-{-# LANGUAGE FlexibleContexts #-}-{-# LANGUAGE GADTs #-}-{-# LANGUAGE UndecidableInstances #-}-{-# LANGUAGE MultiParamTypeClasses #-}-{-# LANGUAGE TypeFamilies #-}-{-# LANGUAGE NoMonomorphismRestriction #-}-{-# LANGUAGE ScopedTypeVariables #-}-{-# LANGUAGE TypeFamilies #-}-{-# LANGUAGE TypeApplications #-}-{-# LANGUAGE FunctionalDependencies #-}-{-# LANGUAGE TemplateHaskell #-}---module Language.Grammars.AspectAG.TH where--import Language.Haskell.TH-import Language.Haskell.TH.Syntax (showName, location, Loc(..), Q, Exp, lift)-import Data.Proxy-import Data.Either-import GHC.TypeLits-import Data.List-import Data.Set (Set)-import qualified Data.Set as S--import Control.Monad -import Language.Haskell.TH.Ppr (pprint)--import Data.GenRec.Label-import Data.GenRec-import Language.Grammars.AspectAG-import Language.Grammars.AspectAG.RecordInstances-import qualified Data.Kind as DK--import Debug.Trace.LocationTH----- * Attribute labels---- | makes a type level lit (Symbol) from a String-str2Sym s = litT$ strTyLit s -- th provides nametoSymbol, btw----- | TH function to define a typed attribute label given a name--- and a quoted type-attLabel :: String -> Name -> DecsQ-attLabel s t- = [d| $(varP (mkName s)) = Label :: Label ( 'Att $(str2Sym s)- $(conT t)) |]---- | for completness, to have a name as the next one-attMono = attLabel---- | TH function to define a polymorphic attribute-attPoly :: String -> DecsQ-attPoly s- = [d| $(varP (mkName s)) = Label :: forall a . Label ( 'Att $(str2Sym s) a) |]---- | multiple monomorphic attributes at once-attLabels :: [(String,Name)] -> Q [Dec]-attLabels xs = liftM concat . sequence $ [attLabel att ty | (att,ty) <- xs ]---- * Non terminals---- | add a non terminal symbol-addNont :: String -> Q [Dec]-addNont s- = liftM concat . sequence $ [addNTLabel s, addNTType s]--addNTLabel :: String -> Q [Dec]-addNTLabel s- = [d| $(varP (mkName ("nt_" ++ s))) = Label :: Label ('NT $(str2Sym s)) |]--addNTType :: String -> Q [Dec]-addNTType s- = return [TySynD (mkName ("Nt_"++ s)) [] (AppT (PromotedT 'NT) (LitT (StrTyLit s)))]---data SymTH = Ter Name | NonTer Name | Poly---addChi :: String -- chi name- -> Name -- prd- -> SymTH -- symbol type- -> Q [Dec]-addChi chi prd (Ter typ)- = [d| $(varP (mkName ("ch_" ++chi)))- = Label :: Label ( 'Chi $(str2Sym chi)- $(conT prd)- (Terminal $(conT typ)))|]-addChi chi prd (NonTer typ)- = [d| $(varP (mkName ("ch_" ++chi)))- = Label :: Label ( 'Chi $(str2Sym chi)- $(conT prd)- (NonTerminal $(conT typ)))|]-addChi chi prd poly- = [d| $(varP (mkName ("ch_" ++chi)))- = Label :: forall a . Label ( 'Chi $(str2Sym chi)- $(conT prd)- ('Right ('T a)))|]---- | only prod symbol-addPrd :: String --name- -> Name --nonterm- -> Q [Dec]-addPrd prd nt = liftM concat . sequence- $ [addPrdType prd nt, addPrdLabel prd nt]--addPrdLabel prd nt- = [d| $(varP (mkName ("p_" ++ prd)))- = Label :: Label ('Prd $(str2Sym prd) $(conT nt))|]--addPrdType prd nt- = return [TySynD (mkName ("P_"++ prd)) []- (AppT (AppT (PromotedT 'Prd) (LitT (StrTyLit prd))) (ConT nt))]----- | Productions-addProd :: String -- name- -> Name -- nt- -> [(String, SymTH)] -- chiLst- -> Q [Dec]-addProd prd nt xs- = liftM concat . sequence $- addPrd prd nt- : addInstance nt prd (map preProc xs)- : [addChi chi (mkName ("P_" ++ prd)) sym | (chi, sym) <- xs]- where preProc (n, Ter a) = (mkName n, a)- preProc (n, NonTer a) = (mkName n, a)- preProc (n, Poly) = (mkName n, mkName "a")---- | class-class Prods (lhs :: NT) (name :: Symbol) (rhs :: [(Symbol, Symbol)]) where {}---- get a list of instances-getInstances :: Q [InstanceDec]-getInstances = do- ClassI _ instances <- reify ''Prods- return instances---- convert the list of instances into an Exp so they can be displayed in GHCi-showInstances :: Q Exp-showInstances = do- ins <- getInstances- return . LitE . stringL $ show $ head ins--addInstance :: Name -> String -> [(Name, Name)] -> Q [Dec]-addInstance nt name rhs- = [d| instance Prods $(conT nt) $(str2Sym name) $(typeList rhs) where {} |]--typeList :: [(Name, Name)] -> Q Type-typeList = foldr f promotedNilT- -- where f = \x xs -> appT (appT promotedConsT (nameToSymbolBase x)) xs- where f = \(n,t) xs- -> appT (appT promotedConsT (appT (appT (promotedTupleT 2)- (nameToSymbol n))- (nameToSymbolBase t))) xs--nameToSymbol = litT . strTyLit . show-nameToSymbolBase = litT . strTyLit . nameBase--isNTName :: Name -> Bool-isNTName n- = "Nt_" `isPrefixOf` nameBase n--closeNT :: Name -> Q [Dec]-closeNT nt- = do decs <- getInstances- let consts = map mkCon $ filter (isInstanceOf nt) decs- return [ DataD []- (mkName $ drop 3 $ nameBase nt) [] Nothing- consts [DerivClause Nothing [ConT ''Show, ConT ''Eq, ConT ''Read]]]--isInstanceOf nt (InstanceD _ _ (AppT (AppT (AppT (ConT prods) (ConT nt')) _ ) _) _)- = nameBase nt == nameBase nt'-isInstanceOf _ _ = False--mkCon :: InstanceDec -> Con-mkCon i- = case i of- InstanceD _ [] (AppT (AppT (AppT (ConT _prods) (ConT nt)) (LitT (StrTyLit prdname))) tlist) _- -> RecC (mkName prdname) (map mkBangPR $ getTList tlist)--mkBangP (_, a) = (Bang NoSourceUnpackedness NoSourceStrictness, ConT a)-mkBangPR (n, a) = (n, Bang NoSourceUnpackedness NoSourceStrictness, ConT a)--getTList :: Type -> [(Name, Name)]-getTList (SigT _ _) = []-getTList (AppT (AppT (PromotedConsT)- (AppT (AppT (PromotedTupleT 2)- (LitT (StrTyLit n)))- (LitT (StrTyLit pos))))- ts)- = (mkName n,- if "Nt_" `isPrefixOf` pos then mkName $ drop 3 pos else mkName pos)- : getTList ts-getTList _ = []---- | keeps nt info-getTListNT :: Type -> [(Name, Name)]-getTListNT (SigT _ _) = []-getTListNT (AppT (AppT (PromotedConsT)- (AppT (AppT (PromotedTupleT 2)- (LitT (StrTyLit n)))- (LitT (StrTyLit pos))))- ts)- = (mkName n, mkName pos) : getTListNT ts-getTListNT _ = []---- | like |mkCon| in semantic functions, builds a case-mkClause :: InstanceDec -> Clause-mkClause i- = case i of- InstanceD _ [] (AppT (AppT (AppT (ConT _prods)- (ConT nt))- (LitT (StrTyLit prdname)))- tlist) _- -> Clause [VarP (mkName "asp"),- ConP (mkName $ prdname) [ VarP a | a <- map fst (getTList tlist)]]- (NormalB ((AppE (AppE (AppE (VarE $ mkName "knitAspect")- (VarE $ mkName $ "p_"++ prdname))- (VarE $ mkName "asp"))- (toSemRec (getTListNT tlist)))))- []--toSemRec :: [(Name, Name)] -> Exp-toSemRec- = foldr mkChSem (VarE (mkName "emptyGenRec"))- where mkChSem (n,pos) xs- | "Nt_" `isPrefixOf` nameBase pos =- (AppE (AppE (VarE $ mkName ".*.")- (AppE (AppE (VarE $ mkName ".=.")- (VarE $ mkName $ "ch_" ++ nameBase n))- (AppE (AppE (VarE $ mkName $ "sem_" ++ (drop 3 $ nameBase pos))- (VarE $ mkName "asp"))- (VarE $ n))))- xs)- | otherwise =- (AppE (AppE (VarE $ mkName ".*.")- (AppE (AppE (VarE $ mkName ".=.")- (VarE $ mkName $ "ch_" ++ nameBase n))- (AppE (VarE $ mkName "sem_Lit")- (VarE $ n))))- xs)-closeNTs :: [Name] -> Q [Dec]-closeNTs = liftM concat . sequence . map (closeNT)--mkSemFunc :: Name -- nonterm- -> Q [Dec]-mkSemFunc nt =- do decs <- getInstances- let clauses = map mkClause $ filter (isInstanceOf nt) decs- return [FunD (mkName $ "sem_" ++ drop 3 (nameBase nt)) clauses ]--mkSemFuncs :: [Name] -> Q [Dec]-mkSemFuncs- = liftM concat . sequence . map (mkSemFunc)---here :: Q Exp-here = location >>= \loc -> [e| Proxy @( Text $(str2Sym . ppLoc $ loc) ) |]- where- ppLoc (Loc file _pack mod (line, startcol) (_line', endcol)) =- " location: (module: " ++ mod ++ ", line:" ++ show line- ++ " cols: " ++ show (startcol, endcol) ++ ")"
− src/Language/Grammars/AspectAG/THGen.hs
@@ -1,53 +0,0 @@-{-|-Module : Language.Grammars.AspectAG-Description : Main module, First-class attribute grammars-Copyright : (c) Juan García-Garland, Marcos Viera, 2019, 2020-License : GPL-Maintainer : jpgarcia@fing.edu.uy-Stability : experimental-Portability : POSIX--}--{-# LANGUAGE PolyKinds #-}-{-# LANGUAGE KindSignatures #-}-{-# LANGUAGE DataKinds #-}-{-# LANGUAGE ConstraintKinds #-}-{-# LANGUAGE RankNTypes #-}-{-# LANGUAGE TypeOperators #-}-{-# LANGUAGE FlexibleInstances #-}-{-# LANGUAGE FlexibleContexts #-}-{-# LANGUAGE GADTs #-}-{-# LANGUAGE UndecidableInstances #-}-{-# LANGUAGE MultiParamTypeClasses #-}-{-# LANGUAGE TypeFamilies #-}-{-# LANGUAGE NoMonomorphismRestriction #-}-{-# LANGUAGE ScopedTypeVariables #-}-{-# LANGUAGE TypeFamilies #-}-{-# LANGUAGE TypeApplications #-}-{-# LANGUAGE FunctionalDependencies #-}-{-# LANGUAGE TypeFamilyDependencies #-}-{-# LANGUAGE PartialTypeSignatures #-}-{-# LANGUAGE IncoherentInstances #-}-{-# LANGUAGE AllowAmbiguousTypes #-}-{-# LANGUAGE TemplateHaskell #-}--module Language.Grammars.AspectAG.THGen where--import Language.Haskell.TH-import Language.Haskell.TH.Syntax--import Data.Proxy-import GHC.TypeLits--import Language.Grammars.AspectAG-import Language.Grammars.AspectAG.TH---- mkMsgPos :: Label ('Att att v) -> Label ('Prd prd nt) -> Proxy pos--- -> Proxy (Text att :<>: Text " definition in production "--- :<>:Text prd :<>: Text pos)--- mkMsgPos Label Label Proxy = Proxy---- synLoc att prd def =--- let loc = $(proxyLoc) in--- traceRule (mkMsgPos att prd (seq loc loc)) $--- syndefM att prd def
+ test/Main.hs view
@@ -0,0 +1,4 @@+module Main (main) where++main :: IO ()+main = putStrLn "Test suite not yet implemented."