[m-rev.] for review: pragma reserve_tag
Ralph Becket
rafe at cs.mu.OZ.AU
Sun Jan 12 10:45:06 AEDT 2003
Fergus Henderson, Saturday, 11 January 2003:
> Estimated hours taken: 6
> Branches: main
>
> Implement `:- pragma reserve_tag(<TypeName>/<Arity>).'.
> This has the same effect as the `--reserve-tag' option,
> except that it only applies to specified type, rather than
> to all types.
>
> [...]
>
> --- doc/reference_manual.texi 23 Dec 2002 12:32:58 -0000 1.264
> +++ doc/reference_manual.texi 10 Jan 2003 16:00:12 -0000
> @@ -8845,6 +8850,50 @@
>
> @end ifset
> @c aditi
> +
> + at c XXX The `reserved tag' pragma is not documented because it is intended to
> + at c be used with `any' insts, which are themselves not yet documented.
> + at c Also, it is a quite low-level facility, and very
> + at c implementation-specific...
> + at c
> + at c @node Reserved tag
> + at c @section Reserved tag
> + at c
> + at c The University of Melbourne Mercury implementation includes some fairly
> + at c low-level support for implementing Herbrand constraint solvers
> + at c (i.e. Prolog-style logic variables).
> + at c
> + at c In particular, you can use the @samp{reserve_tag} pragma
> + at c to tell the compiler to reserve a tag in the data representation
> + at c for a type. The intent is for this tag to be used to represent
> + at c unbound variables with inst @samp{any}.
> + at c
> + at c The @samp{reserve_tag} pragma declaration has the following form:
> + at c @example
> + at c :- pragma reserve_tag(@var{type-name}, @var{type-arity}).
> + at c @end example
I think you mean
@c :- pragma reserve_tag(@var{type-name}/@var{type-arity}).
Ralph
--------------------------------------------------------------------------
mercury-reviews mailing list
post: mercury-reviews at cs.mu.oz.au
administrative address: owner-mercury-reviews at cs.mu.oz.au
unsubscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: unsubscribe
subscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------
More information about the reviews
mailing list