diff --git a/' b/'
new file mode 100644
index 00000000..26eafed4
--- /dev/null
+++ b/'
@@ -0,0 +1,35 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(** Real monadic interpreter goes here *)
+
+open Utils
+
+type error = [ `UnknownVariable of string (** just for example *) ]
+
+module Interpret (M : MONAD_FAIL) : sig
+ val run : _ Ast.t -> (int, [> error ]) M.t
+end = struct
+ let run _ =
+ (* TODO: implement interpreter here *)
+ if true then M.fail (`UnknownVariable "var") else failwith "not implemented"
+ ;;
+end
+
+let parse_and_run str =
+ let module I = Interpret (Base.Result) in
+ let rez = Base.Result.(Parser.parse str >>= I.run) in
+ match rez with
+ | Result.Ok n -> Printf.printf "Success: %d\n" n
+ | Result.Error #Parser.error ->
+ Format.eprintf "Parsing error\n%!";
+ exit 1
+ | Result.Error #error ->
+ Format.eprintf "Interpreter error\n%!";
+ exit 1
+;;
diff --git a/Kormilcyn/.gitignore b/Kormilcyn/.gitignore
new file mode 100644
index 00000000..7102a822
--- /dev/null
+++ b/Kormilcyn/.gitignore
@@ -0,0 +1,6 @@
+_build
+_coverage
+/_esy
+/node_modules
+/esy.lock
+/.melange.eobjs
diff --git a/Kormilcyn/.ocamlformat b/Kormilcyn/.ocamlformat
new file mode 100644
index 00000000..3b217634
--- /dev/null
+++ b/Kormilcyn/.ocamlformat
@@ -0,0 +1 @@
+profile=janestreet
diff --git a/Kormilcyn/.ocamlinit b/Kormilcyn/.ocamlinit
new file mode 100644
index 00000000..6e9b2094
--- /dev/null
+++ b/Kormilcyn/.ocamlinit
@@ -0,0 +1 @@
+open Lambda_lib.Parser;;
diff --git a/Kormilcyn/.zanuda b/Kormilcyn/.zanuda
new file mode 100644
index 00000000..0f09b19b
--- /dev/null
+++ b/Kormilcyn/.zanuda
@@ -0,0 +1 @@
+forward mutability_check ignore REPL.ml
diff --git a/Kormilcyn/COPYING b/Kormilcyn/COPYING
new file mode 100644
index 00000000..f288702d
--- /dev/null
+++ b/Kormilcyn/COPYING
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc.
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+
+ Copyright (C)
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see .
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ Copyright (C)
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+.
diff --git a/Kormilcyn/COPYING.CC0 b/Kormilcyn/COPYING.CC0
new file mode 100644
index 00000000..0e259d42
--- /dev/null
+++ b/Kormilcyn/COPYING.CC0
@@ -0,0 +1,121 @@
+Creative Commons Legal Code
+
+CC0 1.0 Universal
+
+ CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+ LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+ ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+ INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+ REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+ PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+ THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+ HEREUNDER.
+
+Statement of Purpose
+
+The laws of most jurisdictions throughout the world automatically confer
+exclusive Copyright and Related Rights (defined below) upon the creator
+and subsequent owner(s) (each and all, an "owner") of an original work of
+authorship and/or a database (each, a "Work").
+
+Certain owners wish to permanently relinquish those rights to a Work for
+the purpose of contributing to a commons of creative, cultural and
+scientific works ("Commons") that the public can reliably and without fear
+of later claims of infringement build upon, modify, incorporate in other
+works, reuse and redistribute as freely as possible in any form whatsoever
+and for any purposes, including without limitation commercial purposes.
+These owners may contribute to the Commons to promote the ideal of a free
+culture and the further production of creative, cultural and scientific
+works, or to gain reputation or greater distribution for their Work in
+part through the use and efforts of others.
+
+For these and/or other purposes and motivations, and without any
+expectation of additional consideration or compensation, the person
+associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+is an owner of Copyright and Related Rights in the Work, voluntarily
+elects to apply CC0 to the Work and publicly distribute the Work under its
+terms, with knowledge of his or her Copyright and Related Rights in the
+Work and the meaning and intended legal effect of CC0 on those rights.
+
+1. Copyright and Related Rights. A Work made available under CC0 may be
+protected by copyright and related or neighboring rights ("Copyright and
+Related Rights"). Copyright and Related Rights include, but are not
+limited to, the following:
+
+ i. the right to reproduce, adapt, distribute, perform, display,
+ communicate, and translate a Work;
+ ii. moral rights retained by the original author(s) and/or performer(s);
+iii. publicity and privacy rights pertaining to a person's image or
+ likeness depicted in a Work;
+ iv. rights protecting against unfair competition in regards to a Work,
+ subject to the limitations in paragraph 4(a), below;
+ v. rights protecting the extraction, dissemination, use and reuse of data
+ in a Work;
+ vi. database rights (such as those arising under Directive 96/9/EC of the
+ European Parliament and of the Council of 11 March 1996 on the legal
+ protection of databases, and under any national implementation
+ thereof, including any amended or successor version of such
+ directive); and
+vii. other similar, equivalent or corresponding rights throughout the
+ world based on applicable law or treaty, and any national
+ implementations thereof.
+
+2. Waiver. To the greatest extent permitted by, but not in contravention
+of, applicable law, Affirmer hereby overtly, fully, permanently,
+irrevocably and unconditionally waives, abandons, and surrenders all of
+Affirmer's Copyright and Related Rights and associated claims and causes
+of action, whether now known or unknown (including existing as well as
+future claims and causes of action), in the Work (i) in all territories
+worldwide, (ii) for the maximum duration provided by applicable law or
+treaty (including future time extensions), (iii) in any current or future
+medium and for any number of copies, and (iv) for any purpose whatsoever,
+including without limitation commercial, advertising or promotional
+purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+member of the public at large and to the detriment of Affirmer's heirs and
+successors, fully intending that such Waiver shall not be subject to
+revocation, rescission, cancellation, termination, or any other legal or
+equitable action to disrupt the quiet enjoyment of the Work by the public
+as contemplated by Affirmer's express Statement of Purpose.
+
+3. Public License Fallback. Should any part of the Waiver for any reason
+be judged legally invalid or ineffective under applicable law, then the
+Waiver shall be preserved to the maximum extent permitted taking into
+account Affirmer's express Statement of Purpose. In addition, to the
+extent the Waiver is so judged Affirmer hereby grants to each affected
+person a royalty-free, non transferable, non sublicensable, non exclusive,
+irrevocable and unconditional license to exercise Affirmer's Copyright and
+Related Rights in the Work (i) in all territories worldwide, (ii) for the
+maximum duration provided by applicable law or treaty (including future
+time extensions), (iii) in any current or future medium and for any number
+of copies, and (iv) for any purpose whatsoever, including without
+limitation commercial, advertising or promotional purposes (the
+"License"). The License shall be deemed effective as of the date CC0 was
+applied by Affirmer to the Work. Should any part of the License for any
+reason be judged legally invalid or ineffective under applicable law, such
+partial invalidity or ineffectiveness shall not invalidate the remainder
+of the License, and in such case Affirmer hereby affirms that he or she
+will not (i) exercise any of his or her remaining Copyright and Related
+Rights in the Work or (ii) assert any associated claims and causes of
+action with respect to the Work, in either case contrary to Affirmer's
+express Statement of Purpose.
+
+4. Limitations and Disclaimers.
+
+ a. No trademark or patent rights held by Affirmer are waived, abandoned,
+ surrendered, licensed or otherwise affected by this document.
+ b. Affirmer offers the Work as-is and makes no representations or
+ warranties of any kind concerning the Work, express, implied,
+ statutory or otherwise, including without limitation warranties of
+ title, merchantability, fitness for a particular purpose, non
+ infringement, or the absence of latent or other defects, accuracy, or
+ the present or absence of errors, whether or not discoverable, all to
+ the greatest extent permissible under applicable law.
+ c. Affirmer disclaims responsibility for clearing rights of other persons
+ that may apply to the Work or any use thereof, including without
+ limitation any person's Copyright and Related Rights in the Work.
+ Further, Affirmer disclaims responsibility for obtaining any necessary
+ consents, permissions or other rights required for any use of the
+ Work.
+ d. Affirmer understands and acknowledges that Creative Commons is not a
+ party to this document and has no duty or obligation with respect to
+ this CC0 or use of the Work.
diff --git a/Kormilcyn/COPYING.LESSER b/Kormilcyn/COPYING.LESSER
new file mode 100644
index 00000000..0a041280
--- /dev/null
+++ b/Kormilcyn/COPYING.LESSER
@@ -0,0 +1,165 @@
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc.
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+ This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+ 0. Additional Definitions.
+
+ As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+ "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+ An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+ A "Combined Work" is a work produced by combining or linking an
+Application with the Library. The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+ The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+ The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+ 1. Exception to Section 3 of the GNU GPL.
+
+ You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+ 2. Conveying Modified Versions.
+
+ If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+ a) under this License, provided that you make a good faith effort to
+ ensure that, in the event an Application does not supply the
+ function or data, the facility still operates, and performs
+ whatever part of its purpose remains meaningful, or
+
+ b) under the GNU GPL, with none of the additional permissions of
+ this License applicable to that copy.
+
+ 3. Object Code Incorporating Material from Library Header Files.
+
+ The object code form of an Application may incorporate material from
+a header file that is part of the Library. You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+ a) Give prominent notice with each copy of the object code that the
+ Library is used in it and that the Library and its use are
+ covered by this License.
+
+ b) Accompany the object code with a copy of the GNU GPL and this license
+ document.
+
+ 4. Combined Works.
+
+ You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+ a) Give prominent notice with each copy of the Combined Work that
+ the Library is used in it and that the Library and its use are
+ covered by this License.
+
+ b) Accompany the Combined Work with a copy of the GNU GPL and this license
+ document.
+
+ c) For a Combined Work that displays copyright notices during
+ execution, include the copyright notice for the Library among
+ these notices, as well as a reference directing the user to the
+ copies of the GNU GPL and this license document.
+
+ d) Do one of the following:
+
+ 0) Convey the Minimal Corresponding Source under the terms of this
+ License, and the Corresponding Application Code in a form
+ suitable for, and under terms that permit, the user to
+ recombine or relink the Application with a modified version of
+ the Linked Version to produce a modified Combined Work, in the
+ manner specified by section 6 of the GNU GPL for conveying
+ Corresponding Source.
+
+ 1) Use a suitable shared library mechanism for linking with the
+ Library. A suitable mechanism is one that (a) uses at run time
+ a copy of the Library already present on the user's computer
+ system, and (b) will operate properly with a modified version
+ of the Library that is interface-compatible with the Linked
+ Version.
+
+ e) Provide Installation Information, but only if you would otherwise
+ be required to provide such information under section 6 of the
+ GNU GPL, and only to the extent that such information is
+ necessary to install and execute a modified version of the
+ Combined Work produced by recombining or relinking the
+ Application with a modified version of the Linked Version. (If
+ you use option 4d0, the Installation Information must accompany
+ the Minimal Corresponding Source and Corresponding Application
+ Code. If you use option 4d1, you must provide the Installation
+ Information in the manner specified by section 6 of the GNU GPL
+ for conveying Corresponding Source.)
+
+ 5. Combined Libraries.
+
+ You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+ a) Accompany the combined library with a copy of the same work based
+ on the Library, uncombined with any other library facilities,
+ conveyed under the terms of this License.
+
+ b) Give prominent notice with the combined library that part of it
+ is a work based on the Library, and explaining where to find the
+ accompanying uncombined form of the same work.
+
+ 6. Revised Versions of the GNU Lesser General Public License.
+
+ The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+ If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/Kormilcyn/DONT_REMOVE_THIS_DIRECTORY.md b/Kormilcyn/DONT_REMOVE_THIS_DIRECTORY.md
new file mode 100644
index 00000000..e0530079
--- /dev/null
+++ b/Kormilcyn/DONT_REMOVE_THIS_DIRECTORY.md
@@ -0,0 +1,3 @@
+This file should be contained in template directoty `Lambda`.
+You should remove it when you copy `Lambda` for your
+personal pet project.
diff --git a/Kormilcyn/Lambda.opam b/Kormilcyn/Lambda.opam
new file mode 100644
index 00000000..820089ef
--- /dev/null
+++ b/Kormilcyn/Lambda.opam
@@ -0,0 +1,44 @@
+# This file is generated by dune, edit dune-project instead
+opam-version: "2.0"
+version: "0.1"
+synopsis: "An interpreter for MiniML (shMeL)"
+description:
+ "FIXME. A longer description, for example, which are the most interesing features being supported, etc."
+maintainer: ["FIXME Kormilcyn Roman "]
+authors: [
+ "FIXME Kormilcyn Roman "
+ "FIXME Kormilcyn Roman "
+]
+license: "LGPL-3.0-or-later WITH OCaml-LGPL-linking-exception"
+homepage: "https://github.com/Kakadu/fp25"
+doc: "https://kakadu.github.io/fp25/docs/Lambda"
+bug-reports: "https://github.com/Kakadu/fp25"
+depends: [
+ "dune" {>= "3.7" & = "3.19.1"}
+ "angstrom" {= "0.16.0"}
+ "base"
+ "ppx_inline_test" {with-test}
+ "ppx_expect"
+ "ppx_deriving"
+ "bisect_ppx"
+ "odoc" {with-doc}
+ "ocamlformat" {build & = "0.26.2"}
+]
+build: [
+ ["dune" "subst"] {dev}
+ [
+ "dune"
+ "build"
+ "-p"
+ name
+ "-j"
+ jobs
+ "@install"
+ "@runtest" {with-test}
+ "@doc" {with-doc}
+ ]
+]
+pin-depends: [
+ ["ppx_deriving_qcheck.0.6" "git+https://github.com/c-cube/qcheck.git#42429bf06ba12373cad02b1404f50d0ad6238af5"]
+]
+# Don't edit '*.opam' file manually. Use 'dune b @install'
diff --git a/Kormilcyn/Lambda.opam.template b/Kormilcyn/Lambda.opam.template
new file mode 100644
index 00000000..480da691
--- /dev/null
+++ b/Kormilcyn/Lambda.opam.template
@@ -0,0 +1,4 @@
+pin-depends: [
+ ["ppx_deriving_qcheck.0.6" "git+https://github.com/c-cube/qcheck.git#42429bf06ba12373cad02b1404f50d0ad6238af5"]
+]
+# Don't edit '*.opam' file manually. Use 'dune b @install'
diff --git a/Kormilcyn/Makefile b/Kormilcyn/Makefile
new file mode 100644
index 00000000..e234db4b
--- /dev/null
+++ b/Kormilcyn/Makefile
@@ -0,0 +1,49 @@
+.PHONY: repl tests test fmt lint celan
+
+all:
+ dune build
+
+repl:
+ dune build ./REPL.exe && rlwrap _build/default/REPL.exe
+
+tests: test
+test:
+ dune runtest
+
+celan: clean
+clean:
+ @$(RM) -r _build _coverage
+
+fmt:
+ dune build @fmt --auto-promote
+
+lint:
+ dune build @lint --force
+
+release:
+ dune build --profile=release
+ dune runtest --profile=release
+
+install:
+ dune b @install --profile=release
+ dune install
+
+ODIG_SWITCHES = --odoc-theme=odig.gruvbox.light
+ODIG_SWITCHES += --no-tag-index
+ODIG_SWITCHES += --no-pkg-deps
+odig:
+ odig odoc $(ODIG_SWITCHES) Lambda
+
+TEST_COV_D = /tmp/cov
+COVERAGE_OPTS = --coverage-path $(TEST_COV_D) --expect lib/ --expect tests/
+
+.PHONY: test_coverage coverage
+test_coverage: coverage
+coverage:
+ $(RM) -r $(TEST_COV_D)
+ mkdir -p $(TEST_COV_D)
+ BISECT_FILE=$(TEST_COV_D)/language dune runtest --no-print-directory \
+ --instrument-with bisect_ppx --force
+ bisect-ppx-report html $(COVERAGE_OPTS)
+ bisect-ppx-report summary $(COVERAGE_OPTS)
+ @echo "Use 'xdg-open _coverage/index.html' to see coverage report"
diff --git a/Kormilcyn/bin/REPL.ml b/Kormilcyn/bin/REPL.ml
new file mode 100644
index 00000000..696936a4
--- /dev/null
+++ b/Kormilcyn/bin/REPL.ml
@@ -0,0 +1,139 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+open Lambda_lib
+
+include struct
+ open Ast
+ open Utils
+
+ type 'a status =
+ | Done of 'a
+ | WIP of 'a
+
+ let fin x = Done x
+ let wip x = WIP x
+
+ let ao_small_step_strat =
+ let rec helper = function
+ | Var _ as l -> fin l
+ | Fun (x, b) ->
+ (match helper b with
+ | WIP b2 -> wip (abs x b2)
+ | Done b2 -> fin (abs x b2))
+ | App (f, arg) ->
+ (match helper f with
+ | WIP f2 -> wip (app f2 arg)
+ | Done (Fun (x, body)) ->
+ (match helper arg with
+ | Done arg -> wip (Lambda.subst x ~by:arg body)
+ | WIP arg -> wip (app f arg))
+ | Done f2 -> fin (App (f2, arg)))
+ in
+ let rec loop t =
+ match helper t with
+ | Done x -> x
+ | WIP x ->
+ Format.printf " -- %a\n%!" Pprintast.pp_hum x;
+ loop x
+ in
+ let on_app _ f arg = loop (app f arg) in
+ let on_abs _ f x = loop (abs f x) in
+ let on_var _ x = loop (var x) in
+ { Lambda.on_var; on_abs; on_app }
+ ;;
+end
+
+type strategy =
+ | CBN
+ | CBV
+ | NO
+ | AO
+
+type strategy_kind =
+ | Small_step
+ | Big_step
+
+type stop_after =
+ | SA_parsing
+ | SA_never
+
+type opts =
+ { mutable dump_parsetree : bool
+ ; mutable mode : strategy_kind * strategy
+ ; mutable stop_after : stop_after
+ }
+
+let big_step_evaluator = function
+ | AO -> Lambda.ao_strat
+ | NO -> Lambda.nor_strat
+ | CBN -> Lambda.cbn_strat
+ | CBV -> Lambda.cbv_strat
+;;
+
+let run_single dump_parsetree stop_after eval =
+ let text = In_channel.(input_all stdin) |> String.trim in
+ let ast = Parser.parse text in
+ match ast with
+ | Error e -> Format.printf "Error: %a\n%!" Parser.pp_error e
+ | Result.Ok ast ->
+ if dump_parsetree then Format.printf "Parsed result: @[%a@]\n%!" Printast.pp_named ast;
+ (match stop_after with
+ | SA_parsing -> ()
+ | SA_never ->
+ let rez = eval ast in
+ Format.printf "Evaluated result: %a\n%!" Pprintast.pp_hum rez)
+;;
+
+let () =
+ let opts = { dump_parsetree = false; mode = Big_step, NO; stop_after = SA_never } in
+ let pick_strategy stra () =
+ let kind, _ = opts.mode in
+ opts.mode <- kind, stra
+ in
+ let pick_step step () =
+ let _, stra = opts.mode in
+ opts.mode <- step, stra
+ in
+ let () =
+ let open Stdlib.Arg in
+ parse
+ [ "-cbv", Unit (pick_strategy CBV), "Call-by-value strategy"
+ ; "-cbn", Unit (pick_strategy CBN), "Call-by-name strategy"
+ ; "-no", Unit (pick_strategy NO), "Normal Order strategy"
+ ; "-ao", Unit (pick_strategy AO), "Applicative Order strategy"
+ ; ( "-small"
+ , Unit (pick_step Small_step)
+ , "Small-step strategy kind (default is big-step)" )
+ ; ( "-big"
+ , Unit (pick_step Big_step)
+ , "Small-step strategy kind (default is big-step)" )
+ ; ( "-dparsetree"
+ , Unit (fun () -> opts.dump_parsetree <- true)
+ , "Dump parse tree, don't eval enything" )
+ ; ( "-stop-after"
+ , String
+ (function
+ | "parsing" -> opts.stop_after <- SA_parsing
+ | _ -> failwith "Bad argument of -stop-after")
+ , "" )
+ ]
+ (fun _ ->
+ Stdlib.Format.eprintf "Positioned arguments are not supported\n";
+ Stdlib.exit 1)
+ "Read-Eval-Print-Loop for Utyped Lambda Calculus"
+ in
+ run_single opts.dump_parsetree opts.stop_after (fun ast ->
+ let stra =
+ match opts.mode with
+ | Big_step, stra -> big_step_evaluator stra
+ | Small_step, AO -> ao_small_step_strat
+ | _ -> raise (Failure "Implement it yourself")
+ in
+ Lambda.apply_strat stra ast)
+;;
diff --git a/Kormilcyn/bin/REPL.mli b/Kormilcyn/bin/REPL.mli
new file mode 100644
index 00000000..c1135e06
--- /dev/null
+++ b/Kormilcyn/bin/REPL.mli
@@ -0,0 +1,7 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
diff --git a/Kormilcyn/bin/dune b/Kormilcyn/bin/dune
new file mode 100644
index 00000000..a03fbc3b
--- /dev/null
+++ b/Kormilcyn/bin/dune
@@ -0,0 +1,10 @@
+(executable
+ (name REPL)
+ (public_name REPL)
+ (modules REPL)
+ (libraries lambda_lib)
+ (instrumentation
+ (backend bisect_ppx)))
+
+(cram
+ (deps ./REPL.exe %{bin:REPL}))
diff --git a/Kormilcyn/bin/repl.t b/Kormilcyn/bin/repl.t
new file mode 100644
index 00000000..35b4916c
--- /dev/null
+++ b/Kormilcyn/bin/repl.t
@@ -0,0 +1,12 @@
+
+ $ ./REPL.exe -help
+ Read-Eval-Print-Loop for Utyped Lambda Calculus
+ -cbv Call-by-value strategy
+ -cbn Call-by-name strategy
+ -no Normal Order strategy
+ -ao Applicative Order strategy
+ -small Small-step strategy kind (default is big-step)
+ -big Small-step strategy kind (default is big-step)
+ -dparsetree Dump parse tree, don't eval enything
+ -help Display this list of options
+ --help Display this list of options
diff --git a/Kormilcyn/dune b/Kormilcyn/dune
new file mode 100644
index 00000000..98e54536
--- /dev/null
+++ b/Kormilcyn/dune
@@ -0,0 +1,7 @@
+(env
+ (dev
+ (flags
+ (:standard -alert @deprecated -warn-error -A -w -3-9-32-34-58)))
+ (release
+ (flags
+ (:standard -alert @deprecated -warn-error +A -w +A-4-40-42-44-70))))
diff --git a/Kormilcyn/dune-project b/Kormilcyn/dune-project
new file mode 100644
index 00000000..4da5805a
--- /dev/null
+++ b/Kormilcyn/dune-project
@@ -0,0 +1,43 @@
+(lang dune 3.7)
+
+(generate_opam_files true)
+
+(cram enable)
+
+(license "LGPL-3.0-or-later WITH OCaml-LGPL-linking-exception")
+
+(authors
+ "FIXME Kormilcyn Roman "
+ "FIXME Kormilcyn Roman ")
+
+(maintainers "FIXME Kormilcyn Roman ")
+
+(bug_reports "https://github.com/Kakadu/fp25")
+
+(homepage "https://github.com/Kakadu/fp25")
+
+(package
+ (name Lambda) ; FIXME and regenerate .opam file using 'dune build @install'
+ (synopsis "An interpreter for MiniML (shMeL)")
+ (description
+ "FIXME. A longer description, for example, which are the most interesing features being supported, etc.")
+ (documentation "https://kakadu.github.io/fp25/docs/Lambda")
+ (version 0.1)
+ (depends
+ (dune
+ (= "3.19.1"))
+ (angstrom
+ (= "0.16.0"))
+ base
+ (ppx_inline_test :with-test)
+ ppx_expect
+ ppx_deriving
+ bisect_ppx
+ (odoc :with-doc)
+ (ocamlformat
+ (and
+ :build
+ (= "0.26.2")))
+ ; base
+ ; After adding dependencies to 'dune' files add the same dependecies here too
+ ))
diff --git a/Kormilcyn/lib/Pprintast.ml b/Kormilcyn/lib/Pprintast.ml
new file mode 100644
index 00000000..fd79a114
--- /dev/null
+++ b/Kormilcyn/lib/Pprintast.ml
@@ -0,0 +1,64 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(* Pretty printer goes here *)
+
+open Ast
+open Utils
+
+let pp ?(compact = true) =
+ let open Format in
+ let mangle t fmt x =
+ if is_free_in x t || not compact then fprintf fmt "%s" x else fprintf fmt "_"
+ in
+ let rec pp fmt = function
+ | Var s -> Format.fprintf fmt "%s" s
+ | App (l, r) -> Format.fprintf fmt "(%a %a)" pp l pp r
+ | Fun (x, Fun (y, Var z)) when x = z && y <> z && compact ->
+ if compact then Format.fprintf fmt "⊤"
+ | Fun (x, Fun (y, Var z)) when y = z && x <> z && compact -> Format.fprintf fmt "⊥"
+ | Fun (f, Fun (x, Var z)) when x = z && x <> f && compact -> Format.fprintf fmt "0"
+ | Fun (f, Fun (x, App (Var g, Var z))) when x = z && x <> f && g = f && compact ->
+ Format.fprintf fmt "1"
+ | Fun (f, Fun (x, App (Var g, App (Var h, Var z))))
+ when x = z && x <> f && g = f && h = g && compact -> Format.fprintf fmt "2"
+ | Fun (v1, Fun (v2, Fun (v3, Fun (v4, t)))) when compact ->
+ Format.fprintf
+ fmt
+ "(λ %a %a %a %a -> %a)"
+ (mangle t)
+ v1
+ (mangle t)
+ v2
+ (mangle t)
+ v3
+ (mangle t)
+ v4
+ pp
+ t
+ | Fun (v1, Fun (v2, Fun (v3, t))) when compact ->
+ Format.fprintf
+ fmt
+ "(λ %a %a %a -> %a)"
+ (mangle t)
+ v1
+ (mangle t)
+ v2
+ (mangle t)
+ v3
+ pp
+ t
+ | Fun (v1, Fun (v2, t)) when compact ->
+ Format.fprintf fmt "(λ %a %a -> %a)" (mangle t) v1 (mangle t) v2 pp t
+ | Fun (x, t) -> Format.fprintf fmt "(λ %a . %a)" (mangle t) x pp t
+ in
+ pp
+;;
+
+let pp_hum = pp ~compact:true
+let pp = pp ~compact:false
diff --git a/Kormilcyn/lib/Pprintast.mli b/Kormilcyn/lib/Pprintast.mli
new file mode 100644
index 00000000..81f6c2ff
--- /dev/null
+++ b/Kormilcyn/lib/Pprintast.mli
@@ -0,0 +1,13 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(** Verbose printing. Usable for paring *)
+val pp : Format.formatter -> string Ast.t -> unit
+
+(** Print in fancy human-readable form *)
+val pp_hum : Format.formatter -> string Ast.t -> unit
diff --git a/Kormilcyn/lib/Printast.ml b/Kormilcyn/lib/Printast.ml
new file mode 100644
index 00000000..a4a4ad53
--- /dev/null
+++ b/Kormilcyn/lib/Printast.ml
@@ -0,0 +1,30 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+open Ast
+
+let pp_binop fmt = function
+ | Add -> Format.fprintf fmt "+"
+ | Mul -> Format.fprintf fmt "*"
+ | Sub -> Format.fprintf fmt "-"
+ | Div -> Format.fprintf fmt "/"
+ | Leq -> Format.fprintf fmt "<="
+;;
+
+type 'name t = 'name Ast.t =
+ | Var of 'name (** Variable [x] *)
+ | Fun of 'name * 'name t
+ | App of 'name t * 'name t
+ | Int of int
+ | Bin of binop * 'name t * 'name t
+ | Let of 'name * 'name t * 'name t
+ | If of 'name t * 'name t * 'name t
+ | Exn
+[@@deriving show { with_path = false }]
+
+let pp_named = pp Format.pp_print_string
diff --git a/Kormilcyn/lib/Printast.mli b/Kormilcyn/lib/Printast.mli
new file mode 100644
index 00000000..2b73b720
--- /dev/null
+++ b/Kormilcyn/lib/Printast.mli
@@ -0,0 +1,13 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(** Pretty-print representation of AST with names. *)
+val pp_named : Format.formatter -> string Ast.t -> unit
+
+val pp : (Format.formatter -> 'name -> unit) -> Format.formatter -> 'name Ast.t -> unit
+val show : (Format.formatter -> 'name -> unit) -> 'name Ast.t -> string
diff --git a/Kormilcyn/lib/ast.mli b/Kormilcyn/lib/ast.mli
new file mode 100644
index 00000000..d0338658
--- /dev/null
+++ b/Kormilcyn/lib/ast.mli
@@ -0,0 +1,31 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+type name = string
+
+type binop =
+ | Add
+ | Mul
+ | Sub
+ | Div
+ | Leq
+
+(** The main type for our AST (дерева абстрактного синтаксиса) *)
+type 'name t =
+ | Var of 'name (** Variable [x] *)
+ | Fun of 'name * 'name t
+ | App of 'name t * 'name t
+ | Int of int
+ | Bin of binop * 'name t * 'name t
+ | Let of 'name * 'name t * 'name t
+ | If of 'name t * 'name t * 'name t
+ (* TODO: meaningful exceptions *)
+ | Exn
+ (** In type definition above the 3rd constructor is intentionally without documentation
+ to test linter *)
+(* Application [f g ] *)
diff --git a/Kormilcyn/lib/dune b/Kormilcyn/lib/dune
new file mode 100644
index 00000000..e6f21576
--- /dev/null
+++ b/Kormilcyn/lib/dune
@@ -0,0 +1,20 @@
+(library
+ (name lambda_lib)
+ (public_name Lambda.Lib)
+ (modules Ast Lambda Interpret Parser Printast Pprintast utils)
+ (modules_without_implementation ast)
+ (libraries base angstrom)
+ (preprocess
+ (pps ppx_deriving.show))
+ (instrumentation
+ (backend bisect_ppx)))
+
+(library
+ (name tests)
+ (modules tests)
+ (libraries lambda_lib)
+ (preprocess
+ (pps ppx_expect ppx_deriving.show))
+ (instrumentation
+ (backend bisect_ppx))
+ (inline_tests))
diff --git a/Kormilcyn/lib/interpret.ml b/Kormilcyn/lib/interpret.ml
new file mode 100644
index 00000000..154756d6
--- /dev/null
+++ b/Kormilcyn/lib/interpret.ml
@@ -0,0 +1,97 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(** Real monadic interpreter goes here *)
+
+open Utils
+open Ast
+
+type error = [ `NotAValue of string ]
+
+module Interpret (M : MONAD_FAIL) : sig
+ val run : _ Ast.t -> (int, [> error ]) M.t
+end = struct
+ (* TODO: recursion *)
+ (* TODO: exception handling *)
+
+ type 'name value =
+ | VInt of int
+ | VClosure of 'name * 'name Ast.t * 'name env
+ | VExn
+
+ and 'name env = ('name * 'name value) list
+
+ let rec eval (env : 'name env) (e : 'name Ast.t) : 'name value =
+ match e with
+ | Int i -> VInt i
+ | Var x -> resolve env x
+ | Bin (bop, e1, e2) -> eval_bin env eval bop e1 e2
+ | Let (x, e1, e2) -> eval_let env x e1 e2
+ | If (e1, e2, e3) -> eval_if env e1 e2 e3
+ | Fun (x, e) -> eval_fun env x e
+ | App (e1, e2) -> eval_app env e1 e2
+ | Exn -> VExn
+
+ and resolve env x =
+ match env with
+ | [] -> VExn
+ | h :: _ when fst h = x -> snd h
+ | _ :: t -> resolve t x
+
+ and eval_bin env eval bop e1 e2 =
+ match bop, eval env e1, eval env e2 with
+ | Add, VInt a, VInt b -> VInt (a + b)
+ | Sub, VInt a, VInt b -> VInt (a - b)
+ | Mul, VInt a, VInt b -> VInt (a * b)
+ | Div, VInt a, VInt b -> VInt (a / b)
+ | Leq, VInt a, VInt b -> VInt (if a <= b then 1 else 0)
+ | _ -> VExn
+
+ and eval_let env x e1 e2 =
+ let v1 = eval env e1 in
+ let env' = (x, v1) :: env in
+ eval env' e2
+
+ and eval_if env e1 e2 e3 =
+ match eval env e1 with
+ | VInt 1 -> eval env e2
+ | VInt 0 -> eval env e3
+ | _ -> VExn
+
+ and eval_fun env x e = VClosure (x, e, env)
+
+ and eval_app env e1 e2 =
+ match eval env e1 with
+ | VClosure (x, e, defenv) ->
+ let v2 = eval env e2 in
+ let defenv' = (x, v2) :: defenv in
+ eval defenv' e
+ | _ -> VExn
+ ;;
+
+ let int_of_value = function
+ | VInt i -> M.return i
+ | VClosure _ -> M.fail (`NotAValue "cannot represent function as integer")
+ | VExn -> M.fail (`NotAValue "interpretation exception")
+ ;;
+
+ let run (e : 'a Ast.t) : (int, [> error ]) M.t = int_of_value (eval [] e)
+end
+
+let parse_and_run str =
+ let module I = Interpret (Base.Result) in
+ let rez = Base.Result.(Parser.parse str >>= I.run) in
+ match rez with
+ | Result.Ok n -> Printf.printf "Success: %d\n" n
+ | Result.Error #Parser.error ->
+ Format.eprintf "Parsing error\n%!";
+ exit 1
+ | Result.Error #error ->
+ Format.eprintf "Interpreter error\n%!";
+ exit 1
+;;
diff --git a/Kormilcyn/lib/interpret.mli b/Kormilcyn/lib/interpret.mli
new file mode 100644
index 00000000..8575e8ab
--- /dev/null
+++ b/Kormilcyn/lib/interpret.mli
@@ -0,0 +1,9 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+val parse_and_run : string -> unit
diff --git a/Kormilcyn/lib/lambda.ml b/Kormilcyn/lib/lambda.ml
new file mode 100644
index 00000000..57d150c7
--- /dev/null
+++ b/Kormilcyn/lib/lambda.ml
@@ -0,0 +1,118 @@
+(** Copyright 2021-2023, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+open Ast
+open Base
+open Utils
+
+(* Smart constructors *)
+let var x = Var x
+let abs x y = Fun (x, y)
+let app x y = App (x, y)
+
+let replace_name x ~by =
+ let rec helper = function
+ | Var y when String.equal x y -> Var by
+ | Var t -> Var t
+ | App (l, r) -> App (helper l, helper r)
+ | Fun (y, t) when String.equal x y -> Fun (by, helper t)
+ | Fun (z, t) -> Fun (z, helper t)
+ in
+ helper
+;;
+
+let rec next_name s old =
+ if List.mem ~equal:String.equal old s then next_name ("_" ^ s) old else s
+;;
+
+(* The call [subst x ~by:v e] means `[x/v]e` or `e[v -> x]` *)
+let subst x ~by:v =
+ let rec helper = function
+ | Var y when String.equal y x -> v
+ | Var y -> Var y
+ | App (l, r) -> app (helper l) (helper r)
+ | Fun (y, b) when String.equal y x -> abs y b
+ | Fun (y, t) when is_free_in y v ->
+ let frees = free_vars v @ free_vars t in
+ let w = next_name y frees in
+ helper (abs w (replace_name y ~by:w t))
+ | Fun (y, b) -> abs y (helper b)
+ in
+ helper
+;;
+
+type strat =
+ { on_var : strat -> name -> string Ast.t
+ ; on_abs : strat -> name -> string Ast.t -> string Ast.t
+ ; on_app : strat -> string Ast.t -> string Ast.t -> string Ast.t
+ }
+
+let apply_strat st = function
+ | Var name -> st.on_var st name
+ | Fun (x, b) -> st.on_abs st x b
+ | App (l, r) -> st.on_app st l r
+;;
+
+let without_strat =
+ let on_var _ = var in
+ let on_abs _ = abs in
+ let on_app _ = app in
+ { on_var; on_abs; on_app }
+;;
+
+let cbn_strat =
+ let on_app st f arg =
+ match apply_strat st f with
+ | Fun (x, e) -> apply_strat st (subst x ~by:arg e)
+ | f2 -> App (f2, arg)
+ in
+ { without_strat with on_app }
+;;
+
+let under_abstraction st x b = abs x (apply_strat st b)
+
+(* Normal Order Reduction to Normal Form
+ Application function reduced as CBN first
+ + Reduce under abstractions *)
+let nor_strat =
+ let on_app st f arg =
+ match apply_strat cbn_strat f with
+ | Fun (x, e) -> apply_strat st @@ subst x ~by:arg e
+ | f1 ->
+ let f2 = apply_strat st f1 in
+ let arg2 = apply_strat st arg in
+ App (f2, arg2)
+ in
+ { without_strat with on_app; on_abs = under_abstraction }
+;;
+
+(* Call-by-Value Reduction to Weak Normal Form *)
+let cbv_strat =
+ let on_app st f arg =
+ match apply_strat st f with
+ | Fun (x, e) ->
+ let arg2 = apply_strat st arg in
+ apply_strat st @@ subst x ~by:arg2 e
+ | f2 -> App (f2, apply_strat st arg)
+ in
+ { without_strat with on_app }
+;;
+
+(* Applicative Order Reduction to Normal Form
+ As CBV but reduce under abstractions *)
+let ao_strat = { cbv_strat with on_abs = under_abstraction }
+let a = var "a"
+let x = var "x"
+let y = var "y"
+let z = var "z"
+let f = var "f"
+let g = var "g"
+let h = var "h"
+let m = var "m"
+let n = var "n"
+let p = var "p"
+let zero = abs "f" @@ abs "x" x
+let one = abs "f" @@ abs "x" @@ app f x
+let two = abs "f" @@ abs "x" @@ app f (app f x)
+let three = abs "f" @@ abs "x" @@ app f (app f (app f x))
diff --git a/Kormilcyn/lib/lambda.mli b/Kormilcyn/lib/lambda.mli
new file mode 100644
index 00000000..cf56ce4f
--- /dev/null
+++ b/Kormilcyn/lib/lambda.mli
@@ -0,0 +1,47 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(*
+ val var : 'a -> 'a Ast.t
+ val abs : 'a -> 'a Ast.t -> 'a Ast.t
+ val app : 'a Ast.t -> 'a Ast.t -> 'a Ast.t *)
+
+val subst : string -> by:string Ast.t -> string Ast.t -> string Ast.t
+
+type strat =
+ { on_var : strat -> Ast.name -> string Ast.t
+ ; on_abs : strat -> Ast.name -> string Ast.t -> string Ast.t
+ ; on_app : strat -> string Ast.t -> string Ast.t -> string Ast.t
+ }
+
+val apply_strat : strat -> string Ast.t -> string Ast.t
+val without_strat : strat
+
+(** Predefined strategies *)
+
+val cbn_strat : strat
+val nor_strat : strat
+val cbv_strat : strat
+val ao_strat : strat
+
+(** Example lambda expressions *)
+
+val a : string Ast.t
+val x : string Ast.t
+val y : string Ast.t
+val z : string Ast.t
+val f : string Ast.t
+val g : string Ast.t
+val h : string Ast.t
+val m : string Ast.t
+val n : string Ast.t
+val p : string Ast.t
+val zero : string Ast.t
+val one : string Ast.t
+val two : string Ast.t
+val three : string Ast.t
diff --git a/Kormilcyn/lib/miniml/ast.mli b/Kormilcyn/lib/miniml/ast.mli
new file mode 100644
index 00000000..31863b69
--- /dev/null
+++ b/Kormilcyn/lib/miniml/ast.mli
@@ -0,0 +1,16 @@
+type name = string
+
+type binop =
+ | Add
+ | Mul
+ | Sub
+ | Div
+
+type 'name t =
+ | Var of 'name
+ | Int of int
+ | Bool of bool
+ | Bin of binop * 'name t * 'name t
+ | Let of 'name * 'name t * 'name t
+ | Fun of 'name * 'name t * 'name t
+ | If of 'name t * 'name t * 'name t
diff --git a/Kormilcyn/lib/parser.ml b/Kormilcyn/lib/parser.ml
new file mode 100644
index 00000000..a647e56f
--- /dev/null
+++ b/Kormilcyn/lib/parser.ml
@@ -0,0 +1,140 @@
+(** Copyright 2021-2023, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+(* TODO: implement parser here *)
+open Angstrom
+
+let is_space = function
+ | ' ' | '\t' | '\n' | '\r' -> true
+ | _ -> false
+;;
+
+let spaces = skip_while is_space
+
+let no_ws p =
+ let* _ = spaces
+ and+ payload = p
+ and+ _ = spaces in
+ return payload
+;;
+
+let varname =
+ let* var =
+ take_while1 (function
+ | 'a' .. 'z' -> true
+ | _ -> false)
+ in
+ match var with
+ | "if" | "then" | "else" | "let" | "in" -> fail "Name not permitted"
+ | _ -> return var
+;;
+
+let integer =
+ take_while1 (function
+ | '0' .. '9' -> true
+ | _ -> false)
+;;
+
+type dispatch =
+ { apps : dispatch -> string Ast.t Angstrom.t
+ ; atom : dispatch -> string Ast.t Angstrom.t
+ ; mul_div : dispatch -> string Ast.t Angstrom.t
+ ; add_sub : dispatch -> string Ast.t Angstrom.t
+ }
+
+let chainl1 p op =
+ let rec loop acc =
+ (let* f = op
+ and+ y = p in
+ loop (f acc y))
+ <|> return acc
+ in
+ let* x = p in
+ loop x
+;;
+
+type error = [ `Parsing_error of string ]
+
+let pp_error ppf = function
+ | `Parsing_error s -> Format.fprintf ppf "%s" s
+;;
+
+let parse_miniml =
+ let atom pack =
+ fix (fun _ ->
+ choice
+ [ (* TODO: binop *)
+ (* аппликация в скобках *)
+ (let* _ = no_ws (char '(')
+ and+ tokens = pack.add_sub pack
+ and+ _ = no_ws (char ')') "Parentheses expected" in
+ return tokens)
+ (* функция *)
+ ; (let* _ = no_ws (string "fun")
+ and+ var = no_ws varname
+ and+ _ = no_ws (string "->")
+ and+ body = pack.apps pack in
+ return (Ast.Fun (var, body)))
+ (* if *)
+ ; (let* _ = no_ws (string "if")
+ and+ cond = pack.apps pack
+ and+ _ = no_ws (string "then")
+ and+ e1 = pack.apps pack
+ and+ _ = no_ws (string "else")
+ and+ e2 = pack.apps pack in
+ return (Ast.If (cond, e1, e2)))
+ (* let *)
+ ; (let* _ = no_ws (string "let")
+ and+ var = no_ws varname
+ and+ _ = no_ws (char '=')
+ and+ e1 = pack.apps pack
+ and+ _ = no_ws (string "in")
+ and+ e2 = pack.apps pack in
+ return (Ast.Let (var, e1, e2)))
+ (* переменная *)
+ ; (let* s = no_ws varname in
+ return (Ast.Var s))
+ (* целое число *)
+ ; (let* i = no_ws integer in
+ return (Ast.Int (int_of_string i)))
+ ])
+ and apps pack =
+ let* app =
+ many1
+ (let* token = no_ws (pack.atom pack) in
+ return token)
+ in
+ match app with
+ | [] -> fail "bad syntax"
+ | x :: xs -> return @@ List.fold_left (fun l r -> Ast.App (l, r)) x xs
+ and mul_div pack =
+ let op =
+ choice
+ [ no_ws (char '*') *> return (fun l r -> Ast.Bin (Ast.Mul, l, r))
+ ; no_ws (char '/') *> return (fun l r -> Ast.Bin (Ast.Div, l, r))
+ ]
+ in
+ chainl1 (pack.apps pack) op
+ and add_sub pack =
+ let op =
+ choice
+ [ no_ws (char '+') *> return (fun l r -> Ast.Bin (Ast.Add, l, r))
+ ; no_ws (char '-') *> return (fun l r -> Ast.Bin (Ast.Sub, l, r))
+ ]
+ in
+ chainl1 (pack.mul_div pack) op
+ in
+ { atom; apps; mul_div; add_sub }
+;;
+
+let parse str =
+ match
+ Angstrom.parse_string
+ (parse_miniml.add_sub parse_miniml)
+ ~consume:Angstrom.Consume.All
+ str
+ with
+ | Result.Ok x -> Result.Ok x
+ | Error er -> Result.Error (`Parsing_error er)
+;;
diff --git a/Kormilcyn/lib/parser.mli b/Kormilcyn/lib/parser.mli
new file mode 100644
index 00000000..40dc6dd8
--- /dev/null
+++ b/Kormilcyn/lib/parser.mli
@@ -0,0 +1,24 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+type error = [ `Parsing_error of string ]
+
+val pp_error : Format.formatter -> [< `Parsing_error of string ] -> unit
+
+(** Main entry of parser *)
+val parse : string -> (Ast.name Ast.t, [> error ]) result
+
+type dispatch =
+ { apps : dispatch -> Ast.name Ast.t Angstrom.t
+ ; atom : dispatch -> Ast.name Ast.t Angstrom.t
+ ; mul_div : dispatch -> Ast.name Ast.t Angstrom.t
+ ; add_sub : dispatch -> Ast.name Ast.t Angstrom.t
+ }
+
+(* A collection of miniparsers *)
+val parse_miniml : dispatch
diff --git a/Kormilcyn/lib/tests.ml b/Kormilcyn/lib/tests.ml
new file mode 100644
index 00000000..ac7be258
--- /dev/null
+++ b/Kormilcyn/lib/tests.ml
@@ -0,0 +1,56 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(** ***** UNIT TESTS COULD GO HERE (JUST AN EXAMPLE) *)
+let rec fact n = if n = 1 then 1 else n * fact (n - 1)
+
+let%test _ = fact 5 = 120
+
+(* These is a simple unit test that tests a single function 'fact'
+ If you want to test something large, like interpretation of a piece
+ of a minilanguge, it is not longer a unit tests but an integration test.
+ Read about dune's cram tests and put the test into `demos/somefile.t`.
+*)
+
+open Lambda_lib
+open Parser
+
+let parse_optimistically str = Result.get_ok (parse str)
+let pp = Printast.pp_named
+
+let%expect_test _ =
+ Format.printf "%a" pp (parse_optimistically "x y");
+ [%expect {| (App ((Var x), (Var y))) |}]
+;;
+
+let%expect_test _ =
+ Format.printf "%a" pp (parse_optimistically "(x y)");
+ [%expect {| (App ((Var x), (Var y))) |}]
+;;
+
+let%expect_test _ =
+ Format.printf "%a" pp (parse_optimistically "(\\x . x x)");
+ [%expect {| (Fun (x, (App ((Var x), (Var x))))) |}]
+;;
+
+let%expect_test _ =
+ Format.printf "%a" pp (parse_optimistically "(λf.λx. f (x x))");
+ [%expect {| (Fun (f, (Fun (x, (App ((Var f), (App ((Var x), (Var x))))))))) |}]
+;;
+
+let _ = Lambda_lib.Interpret.parse_and_run
+let _ = Lambda_lib.Lambda.a
+let _ = Lambda_lib.Lambda.one
+let _ = Lambda_lib.Lambda.p
+let _ = Lambda_lib.Lambda.three
+let _ = Lambda_lib.Lambda.two
+let _ = Lambda_lib.Lambda.without_strat
+let _ = Lambda_lib.Lambda.zero
+let _ = Lambda_lib.Parser.parse_miniml
+let _ = Lambda_lib.Printast.pp
+let _ = Lambda_lib.Printast.show
diff --git a/Kormilcyn/lib/tests.mli b/Kormilcyn/lib/tests.mli
new file mode 100644
index 00000000..639d1975
--- /dev/null
+++ b/Kormilcyn/lib/tests.mli
@@ -0,0 +1,9 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+(* This file is intentionally empty *)
diff --git a/Kormilcyn/lib/utils.ml b/Kormilcyn/lib/utils.ml
new file mode 100644
index 00000000..678f95b9
--- /dev/null
+++ b/Kormilcyn/lib/utils.ml
@@ -0,0 +1,34 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+open Base
+open Ast
+
+(* TODO: use a set instead of list *)
+let list_remove x = List.filter ~f:(fun a -> not (String.equal a x))
+
+let free_vars =
+ let rec helper acc = function
+ | Var s -> s :: acc
+ | Fun (s, l) -> acc @ list_remove s (helper [] l)
+ | App (l, r) -> helper (helper acc r) l
+ in
+ helper []
+;;
+
+let is_free_in x term = List.mem (free_vars term) x ~equal:String.equal
+let var x = Var x
+let abs x l = Fun (x, l)
+let app l r = App (l, r)
+
+(* TODO: rework this *)
+module type MONAD_FAIL = sig
+ include Base.Monad.S2
+
+ val fail : 'e -> ('a, 'e) t
+end
diff --git a/Kormilcyn/lib/utils.mli b/Kormilcyn/lib/utils.mli
new file mode 100644
index 00000000..70e625a5
--- /dev/null
+++ b/Kormilcyn/lib/utils.mli
@@ -0,0 +1,22 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+val free_vars : string Ast.t -> string list
+val is_free_in : string -> string Ast.t -> bool
+
+(** Smart constructors *)
+
+val var : 'a -> 'a Ast.t
+val abs : 'a -> 'a Ast.t -> 'a Ast.t
+val app : 'a Ast.t -> 'a Ast.t -> 'a Ast.t
+
+module type MONAD_FAIL = sig
+ include Base.Monad.S2
+
+ val fail : 'e -> ('a, 'e) t
+end
diff --git a/Kormilcyn/notes/parser_arith_sketch.ml b/Kormilcyn/notes/parser_arith_sketch.ml
new file mode 100644
index 00000000..d6c6f3e1
--- /dev/null
+++ b/Kormilcyn/notes/parser_arith_sketch.ml
@@ -0,0 +1,140 @@
+(* Sketch of arithmetic parsing with precedence, matching current dispatch/fix style. *)
+open Angstrom
+
+(* Minimal helpers mirroring lib/parser.ml *)
+let is_space = function
+ | ' ' | '\t' | '\n' | '\r' -> true
+ | _ -> false
+;;
+
+let spaces = skip_while is_space
+
+let skip_spc p =
+ let* _ = spaces
+ and+ payload = p
+ and+ _ = spaces in
+ return payload
+;;
+
+let varname =
+ take_while1 (function
+ | 'a' .. 'z' -> true
+ | _ -> false)
+;;
+
+let integer =
+ take_while1 (function
+ | '0' .. '9' -> true
+ | _ -> false)
+;;
+
+module Ast = struct
+ type binop =
+ | Add
+ | Mul
+ | Sub
+ | Div
+
+ type 'a t =
+ | Var of 'a
+ | Fun of 'a * 'a t
+ | App of 'a t * 'a t
+ | Int of int
+ | Bin of binop * 'a t * 'a t
+ | Let of 'a * 'a t * 'a t
+ | If of 'a t * 'a t * 'a t
+end
+
+type dispatch =
+ { binop : dispatch -> Ast.binop -> string Ast.t Angstrom.t
+ ; apps : dispatch -> string Ast.t Angstrom.t
+ ; single : dispatch -> string Ast.t Angstrom.t
+ }
+
+let chainl1 p op =
+ let rec loop acc =
+ (let* f = op
+ and+ y = p in
+ loop (f acc y))
+ <|> return acc
+ in
+ let* x = p in
+ loop x
+;;
+
+let chainl1 p op =
+ let rec loop acc =
+ (let* f = op
+ and+ y = p in
+ loop (f acc y))
+ <|> return acc
+ in
+ let* x = p in
+ loop x
+;;
+
+(* single через fix, но только атомы *)
+let single pack =
+ fix (fun atom ->
+ choice
+ [ (let* _ = skip_spc (char '(')
+ and+ e = pack.apps pack
+ and+ _ = skip_spc (char ')') in
+ return e)
+ ; (let* _ = skip_spc (string "fun")
+ and+ v = skip_spc varname
+ and+ _ = skip_spc (string "->")
+ and+ b = pack.apps pack in
+ return (Ast.Fun (v, b)))
+ ; (let* _ = skip_spc (string "if")
+ and+ c = pack.apps pack
+ and+ _ = skip_spc (string "then")
+ and+ e1 = pack.apps pack
+ and+ _ = skip_spc (string "else")
+ and+ e2 = pack.apps pack in
+ return (Ast.If (c, e1, e2)))
+ ; (let* _ = skip_spc (string "let")
+ and+ v = skip_spc varname
+ and+ _ = skip_spc (char '=')
+ and+ e1 = pack.apps pack
+ and+ _ = skip_spc (string "in")
+ and+ e2 = pack.apps pack in
+ return (Ast.Let (v, e1, e2)))
+ ; (skip_spc varname >>| fun v -> Ast.Var v)
+ ; (skip_spc integer >>| fun i -> Ast.Int (int_of_string i))
+ ])
+;;
+
+(* аппликация поверх атомов *)
+let apps pack =
+ let* xs = many1 (skip_spc (pack.single pack)) in
+ match xs with
+ | x :: tl -> return (List.fold_left (fun l r -> Ast.App (l, r)) x tl)
+ | [] -> fail "bad syntax"
+;;
+
+(* уровни приоритета *)
+let mul_div pack =
+ let op =
+ choice
+ [ skip_spc (char '*') *> return (fun l r -> Ast.Bin (Ast.Mul, l, r))
+ ; skip_spc (char '/') *> return (fun l r -> Ast.Bin (Ast.Div, l, r))
+ ]
+ in
+ chainl1 (apps pack) op
+;;
+
+let add_sub pack =
+ let op =
+ choice
+ [ skip_spc (char '+') *> return (fun l r -> Ast.Bin (Ast.Add, l, r))
+ ; skip_spc (char '-') *> return (fun l r -> Ast.Bin (Ast.Sub, l, r))
+ ]
+ in
+ chainl1 (mul_div pack) op
+;;
+
+(* Итоговый диспетчер; binop не нужен, можно заглушку. *)
+let parse_miniml =
+ { binop = (fun _ _ -> fail "binop unused in sketch"); single; apps = add_sub }
+;;
diff --git a/Kormilcyn/tests/.gitignore b/Kormilcyn/tests/.gitignore
new file mode 100644
index 00000000..26685e79
--- /dev/null
+++ b/Kormilcyn/tests/.gitignore
@@ -0,0 +1 @@
+lam*.txt
\ No newline at end of file
diff --git a/Kormilcyn/tests/dune b/Kormilcyn/tests/dune
new file mode 100644
index 00000000..31780410
--- /dev/null
+++ b/Kormilcyn/tests/dune
@@ -0,0 +1,31 @@
+(executable
+ (name gen_tests)
+ (libraries lambda_lib)
+ (modules gen_tests)
+ (instrumentation
+ (backend bisect_ppx)))
+
+(rule
+ (deps ./gen_tests.exe)
+ (targets
+ lam_zero.txt
+ lam_one.txt
+ lam_1+1.txt
+ lam_2x1.txt
+ lam_3x2.txt
+ lam_fac3.txt)
+ (mode
+ (promote (until-clean)))
+ (action
+ (run %{deps})))
+
+(cram
+ (applies_to interpret_tests)
+ (deps
+ lam_zero.txt
+ lam_one.txt
+ lam_1+1.txt
+ lam_2x1.txt
+ lam_3x2.txt
+ lam_fac3.txt
+ ../bin/REPL.exe))
diff --git a/Kormilcyn/tests/gen_tests.ml b/Kormilcyn/tests/gen_tests.ml
new file mode 100644
index 00000000..6ae0f429
--- /dev/null
+++ b/Kormilcyn/tests/gen_tests.ml
@@ -0,0 +1,61 @@
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
+
+open Lambda_lib
+open Ast
+open Lambda
+open Utils
+
+let zero = abs "g" @@ abs "y" @@ Var "y"
+let one = abs "f" @@ abs "x" @@ app f (Var "x")
+let two = abs "f" @@ abs "x" @@ app f (app f x)
+let three = abs "f" @@ abs "x" @@ app f (app f (app f x))
+let plus = abs "m" @@ abs "n" @@ abs "f" @@ abs "x" @@ app m @@ app f @@ app n @@ app f x
+let mul = abs "x" @@ abs "y" @@ abs "z" @@ app x (app y z)
+let true_ = abs "x" @@ abs "y" @@ Var "x"
+let false_ = abs "x" @@ abs "y" @@ Var "y"
+let isZero = abs "n" @@ app (app n (abs "x" false_)) true_
+
+(* TODO: write the right if-then-else
+ by adding thunk around then and else branches to delay the evaluation *)
+let pred =
+ let xxx = abs "g" @@ abs "h" @@ app h (app g f) in
+ abs "n" @@ abs "f" @@ abs "x" @@ app (app (app n xxx) (abs "u" x)) (abs "u" (Var "u"))
+;;
+
+let pp = Pprintast.pp
+
+let out_term file lam =
+ Out_channel.with_open_text file (fun ch ->
+ Format.fprintf (Format.formatter_of_out_channel ch) "%a%!" pp lam;
+ flush ch)
+;;
+
+let () = out_term "lam_zero.txt" zero
+let () = out_term "lam_one.txt" one
+let () = out_term "lam_1+1.txt" (app plus @@ app one one)
+let () = out_term "lam_2x1.txt" (app (app mul two) one)
+let () = out_term "lam_3x2.txt" (app (app mul three) two)
+
+(** Definition for normal order *)
+module _ = struct
+ let ite cond th el = app (app (app isZero cond) th) el
+
+ let fact =
+ abs "s"
+ @@ abs "n"
+ @@ ite (Var "n") one (app (app mul (app (var "s") (app pred (var "n")))) (var "n"))
+ ;;
+
+ let ygrek =
+ let hack = abs "x" (app f (app x x)) in
+ abs "f" (app hack hack)
+ ;;
+
+ let () = out_term "lam_fac3.txt" @@ app (app ygrek fact) three
+end
diff --git a/Kormilcyn/tests/gen_tests.mli b/Kormilcyn/tests/gen_tests.mli
new file mode 100644
index 00000000..b0431923
--- /dev/null
+++ b/Kormilcyn/tests/gen_tests.mli
@@ -0,0 +1,9 @@
+(* Intentionally empty *)
+
+[@@@ocaml.text "/*"]
+
+(** Copyright 2021-2024, Kakadu and contributors *)
+
+(** SPDX-License-Identifier: LGPL-3.0-or-later *)
+
+[@@@ocaml.text "/*"]
diff --git a/Kormilcyn/tests/interpret_tests.t b/Kormilcyn/tests/interpret_tests.t
new file mode 100644
index 00000000..8898acac
--- /dev/null
+++ b/Kormilcyn/tests/interpret_tests.t
@@ -0,0 +1,74 @@
+Copyright 2021-2024, Kakadu and contributors
+SPDX-License-Identifier: CC0-1.0
+
+Cram tests here. They run and compare program output to the expected output
+https://dune.readthedocs.io/en/stable/tests.html#cram-tests
+Use `dune promote` after you change things that should runned
+
+If you need to put sample program and use it both in your interpreter and preinstalled one,
+you could put it into separate file. Thise will need stanza `(cram (deps demo_input.txt))`
+in the dune file
+
+ $ ../bin/REPL.exe -cbv -dparsetree < \f.x
+ Parsed result: (Fun (f, (Var x)))
+ Evaluated result: (λ _ . x)
+ $ ../bin/REPL.exe -dparsetree < garbage242
+ Error: : end_of_input
+
+
+
+ $ ../bin/REPL.exe -no -dparsetree < (\x.\y.x)(\u.u)((\x. x x)(\x.x x))
+ Parsed result: (App (
+ (App ((Fun (x, (Fun (y, (Var x))))), (Fun (u, (Var u))))),
+ (App ((Fun (x, (App ((Var x), (Var x))))),
+ (Fun (x, (App ((Var x), (Var x)))))))
+ ))
+ Evaluated result: (λ u . u)
+Below we redirect contents of the file to the evaluator
+ $ ../bin/REPL.exe -dparsetree -stop-after parsing < lam_1+1.txt
+ Parsed result: (App (
+ (Fun (m,
+ (Fun (n,
+ (Fun (f,
+ (Fun (x,
+ (App ((Var m),
+ (App ((Var f),
+ (App ((Var n), (App ((Var f), (Var x)))))
+ ))
+ ))
+ ))
+ ))
+ ))
+ )),
+ (App ((Fun (f, (Fun (x, (App ((Var f), (Var x))))))),
+ (Fun (f, (Fun (x, (App ((Var f), (Var x)))))))))
+ ))
+
+ $ ../bin/REPL.exe -ao < lam_1+1.txt
+ Evaluated result: (λ n f x _x -> ((f (n (f x))) _x))
+ $ ../bin/REPL.exe -ao < lam_2x1.txt
+ Evaluated result: 2
+Call by value doesn't reduce under abstraction
+ $ ../bin/REPL.exe -cbv < lam_2x1.txt
+ Evaluated result: (λ z . (2 (1 z)))
+ $ ../bin/REPL.exe -ao -small < lam_3x2.txt
+ -- ((λ y z -> ((λ f x -> (f (f (f x)))) (y z))) 2)
+ -- ((λ y z x -> ((y z) ((y z) ((y z) x)))) 2)
+ -- (λ z x -> ((2 z) ((2 z) ((2 z) x))))
+ -- (λ z x -> ((λ x . (z (z x))) ((2 z) ((2 z) x))))
+ -- (λ z x -> ((λ x . (z (z x))) ((λ x . (z (z x))) ((2 z) x))))
+ -- (λ z x -> ((λ x . (z (z x))) ((λ x . (z (z x))) ((λ x . (z (z x))) x))))
+ -- (λ z x -> ((λ x . (z (z x))) ((λ x . (z (z x))) (z (z x)))))
+ -- (λ z x -> ((λ x . (z (z x))) (z (z (z (z x))))))
+ -- (λ z x -> (z (z (z (z (z (z x)))))))
+ Evaluated result: (λ z x -> (z (z (z (z (z (z x)))))))
+ $ ../bin/REPL.exe -ao < lam_zero.txt
+ Evaluated result: ⊥
+For 3! we use noral order reduction
+ $ cat lam_fac3.txt
+ (((λ f . ((λ x . (f (x x))) (λ x . (f (x x))))) (λ s . (λ n . ((((λ n . ((n (λ x . (λ x . (λ y . y)))) (λ x . (λ y . x)))) n) (λ f . (λ x . (f x)))) (((λ x . (λ y . (λ z . (x (y z))))) (s ((λ n . (λ f . (λ x . (((n (λ g . (λ h . (h (g f))))) (λ u . x)) (λ u . u))))) n))) n))))) (λ f . (λ x . (f (f (f x))))))
+ $ ../bin/REPL.exe -no < lam_fac3.txt
+ Evaluated result: (λ z x -> (z (z (z (z (z (z x)))))))