Mercury Training Centers, Institutes & Training Course Classes in Jaya Nagar- Listings as of June 22, 2018.

1 Introduction
2 Syntax
2.1 Syntax overview
2.2 Character set
2.3 Whitespace
2.4 Tokens
2.5 Terms
2.6 Builtin operators
2.7 Items
2.8 Declarations
2.9 Facts
2.10 Rules
2.11 Goals
2.12 State variables
2.13 DCG-rules
2.14 DCG-goals
2.15 Data-terms
2.15.1 Data-functors
2.15.2 Record syntax
2.15.3 Unification expressions
2.15.4 Conditional expressions
2.15.5 Lambda expressions
2.15.6 Higher-order function applications
2.15.7 Explicit type qualification
2.16 Variable scoping
2.17 Implicit quantification
2.18 Elimination of double negation
3 Types
3.1 Builtin types
3.2 User-defined types
3.2.1 Discriminated unions
3.2.2 Equivalence types
3.2.3 Abstract types
3.3 Predicate and function type declarations
3.4 Field access functions
3.4.1 Field selection
3.4.2 Field update
3.4.3 User-supplied field access function declarations
3.4.4 Field access examples
3.5 The standard ordering
4 Modes
4.1 Insts, modes, and mode definitions
4.2 Predicate and function mode declarations
4.3 Constrained polymorphic modes
4.4 Different clauses for different modes
5 Unique modes
5.1 Destructive update
5.2 Backtrackable destructive update
5.3 Limitations of the current implementation
6 Determinism
6.1 Determinism categories
6.2 Determinism checking and inference
6.3 Replacing compile-time checking with run-time checking
6.4 Interfacing nondeterministic code with the real world
6.5 Committed choice nondeterminism
7 User-defined equality and comparison
8 Higher-order programming
8.1 Creating higher-order terms
8.2 Calling higher-order terms
8.3 Higher-order insts and modes
8.3.1 Builtin higher-order insts and modes
8.3.2 Default insts for functions
8.3.3 Combined higher-order types and insts
9 Modules
9.1 The module system
9.2 An example module.
9.3 Sub-modules
9.3.1 Nested sub-modules
9.3.2 Separate sub-modules
9.3.3 Visibility rules
9.3.4 Implementation bugs and limitations
9.4 Module initialisation
9.5 Module finalisation
9.6 Module-local mutable variables
10 Type classes
10.1 Typeclass declarations
10.2 Instance declarations
10.3 Abstract typeclass declarations
10.4 Abstract instance declarations
10.5 Type class constraints on predicates and functions
10.6 Type class constraints on type class declarations
10.7 Type class constraints on instance declarations
10.8 Functional dependencies
11 Existential types
11.1 Existentially typed predicates and functions
11.1.1 Syntax for explicit type quantifiers
11.1.2 Semantics of type quantifiers
11.1.3 Examples of correct code using type quantifiers
11.1.4 Examples of incorrect code using type quantifiers
11.2 Existential class constraints
11.3 Existentially typed data types
11.4 Some idioms using existentially quantified types
12 Exception handling
13 Semantics
14 Foreign language interface
14.1 Calling foreign code from Mercury
14.1.1 pragma foreign_proc
14.1.2 Foreign code attributes
14.2 Calling Mercury from foreign code
14.3 Data passing conventions
14.3.1 C data passing conventions
14.3.2 C# data passing conventions
14.3.3 Java data passing conventions
14.3.4 Erlang data passing conventions
14.4 Using foreign types from Mercury
14.5 Using Mercury enumerations in foreign code
14.6 Using foreign enumerations in Mercury code
14.7 Adding foreign declarations
14.8 Declaring Mercury exports to other modules
14.9 Adding foreign definitions
14.10 Language specific bindings
14.10.1 Interfacing with C
14.10.1.1 Using pragma foreign_type for C
14.10.1.2 Using pragma foreign_export_enum for C
14.10.1.3 Using pragma foreign_enum for C
14.10.1.4 Using pragma foreign_proc for C
14.10.1.5 Using pragma foreign_export for C
14.10.1.6 Using pragma foreign_decl for C
14.10.1.7 Using pragma foreign_code for C
14.10.1.8 Memory management for C
14.10.1.9 Linking with C object files
14.10.2 Interfacing with C#
14.10.2.1 Using pragma foreign_type for C#
14.10.2.2 Using pragma foreign_export_enum for C#
14.10.2.3 Using pragma foreign_enum for C#
14.10.2.4 Using pragma foreign_proc for C#
14.10.2.5 Using pragma foreign_export for C#
14.10.2.6 Using pragma foreign_decl for C#
14.10.2.7 Using pragma foreign_code for C#
14.10.3 Interfacing with Java
14.10.3.1 Using pragma foreign_type for Java
14.10.3.2 Using pragma foreign_export_enum for Java
14.10.3.3 Using pragma foreign_enum for Java
14.10.3.4 Using pragma foreign_proc for Java
14.10.3.5 Using pragma foreign_export for Java
14.10.3.6 Using pragma foreign_decl for Java
14.10.3.7 Using pragma foreign_code for Java
14.10.4 Interfacing with Erlang
14.10.4.1 Using pragma foreign_type for Erlang
14.10.4.2 Using pragma foreign_export_enum for Erlang
14.10.4.3 Using pragma foreign_proc for Erlang
14.10.4.4 Using pragma foreign_export for Erlang
14.10.4.5 Using pragma foreign_decl for Erlang
14.10.4.6 Using pragma foreign_code for Erlang
15 Impurity declarations
15.1 Choosing the right level of purity
15.2 Purity ordering
15.3 Semantics
15.4 Declaring impure functions and predicates
15.5 Marking a goal as impure
15.6 Promising that a predicate is pure
15.7 An example using impurity
15.8 Using impurity with higher-order code
15.8.1 Purity annotations on higher-order types
15.8.2 Purity annotations on lambda expressions
15.8.3 Purity annotations on higher-order calls
16 Solver types
16.1 The ‘any’ inst
16.2 Abstract solver type declarations
16.3 Solver type definitions
16.4 Implementing solver types
16.5 Solver types and negated contexts
17 Trace goals
18 Pragmas
18.1 Inlining
18.2 Type specialization
18.2.1 Syntax and semantics of type specialization pragmas
18.2.2 When to use type specialization
18.2.3 Implementation specific details
18.3 Obsolescence
18.4 No determinism warnings
18.5 No dead predicate warnings
18.6 Source file name
19 Implementation-dependent extensions
19.1 Fact tables
19.2 Tabled evaluation
19.3 Termination analysis
19.4 Feature sets
19.5 Trailing
19.5.1 Choice points
19.5.2 Value trailing
19.5.3 Function trailing
19.5.4 Delayed goals and floundering
19.5.5 Avoiding redundant trailing
20 Bibliography