*To*: "Jens-D. Doll" <jd at cococo.de>*Subject*: Re: [isabelle] Code-equations for multisets*From*: René Thiemann <rene.thiemann at uibk.ac.at>*Date*: Thu, 27 Feb 2014 08:23:25 +0100*Cc*: Isabelle Users List <cl-isabelle-users at lists.cam.ac.uk>*In-reply-to*: <op.xbxh5vbjsgirxy@g2s>*References*: <op.xbumoeo7sgirxy@g2s> <01659DB8-26FE-44EC-983B-281C17C9BC0C@uibk.ac.at> <op.xbxh5vbjsgirxy@g2s>

>>> Aren't there some undecidable areas? And which results do we have on normal forms and reducability? >> >> Can you be more precise? The above problems at least have nothing to do with undecidability! >> you consider code comparison of a phrase structure language or subsets of it you will find intractables and undicidables; at least the current theory says so. Maybe, but I do not see the connection between the "code comparison of a phrase structure language" and my topic, the implementation of finite multisets. René

**References**:**[isabelle] Code-equations for multisets***From:*Jens-D. Doll

**Re: [isabelle] Code-equations for multisets***From:*René Thiemann

**[isabelle] Code-equations for multisets***From:*Jens-D. Doll

- Previous by Date: [isabelle] Code-equations for multisets
- Next by Date: Re: [isabelle] Code Generator: Sealed Data
- Previous by Thread: [isabelle] Code-equations for multisets
- Next by Thread: [isabelle] Isabelle (JEDIT) seems slower than Isabelle(emacs)
- Cl-isabelle-users February 2014 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list