Skip to Content.
Sympa Menu

maude-help - Re: [[Maude-help] ] bounded search without intermediate results

maude-help AT lists.cs.illinois.edu

Subject: Maude-help mailing list

List archive

Re: [[Maude-help] ] bounded search without intermediate results


Chronological Thread 
  • From: Paco Durán <duran AT lcc.uma.es>
  • To: hcantunc AT gmail.com
  • Cc: Francisco Durán <duran AT lcc.uma.es>, maude-help AT lists.cs.illinois.edu
  • Subject: Re: [[Maude-help] ] bounded search without intermediate results
  • Date: Wed, 4 Dec 2019 21:13:24 +0000
  • Authentication-results: illinois.edu; spf=pass smtp.mailfrom=duran AT lcc.uma.es; dmarc=none

Use =>! instead of =>*.

Best,

Francisco

> On 4 Dec 2019, at 21:08,
> <hcantunc AT gmail.com>
>
> <hcantunc AT gmail.com>
> wrote:
>
> Hello,
>
> I have some search statement as the following:
>
> search [, 100000] <some very long expression> =>* A::SomeSort such that
> A::SomeSort =/= cnd .
>
> The specification is not Church-Rosser and terminating, therefore there's no
> unique normal form.
> When I execute the above statement, I get a lot of intermediate solutions
> since the condition '=/= cnd' is not very selective. But what I'm actually
> interested in extracting is the terms which cannot be reduced further and
> the
> leaf nodes in the search tree at the given maximum depth. I am wondering if
> there's a way to achieve this.
>
> Thank you.

Attachment: smime.p7s
Description: S/MIME cryptographic signature




Archive powered by MHonArc 2.6.19.

Top of Page