Modules
Modules are a programming language construction that allows us to package related definitions together. A canonical example of a module is a data type and associated operations over it (e.g. stacks or queues). The rest of the program can access these definitions in a regular and abstract way, providing maintainability, reusability and safety.
For a concrete example, we could create a module that packages a type that represents amounts in a particular currency together with functions that manipulate these amounts: constants, addition, subtraction, etc. A piece of code that uses this module can be agnostic concerning how the type is actually represented inside the module: it is said to be abstract.
Declaring Modules
Modules are introduced using the module
keyword. For example, the
following code defines a module EURO
that packages together a type,
called t
, together with an operation add
that sums two values of
the given currency, as well as constants for zero and one.
As we can see, in CameLIGO we also use a struct ... end
block to
group together the definitions made in the module.
Using Modules
We can access a module's components by using the selection operator
.
. Let us suppose that our storage keeps a value in euros using the
previously defined module EURO
. Then, we can write a main
entry
point that increments the storage value each time it is called.
In principle, we could change the implementation of EURO
, without
having to change the storage
type or the function main
. For
example, if we decide later that we should support manipulating
negative values, we could change EURO
as follows:
Notice that the code in main
still works, and no change is
needed. Abstraction accomplished!
⚠️ Please note that code using the module
EURO
might still break the abstraction if it directly uses the underlying representation ofEURO.t
. Client code should always try to respect the interface provided by the module, and not make assumptions on its current underlying representation (e.g.EURO.t
is a transparent alias ofnat
; future versons of LIGO might make this an opaque/abstract type).
Nested Modules: Sub-Modules
Modules can be nested, which means that we can define a module inside
another module. Let's see how that works, and define a variant of
EURO
in which the constants are all grouped inside using a sub-module.
To access nested modules we simply apply the selection operator more than once:
Modules and Imports: Build System
Modules also allow us to separate our code in different files: when we import a file, we obtain a module encapsulating all the definitions in it. This will become very handy for organising large contracts, as we can divide it into different files, and the module system keeps the naming space clean.
Generally, we will take a set of definitions that can be naturally grouped by functionality, and put them together in a separate file.
For example, in CameLIGO, we can create a file imported.mligo
:
Later, in another file, we can import imported.mligo
as a module, and
use its definitions. For example, we could create a importer.mligo
that imports all definitions from imported.mligo
as the module
EURO
:
We can compile the file that uses the #import
statement directly,
without having to mention the imported file.
Module Aliases
LIGO supports module aliases, that is, modules that work as synonyms to other (previously defined) modules. This feature can be useful if we could implement a module using a previously defined one, but in the future, we might need to change it.
Modules as Contracts
When a module contains declarations that are tagged with the attribute
@entry
, then a contract can be obtained from such module. All
declarations in the module tagged as @entry
are grouped, and a
dispatcher contract is generated.
A module can be compiled as a contract using -m
:
To access the contract from the module, the primitive contract_of
can be used. The type of the parameter generated for the module can be
obtaining using the primitive parameter_of
. This is particularly
useful when working with the testing framework, in conjunction with the
function Test.originate
:
Module Inclusion
When writing a new version of a given contract derived from a module, it is often needed to add new features, that is, new types and values, for example when implementing the next version of a standard. This can be achieved by defining a new module that includes the types and values of the old one, and defines new ones.The inclusion of a module M
is specified with a field include M
,
like so:
Module Types
Until now, we dealt with implicit module types, also know as signatures. Having explicitly declared module types enable abstraction and reusability by inclusion of signatures. Module types are defined like in OCaml:
Notice how t
in the type of transfer2
refers to t
in the
signature FA0_SIG
and remains abstract. We can now revisit the
examples above by constraining the module definitions with the module
types:
Note how module definitions must instantiate any abstract type (here
FA0Impl.t
). Also, when a module is constrained by a signature, it
must implement the types and values in the latter, but no more: this
is a filtering semantics.