[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*From*: Ron Pressler <r...@xxxxxxxxxxxxxxxxxxx>*Date*: Thu, 7 Jan 2016 09:39:52 -0800 (PST)*References*: <71319d03-6ab4-48a7-a6a2-53e7c9c48a51@googlegroups.com> <77ff66be-f3e5-4c2f-8906-28ebb049baae@googlegroups.com> <6eea8b8b-3f42-4a7a-b31f-ee6db19cf15c@googlegroups.com>

Reading chapter 17 of Specifying Systems, I now better understand TLA+'s evaluation strategy, so I guess my question becomes, is there a way to force the evaluation of an _expression_ before the beta-reduction so that it is no longer subject to priming, as the prime operator (when applied to an _expression_) seems to be sensitive to a specific evaluation strategy?

Ron

**References**:**Tagged formulas***From:*Ron Pressler

**Re: Tagged formulas***From:*Leslie Lamport

**Re: Tagged formulas***From:*Ron Pressler

- Prev by Date:
**Re: Recursive definitions of higher-order operators** - Next by Date:
**Re: Tagged formulas** - Previous by thread:
**Re: Tagged formulas** - Next by thread:
**Re: Tagged formulas** - Index(es):