It will be co-located with LICS and ICTCS conferences.

ITP will carefully monitor the development of the COVID-19 pande= mic,

and take guidance from the health authorities to determine wheth= er

ITP21 will be held physically, virtually, or in a hybrid manner= =2E

Researchers and practitioners are invited to submit proposals for

co-located workshops on topics relating to= interactive theorem

proving. Workshops can target the ITP community in general, focu= s on a

particular ITP system, or highlight more specific issues or rece= nt

developments. Proposals for in-depth tutorials or tool introduct= ions

are also welcome.

Co-located events will take place on 28 June and 2 July and

will be held on the same premises as the main conference. In cas= e of

needs, we are ready to discuss and try to accommodat= e requests for

two-day workshops. Conference facilities are offered free of charge to=

one of the organizers and one of the invited speakers. Workshop-only&n= bsp;

attendees will enjoy a significantly reduced registration fee.

Detailed organizational matters such as paper submission and rev= iew

process, or publication of proceedings, are up to the organizers= of

individual workshops. All accepted workshops will be expected to= have

their program ready by 4 June, 2021.

Proposals for workshops should contain at least the following pi= eces

of information:

name and contact details of the main organizer(s)

(if applicable:) names of additional organizers

title and organizational style of the workshop (tutorial, public<= br />workshop, project workshop, etc.)

preferred length of the workshop (half day or full day)
estimated number of attendees

short (up to one page) description of the topic

(if applicable:) pointers to previous editions of the workshop, o= r
to similar events

(if applicable:) special needs for an online event

Proposals should be submitted by email to

itp2021-workshops at easyconferences.eu,

no later than 11 January, 2021.

Selected workshops will be notified by 15 January, 2021.<= /div> --=_77cb94131bc13e1d992540a301361851-- From prisc.pc.chairs at gmail.com Thu Dec 03 17:25:56 2020 Received: from ppsw-40.csi.cam.ac.uk ([131.111.8.140]:46260) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kksMe-00080u-Ah (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Thu, 03 Dec 2020 17:25:56 +0000 X-Cam-SpamDetails: score 0.7 from SpamAssassin-3.4.4-1883976 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.221.52 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.221.52 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [prisc.pc.chairs[at]gmail.com] * 0.0 HTML_MESSAGE BODY: HTML included in message * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * 1.0 FREEMAIL_REPLY From and body contain different freemails X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-wr1-f52.google.com ([209.85.221.52]:43611) by ppsw-40.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.148]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kksMd-000Mob-kC (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Thu, 03 Dec 2020 17:25:56 +0000 Received: by mail-wr1-f52.google.com with SMTP id s8so2680339wrw.10 for ; Thu, 03 Dec 2020 09:25:55 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:from:date:message-id:subject:to; bh=1PPYeE/GQzvROTQUHrynB2dhZ4nysY02oen68geVAHM=; b=b02Lm0oKgAyP0X0sm1e7FDaXZz/1mDdEalFJX7KOwq21lcRuHyPQXJVX5qN70a89wm c/Vbn3ckl5MeXLCgm7G2QqWhctIA/h746oes+gzXFgiARPmoIPNTgIpjwYgeuYXcUxkY W5oLHOwxzT+jQJA82tfV5GaHDK8iL43b6lM7KgG/prZ2+ypq3mtk9nn+/9iQNqnyugVo v6WZJREV2jjkNue+AwqCE/SAvhnG1r7gdFCRGYQtmJrVB+hTbT9nW0wM7erEUNOpOE3b vMvW0V4RwEJuBVgYhjtdO0mIAjxOxNgzYBiF1bt41AIPEs0pSfnCpy2/sZNXvucEJJ8r gmYw== X-Gm-Message-State: AOAM530Qam//67Sgl6YTPmH/6s0MQPxkkWz0r1PNlfzzP6yMWxgRe6+Z dfXAEGdYmpPyPL+Mye79p5DAsWRLLI2nGKjpGsY= X-Google-Smtp-Source: ABdhPJyjDogBD/pwh3fPJh9GMW5BKUseWxttB35q6cDa8x3E+fFg9OS+o5Pfl6FizT3vVN4RzYeXvbNPvcSZqB/+M5E= X-Received: by 2002:adf:f143:: with SMTP id y3mr262663wro.138.1607016355006; Thu, 03 Dec 2020 09:25:55 -0800 (PST) MIME-Version: 1.0 From: PriSC PC Chairs Date: Thu, 3 Dec 2020 09:25:44 -0800 Message-ID: To: prisc-announce at lists.gforge.inria.fr, seminar-18201 at dagstuhl.de, csf-attendees at mail-infsec.cs.uni-saarland.de, security at fosad.org, compcert-users at inria.fr, coq-club at inria.fr, cl-isabelle-users at lists.cam.ac.uk, types-announce at lists.seas.upenn.edu, eutypes at cs.ru.nl, haskell at haskell.org, caml-list at inria.fr Content-Type: multipart/alternative; boundary="000000000000fd0ce005b592a6c1" X-Mailman-Approved-At: Fri, 04 Dec 2020 10:18:37 +0000 Subject: [isabelle] PriSC 2021: call for participation and short talks X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 03 Dec 2020 17:25:56 -0000 --000000000000fd0ce005b592a6c1 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Principles of Secure Compilation (PriSC) 2021: Call for Participation and Short Talks tl;dr: a new exciting edition of PriSC is in the works! as usual, we've reserved a few slots for short talks, where speakers can spend a few minutes telling us about ongoing work and foster informal discussions; please do send us your short talks proposals! Principles of Secure Compilation Workshop (PriSC 2021) - Registration: https://popl21.sigplan.org/ - Accepted talks available here: https://popl21.sigplan.org/home/prisc-2021#event-overview - Invited speaker: Hugo Vincent (ARM) - Call for short talks: see below Deadline: January 11th 2021 The Workshop on Principles of Secure Compilation (PriSC) is an informal 1-day workshop without proceedings. The goal is to bring together researchers interested in secure compilation and to identify interesting research directions and open challenges. PriSC 2021 will be held on Saturday January 17th, 2021 online. It will be co-located with POPL 2021, also online. For more information about this edition and the PriSC series, please visit https://popl21.sigplan.org/home/prisc-2021 ### Invited Speakers Hugo Vincent (ARM) ### Accepted papers The list of accepted talks is available at https://popl21.sigplan.org/track/prisc-2021#event-overview ### Call for Short Talks We also have a short talks session, where participants get 5 minutes to present intriguing ideas, advertise ongoing work, etc. If you're interested in giving a short 5-minute talk, please submit an abstract. Any topic that could be of interest to the emerging secure compilation community is in scope. Presentations that provide a useful outside view or challenge the community are also welcome. - Deadline: January 11th, 2021 - More details: https://popl21.sigplan.org/home/prisc-2021#Call-for-Short-Talks - Submit here: https://forms.gle/wkCyK4fN3i11nbyD7 ### Workshop summary The emerging field of secure compilation aims to preserve security properties of programs when they have been compiled to low-level languages such as assembly, where high-level abstractions don=E2=80=99t exist, and unsafe, unexpected interactions with libraries, other programs, the operating system and even the hardware are possible. For unsafe source languages like C, secure compilation requires careful handling of undefined source-language behavior (like buffer overflows and double frees). Formally, secure compilation aims to protect high-level language abstractions in compiled code, even against adversarial low-level contexts, thus enabling sound reasoning about security in the source language. A complementary goal is to keep the compiled code efficient, often leveraging new hardware security features and advances in compiler design. Other necessary components are identifying and formalizing properties that secure compilers must possess, devising efficient security mechanisms (both software and hardware), and developing effective verification and proof techniques. Research in the field thus puts together advances in compiler design, programming languages= , systems security, verification, and computer architecture. ### Contact For any questions please contact the workshop chairs, Jonathan Protzenko (jonathan.protzenko at gmail.com) and Deian Stefan (deian at cs.ucsd.edu). To make sure you receive PriSC announcements in the future please subscribe to the following low-traffic mailing list: https://lists.gforge.inria.fr/mailman/listinfo/prisc-announce --000000000000fd0ce005b592a6c1 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Principles of Secure Compilation (PriSC) 2021: Call for Pa= rticipation
and Short Talks

tl;dr: a new exciting edition of PriS= C is in the works! as usual, we've reserved
a few slots for short ta= lks, where speakers can spend a few minutes telling us
about ongoing wor= k and foster informal discussions; please do send us your short
talks pr= oposals!

Principles of Secure Compilation Workshop (PriSC 2021)
<= br>=C2=A0 - Registration: https://p= opl21.sigplan.org/
=C2=A0 - Accepted talks available here:
=C2=A0= =C2=A0 https://popl21.sigplan.org/home/prisc-2021#event-overview
=C2=A0 = - Invited speaker: Hugo Vincent (ARM)
=C2=A0 - Call for short talks: see= below
=C2=A0 =C2=A0 Deadline: January 11th 2021

The Workshop on = Principles of Secure Compilation (PriSC) is an informal 1-day
workshop w= ithout proceedings. The goal is to bring together researchers
interested= in secure compilation and to identify interesting research directions
a= nd open challenges.

PriSC 2021 will be held on Saturday January 17th= , 2021 online.
It will be co-located with POPL 2021, also online.
For more information about this edition and the PriSC series, please
vi= sit https://popl21.s= igplan.org/home/prisc-2021

### Invited Speakers

=C2=A0 = =C2=A0 Hugo Vincent (ARM)

### Accepted papers

The list of acc= epted talks is available at

=C2=A0 =C2=A0 https://popl21.sigplan.org/tra= ck/prisc-2021#event-overview

### Call for Short Talks

We = also have a short talks session, where participants get 5 minutes to presen= t
intriguing ideas, advertise ongoing work, etc. If you're intereste= d in giving a
short 5-minute talk, please submit an abstract. Any topic = that could be of
interest to the emerging secure compilation community i= s in scope. Presentations
that provide a useful outside view or challeng= e the community are also welcome.

=C2=A0 - Deadline: January 11th, 2= 021
=C2=A0 - More details:
=C2=A0 =C2=A0 https://popl21.sigplan.org/= home/prisc-2021#Call-for-Short-Talks
=C2=A0 - Submit here:
=C2=A0= =C2=A0 https://forms.gle/w= kCyK4fN3i11nbyD7

### Workshop summary

The emerging field = of secure compilation aims to preserve security properties of
programs w= hen they have been compiled to low-level languages such as assembly,
whe= re high-level abstractions don=E2=80=99t exist, and unsafe, unexpected inte= ractions
with libraries, other programs, the operating system and even t= he hardware are
possible. For unsafe source languages like C, secure com= pilation requires
careful handling of undefined source-language behavior= (like buffer overflows
and double frees). Formally, secure compilation = aims to protect high-level
language abstractions in compiled code, even = against adversarial low-level
contexts, thus enabling sound reasoning ab= out security in the source language. A
complementary goal is to keep the= compiled code efficient, often leveraging new
hardware security feature= s and advances in compiler design. Other necessary
components are identi= fying and formalizing properties that secure compilers must
possess, dev= ising efficient security mechanisms (both software and hardware),
and de= veloping effective verification and proof techniques. Research in the
fi= eld thus puts together advances in compiler design, programming languages,<= br>systems security, verification, and computer architecture.

### Co= ntact

For any questions please contact the workshop chairs, Jonathan= Protzenko
(jonathan.pro= tzenko at gmail.com) and Deian Stefan (https://lists.gforge.inria.fr/mailman/listinfo/prisc-announce --000000000000fd0ce005b592a6c1-- From makarius at sketis.net Fri Dec 04 12:49:52 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:60175) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1klAX2-0003Nw-0u (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 04 Dec 2020 12:49:52 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884062 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [188.68.61.103 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.0 NICE_REPLY_A Looks like a legit reply (A) X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from relay.yourmailgateway.de ([188.68.61.103]:40527) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1klAX1-000EwY-cw (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 04 Dec 2020 12:49:52 +0000 Received: from mors-relay-8403.netcup.net (localhost [127.0.0.1]) by mors-relay-8403.netcup.net (Postfix) with ESMTPS id 4CnXbf3hJ5z8VGG for ; Fri, 4 Dec 2020 13:49:50 +0100 (CET) Received: from policy02-mors.netcup.net (unknown [46.38.225.53]) by mors-relay-8403.netcup.net (Postfix) with ESMTPS id 4CnXbf3J2Jz8VDk for ; Fri, 4 Dec 2020 13:49:50 +0100 (CET) X-Virus-Scanned: Debian amavisd-new at policy02-mors.netcup.net X-Spam-Flag: NO X-Spam-Score: -2.9 X-Spam-Level: X-Spam-Status: No, score=-2.9 required=6.31 tests=[ALL_TRUSTED=-1, BAYES_00=-1.9, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no Received: from mx2f26.netcup.net (unknown [10.243.12.53]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by policy02-mors.netcup.net (Postfix) with ESMTPS id 4CnXbd5Y6Kz8sWT for ; Fri, 4 Dec 2020 13:49:49 +0100 (CET) Received: from [192.168.178.32] (aftr-62-216-204-156.dynamic.mnet-online.de [62.216.204.156]) by mx2f26.netcup.net (Postfix) with ESMTPSA id 99E04A0FCF for ; Fri, 4 Dec 2020 13:49:48 +0100 (CET) Authentication-Results: mx2f26; spf=pass (sender IP is 62.216.204.156) smtp.mailfrom=makarius at sketis.net smtp.helo=[192.168.178.32] Received-SPF: pass (mx2f26: connection is authenticated) From: Makarius To: cl-isabelle-users References: <497e194f-0c6a-3cf3-15b4-68a5e1194e8f at sketis.net> Autocrypt: addr=makarius at sketis.net; prefer-encrypt=mutual; keydata= mQINBFcrF+4BEADMcXMnu3XHg6bRsGe3tajAHqvm89+ecn/Y0WhjI2FplhkZs1LwM+ZA9eXh hiBrC/yX0FJ+qjzVIfm66CX4nzVG1f8qwaervMpvpA+gbhtQiXc0t+LDcqV+5cdtpKplPHSu oW+KzJKyCdkDB5fYMOzuaXQwYi12YAEQH2r6K7Q7Np+k82Xli1pWe+Tha/BH0pKJ5Q01aPep ASrNW9F+moX7C0fxWl65LiXGmF0UJep6fqKruhy8oNF4p6I2oZhktvaR/x6tkL2PkT3r+xUS 6g5i3BOjfwhoGY57nsioeK+8VFvdRH5DK4CbrTgDl7ddcrEeENrfpDiPLs/afVbe/T9oDXmJ OJAO4WMpfZNiFhx9SSVTHohw29Fyzn0N1UQGjPqAY1jg32DAxlnMQ0co/KabEFAcoQsW1/6U ZGiNxYVIyEKGrnSY4WuLuNC8CmU1RaYSdTk1y9tYdxufM9lH9ynzJwac6FdalOOxMR2G9JG8 L9/dk3ytlP6DVwkPBSCpJaTkTyMp1wSkF1oK/BDu5xKUQh0zvvLCuZ16hiKRBBSjpVExXRZC u+NC1Y4wqm1HOH7HBwgZ1Hv9S/EPmI9iwgcW0SpDJqPf2Cm7oFMZsZ5Dbs6/nOQoe4Zegy45 ymqDRlIekP7zj+vOoR80XAYfmAH5DElJHldcjmgLBMdpvvqGZwARAQABtB5NYWthcml1cyA8 bWFrYXJpdXNAc2tldGlzLm5ldD6JAj0EEwEIACcFAlcrF+4CGyMFCQlmAYAFCwkIBwIGFQgJ CgsCBBYCAwECHgECF4AACgkQ89KUEoG/TbiVrw/9FjEBgh2CB7Qof7Y4k0yc7j+x/A0Wmkc0 iwP5jaKJuxRv1JJT8CFqm392+/cdh3EkRUk/UWD+hpNndYJwxZltrEpKVqFAWoVOg3ZJ4cuI MYhlp4tk/T0KSl/gKT16dc6uJ7M/FzW0zv50vjFtAdianEDuqLXHKaGDUwWoOTDly0gdZ7aH /eNby6ONHUSJMdTNOErh2N+uESM4aZqUuuL/dTb6xiVzCpV5saT8EMakoazUd7QhoBaHvqfs BL7DEmvcTtA79GF3ufHrF/UndIcx8aMznZ2PGNjmy5seDCoKX0EYHdLam8vgo/TuU4dRw5Zn 6E/ouyNOliXT1Mn+SomeBSXTR5MXRq4TQ9MKVGiP0Yl+7GJQU0JFtDC1ZZEOyjIiwGWOhbUR pYujVm8C1iQ7NcEn2BqOAmRML6IR6+En4RLbgCNsBNXlmTPRJOaI+iV6DZzg3x9zcaDGhoYt jkBTEFpb0F3jU9yuaEU5401NV34fUxg8tqXs0R9CKinO7kQ8N+RDjyyY8k2KZiDYBJ6r+OK0 d7TaTj7F9tmpAu2pmQ8lxOKjDZIwlbGTsC4lxISmcPzBGTKXja5nakcWYx/lZ4vje0WZ12HN amnD1weakFixRYit0d+Kz7cuj684NSbhwC0oN2t9R06Nfq8UPEWRKEitCly0OtRgio8zVZ/L eAC5Ag0EVysX7gEQAKs5NVOvYkE/r8KLsJ8/L/9eulpJDOFilZ9fyuqii7t1UpHZLb58QghW JM+IB2GSGsB+pOi6Je7hmwxcVdXYbGlYZ4Btqqw48/XptfbNZ8alCk6AqoVFP4MbYxij/Qqv f/Yw6GR0p1RIC/W4GF/JgDDwDFEiMT6Pv6dpM8acdNFCERDZdoOJiC+XJRwy5lZ2g5FOJkT9 rVI9EnA7mBXLLjPOMUp2/eZxN6gKOZzI3ej9vixg3adWR2yfKPgacHP/ujnVfITOl0OyLE5f zIHq85dEV4zW6Mpx7+Um0tdkwlUVMaW2nQ1bcwejgVAuD/MLSF/lSs3N5D1ctw5QUemYh7/e 2dC12UJuFDFxNPzcltQTlkBCVWV1D0SjScDHdlF6HhzpZOlt52/rwTn5GHtY4nwAL4IJ+Yvl WX8YKmyILH4Ai8c/N2IVRERQ2qorWFlsQnqrXV+hXf8aUwjc/pq4K9rsWxvle3TpeZfoBefU /s1PEX0SepZFAqAXHlQ9DZPsdPDo9EFK695G5w4nf03EhE9TV1MKGUuc1XJ6f1ZLaxu0TwTA 6qYtKIyBcU0Yn61S2Kh7Dgb5LdLV8nfl71+n/xIt2IWH5UJ9YuwEgGEP0c6ImnAUZ+nRodFI 0RwtCWlRkSJWtQln1vcphrz8PjWZH6e/nWnceXR/Al5P0WexQgtvABEBAAGJAiUEGAEIAA8F AlcrF+4CGwwFCQlmAYAACgkQ89KUEoG/Tbh7VQ/9Fc4bdwJYc3jH/LiuXv6uMg50Cv6lg2NT bL9DClWGNiYzejfM2A4c5K+GRUXhyD7S9U203MOv3z7uTbtyQL8XVolNnQlRIkB00f8nJ2sw HMXx/hemjXBvtlneq+vrMORJexldXUMFq19ZZrvj0zZL+pUnGFqt+IWTEE5GpL7wu20Demaj jYyGyKcDZyJOWZcl4e45Yn3hl0EI2xVmVh7ZinVsb3+nqgcltFy4Jt+drezwV2EiLGJHfGsT jEQb3C9VpneU4Jo+hHtfqLK4Q8+WlIOzSfyvwbabxrhyqg7i11fu8yckNW3dCURPYigV07HK 4dN0zhj53M0Q3eTwegJRPJb8XoLDcSdbsaU2HIShlGDKmzS9KL4JzLikQ9dXROC4cae3jRKH aexFi4B55Ab6FxIfXj09wUCO6Nm0owDfIBDMgiywvi2Rb2etCjBgRbSj71S2nntd9ZitoYvE yKirLkWmJRbp3ln8cHi8Uc/jr1cDPVRWuLUN0uceMj5+AR+NZVakcNUHWJCinMMjacho0SyP QmocdU8pzzupreaVWruqaSzqcpWBPwrE5OxEtJ+OyIBjKmRJ5eptjh4rKgNaVnKjhqbvr+Yz pUAgPp38jjf4HJghUGIfWArKNelKJEJOYk94DAbmT67LgqEdZ0yaA2BCHmreN727WIzV9vkX NMc= Message-ID: Date: Fri, 4 Dec 2020 13:49:48 +0100 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 In-Reply-To: <497e194f-0c6a-3cf3-15b4-68a5e1194e8f at sketis.net> Content-Type: text/plain; charset=utf-8 Content-Language: en-US Content-Transfer-Encoding: 7bit X-PPP-Message-ID: <160708618879.19634.8324933481881227927 at mx2f26.netcup.net> X-PPP-Vhost: sketis.net X-NC-CID: lI6cH1QkJiVtc3SZcCChKB/mxaHBL0YJa8hckNcFEH7Tj8E= Subject: Re: [isabelle] Isabelle2021-RC0 available for early experiments X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 04 Dec 2020 12:49:52 -0000 On 30/11/2020 13:53, Makarius wrote: > > Moreover, for the first time there will be a virtual meeting to discuss > observations and pending problems of the present release snapshot: > > Friday 04-Dec-2020 14:00 UTC+0 > > https://nextcloud.sketis.net/index.php/apps/bbb/b/PnfGWSaZHFNqfqHJ > > Preferred browsers: Firefox, Chromium/Chrome, or recent MS Edge. Reminder: that is in 70 minutes. I have started to make a sketch of notable topics here: https://nextcloud.sketis.net/index.php/s/5dPJasdxnWMR8W9 (that is a theory file to be opened with Isabelle2021-RC0). Makarius From isabelle-users at starkeffect.com Fri Dec 04 22:56:51 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:46658) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1klK0R-0006aS-QH (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 04 Dec 2020 22:56:51 +0000 X-Cam-SpamDetails: score -0.1 from SpamAssassin-3.4.4-1884062 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from cloud2.starkeffect.com ([45.55.83.152]:57590) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtp id 1klK0R-000zOv-dT (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 04 Dec 2020 22:56:51 +0000 Received: from home.starkeffect.com (localhost [127.0.0.1]) by cloud2.starkeffect.com (Postfix) with ESMTPS id B7DA43F2F5; Fri, 4 Dec 2020 22:56:46 +0000 (UTC) To: "cl-isabelle-users at lists.cam.ac.uk" From: "Eugene W. Stark" Message-ID: <32ec16b6-59ba-b9d1-297e-837282883d8a at starkeffect.com> Date: Fri, 4 Dec 2020 17:56:46 -0500 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Language: en-US Content-Transfer-Encoding: 7bit Subject: [isabelle] Isabelle2021-RC0: Java/VM monitor X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list Reply-To: stark at cs.stonybrook.edu List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 04 Dec 2020 22:56:51 -0000 After attending Makarius' presentation earlier today, I tried to use the Java/VM monitor in Isabelle2021-RC0. Two issues arose: Big issue: Could not convince JConsole to connect to the Isabelle/JEdit Java VM. Local connection failed. JConsole documentation suggests that it should be possible for a user to connect to local JVM instances that are running under the same user ID, but this did not seem to work. SSH connections are not an option, because I do not enable password authentication via SSH and there seems to be no provision for public key authentication. Smaller issue: The "Help" link to the "Online User Guide" for JConsole is stale. If I run JConsole from shell level (this presumably does not run the version that is part of the Isabelle distribution), then the same menu selection does not result in a stale link. This under Ubuntu 18.04LTS. JConsole from the command line also was unable to connect. From isabelle-users at starkeffect.com Fri Dec 04 23:04:24 2020 Received: from ppsw-31.csi.cam.ac.uk ([131.111.8.131]:49206) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1klK7k-0006oI-Np (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 04 Dec 2020 23:04:24 +0000 X-Cam-SpamDetails: score -0.1 from SpamAssassin-3.4.4-1884062 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.0 NICE_REPLY_A Looks like a legit reply (A) X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from cloud2.starkeffect.com ([45.55.83.152]:57854) by ppsw-31.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.147]:25) with esmtp id 1klK7k-000Xj6-JZ (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 04 Dec 2020 23:04:24 +0000 Received: from home.starkeffect.com (localhost [127.0.0.1]) by cloud2.starkeffect.com (Postfix) with ESMTPS id 5DE9B3F2F5; Fri, 4 Dec 2020 23:04:23 +0000 (UTC) To: cl-isabelle-users at lists.cam.ac.uk References: <32ec16b6-59ba-b9d1-297e-837282883d8a at starkeffect.com> From: "Eugene W. Stark" Message-ID: Date: Fri, 4 Dec 2020 18:04:23 -0500 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 In-Reply-To: <32ec16b6-59ba-b9d1-297e-837282883d8a at starkeffect.com> Content-Type: text/plain; charset=utf-8 Content-Language: en-US Content-Transfer-Encoding: 7bit Subject: Re: [isabelle] Isabelle2021-RC0: Java/VM monitor X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list Reply-To: stark at cs.stonybrook.edu List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 04 Dec 2020 23:04:24 -0000 Sorry for some misstatements below. I am not sure why I had "ssh" in my head. "Secure connection" (via SSL) does not succeed. "Insecure connection" also does not succeed. I tried to use "Remote process" with "localhost" as the host name, but the port number required was not evident. If I use "netstat -apn" to find ports on which JVM is listening, I see only tcp6, no tcp4. It wasn't clear to me what parameters to enter in the dialog that would be likely to make this work. On 12/4/20 5:56 PM, Eugene W. Stark wrote: > After attending Makarius' presentation earlier today, I tried to use the Java/VM monitor in Isabelle2021-RC0. > Two issues arose: > > Big issue: Could not convince JConsole to connect to the Isabelle/JEdit Java VM. Local connection > failed. JConsole documentation suggests that it should be possible for a user to connect to > local JVM instances that are running under the same user ID, but this did not seem to work. > SSH connections are not an option, because I do not enable password authentication via SSH and > there seems to be no provision for public key authentication. > > Smaller issue: The "Help" link to the "Online User Guide" for JConsole is stale. If I run JConsole > from shell level (this presumably does not run the version that is part of the Isabelle distribution), > then the same menu selection does not result in a stale link. > > This under Ubuntu 18.04LTS. JConsole from the command line also was unable to connect. > From kyrozier at iastate.edu Sun Dec 06 02:30:30 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:34324) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kljok-00088u-JP (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 06 Dec 2020 02:30:30 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884091 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.166.53 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.166.53 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * 0.0 LOTS_OF_MONEY Huge... sums of money * 0.0 MONEY_NOHTML Lots of money in plain text X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta2.cl.cam.ac.uk ([128.232.25.22]:58974) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kljoj-000xaJ-Rc (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 06 Dec 2020 02:30:30 +0000 Received: from ppsw-40.csi.cam.ac.uk ([2001:630:212:8::e:f40]) by mta2.cl.cam.ac.uk with esmtp (Exim 4.86_2) (envelope-from ) id 1kljoj-00043v-EI for isabelle-users at cl.cam.ac.uk; Sun, 06 Dec 2020 02:30:29 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884091 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.166.53 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.166.53 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * 0.0 LOTS_OF_MONEY Huge... sums of money * 0.0 MONEY_NOHTML Lots of money in plain text X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-io1-f53.google.com ([209.85.166.53]:44053) by ppsw-40.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.148]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kljoi-000mOw-kP (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Sun, 06 Dec 2020 02:30:29 +0000 Received: by mail-io1-f53.google.com with SMTP id z5so9864639iob.11 for ; Sat, 05 Dec 2020 18:30:28 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:subject:to:message-id:date:user-agent :mime-version:content-transfer-encoding:content-language; bh=HT9MNy0EDc7OSC3tIwrWBEBHNspJA3r+WxRHryXNsvo=; b=kW4iyzgrJfqItR4gP+Tts9jXnqfAJmEgBwdLpc2Uu8tuibhZv8Ap5GdFI4LtMgHlhT B9YhfIL/qAWHgl/SQPM0zCOZGrmelG99vNwk9Z2q3rI4RjNSu3EudQV4auFb06IgPBOq iS5rprOUkytdAjoRvSnf8QO5SxDQe1qjss66FLf09pKNQP6Xz3h/vxfjwhBnQ618wxBR tGPN2u0ekC97+TlTRzP5/FoiZUpTxLPE4Skajgi4rZq+nm1qTbq22uGW9chL5DSRSe6b 6YqfYaK5ZCa51oThrRTGd/pAfDV59ucbgYwfEGvEA5sh2Hn3y/r4npPxb+fu3p3psjUH 6Kvw== X-Gm-Message-State: AOAM530pQdR6+UQFDoHstLoYHlO8i//niWbkn33KM5YnwHSWDbLgqAFi kcUl7zWLR+4+F6QN99hZ9U7G/g== X-Google-Smtp-Source: ABdhPJw6A9WsZmC09zGK1WaSpQ8hMAWlURXvSpFtLvekYE6pGWWUzZL3xnhzDMmjB2aOcnKgS0n8Gw== X-Received: by 2002:a05:6638:25d4:: with SMTP id u20mr13400753jat.54.1607221827136; Sat, 05 Dec 2020 18:30:27 -0800 (PST) Received: from [10.0.1.30] (173-23-120-186.client.mchsi.com. [173.23.120.186]) by smtp.gmail.com with ESMTPSA id d1sm3779091ioh.3.2020.12.05.18.30.24 (version=TLS1_3 cipher=TLS_AES_128_GCM_SHA256 bits=128/128); Sat, 05 Dec 2020 18:30:26 -0800 (PST) From: Kristin Yvonne Rozier To: Kristin Yvonne Rozier Message-ID: <72babc70-fba4-6670-7602-0a1900a92c40 at iastate.edu> Date: Sat, 5 Dec 2020 20:30:24 -0600 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Content-Language: en-US X-debug-header: local_aliases has suffix X-Mailman-Approved-At: Sun, 06 Dec 2020 11:36:52 +0000 Subject: [isabelle] Postdoc and PhD Positions @ Iowa State University X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 06 Dec 2020 02:30:30 -0000 ****************************************************           Postdoc & PhD positions available:            Laboratory for Temporal Logic,          directed by Kristin Yvonne Rozier http://laboratory.tempoallogic.org        Iowa State University, Ames, Iowa, USA **************************************************** Multiple fully-funded PhD positions and Postdoc positions are available in the Lab for Temporal Logic, which spans the Departments of Computer Science, Electrical and Computer Engineering, Aerospace Engineering, Mathematics, and the Virtual Reality Application Center. Application links are below. About the Lab: --------------- The Laboratory for Temporal Logic focuses on foundational advances to formal methods that carry through to really fly. The lab has developed techniques to enable better system specification and model-checking algorithms that scale to verify large, complex systems including NASA's automated air traffic control system and industrial verification problems at IBM. The lab's R2U2 verification engine is the only flight-certifiable RV tool capable of embedding in tight spaces post-deployment for real-time anomaly detection and mitigation triggering. R2U2 has flown on UAS, checked ATC ground stations, launched on rockets and small satellites, and embedded into NASA's Robonaut2 humanoid robot on-board the International Space Station. See a news article about the lab's recent projects here: http://laboratory.temporallogic.org/research/blog/?p=300 See award abstracts for NSF grants funding the research here: Symbolic Model Checking: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2016592&HistoricalAwards=false Specification and Runtime Verification: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2038903&HistoricalAwards=false Postdoc Summary of Duties and Responsibilities: ----------------------------------------------- Candidate(s) will conduct world-class research in the area of formal methods, including design-time and/or runtime verification. Topics include defining new specification logic variants, formal requirements elicitation, proving algorithmic complexity and correctness, formal modeling, and algorithmic advances contributing to industrial-shaped instances of symbolic model checking, proving properties of runtime verification, and assuring development and operation of autonomous systems. Candidate is expected to contribute his/her own research ideas and collaborate with the laboratory to conduct independent research. Teaching and/or research-in-education opportunities are available if the candidate desires, but not required. Program & College Description: ------------------------------- The postdoc(s) and PhD students will have offices in Howe Hall, a $50 million state-of-the-art teaching and research complex including a Virtual Reality Application Center (vrac.iastate.edu). The College of Engineering consists of 8 departments, with 250+ faculty members and annual research expenditures exceeding $88 million. ISU hosts a booming formal methods community, including many large research groups and prominent researchers working in various areas of formal verification across three departments: computer science, aerospace engineering, and electrical and computer engineering. About Iowa State University and the Ames Community: ---------------------------------------------------- Iowa State University is classified as a Carnegie Foundation Doctoral/Research University-Extensive, a member of the Association of American Universities (AAU), and ranked by U.S. News and World Report as one of the top public universities in the nation. Over 36,000 students are enrolled, and served by over 6,200 faculty and staff (see www.iastate.edu). Ames, Iowa is a progressive community of 60,000, located approximately 30 minutes north of Des Moines, and recently voted the best college town in the nation (see www.visitames.com). Ames, Iowa has a legendary standing as a great place to live, regularly topping lists for e.g., opportunities for work-life balance, green living, and great infrastructure for cycling. Postdoc Application Instructions: -------------------------- To apply for this position, please: * send an email to Dr. Kristin Yvonne Rozier (kyrozier at iastate.edu) and attaching a detailed CV with references * fill in the application: https://isu.wd1.myworkdayjobs.com/IowaStateJobs/job/Ames-IA/Post-Doc-Research-Associate_R3029-1 The start date is flexible, but we aim to fill the positions as soon as possible. Applicants must have a PhD in Computer Science or a related subject at the time they start the position, be fluent in English, have good abilities to work in an international setting. The position is initially offered for one or two years, with opportunities for extensions. Salary and benefits at ISU are competitive and commiserate with experience. There are flexible options for remote work due to the COVID-19 pandemic. If desired, there are several opportunities for growing the teaching section of the postdoc's CV; please specify if you want to explore this option. Possible courses for teaching experiences include a junior-level undergraduate C programming course on robust software engineering practices, numerical algorithms, and good code documentation in LaTeX; or an advanced course in Applied Formal Methods. ISU Center for Excellence in Teaching and Learning offers many opportunities for postdocs to learn state-of-the-art teaching best-practices. The ISU Center for Communication Excellence offers individualized training in written and oral communication skills to improve the quality of papers, proposals, and oral presentations. This is an excellent opportunity to enhance a CV for future academic positions. PhD Application Instructions: ----------------------------------------------------- (1) Apply to the department of choice, where you would like the PhD to be granted: Computer Science (Deadline Feb 1): https://www.grad-college.iastate.edu/academics/programs/apresults.php?id=32 Computer Engineering (Deadline Feb 2): https://www.ece.iastate.edu/admissions/graduate-admissions/ Aerospace Engineering (Deadline Jan 15): https://www.grad-college.iastate.edu/academics/programs/apresults.php?id=2 Mathematics (Deadline Feb 1): https://math.iastate.edu/academics/graduate/math-and-applied-math-graduate-program/gradapply/ (2) Send an email to kyrozier at iastate.edu letting me know which department you applied to. -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier, Ph.D. / | | | | \ Asst Professor, Iowa State University / USA | ~||~ |NASA \ Departments of Aerospace Engineering, |______| ~~ |______| Computer Science, Mathematics, and (__||__) Electrical and Computer Engineering /_\ /_\ Virtual Reality Applications Center !!! !!!http://temporallogic.org/kyr From rob.y.lewis at gmail.com Sun Dec 06 23:55:37 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:57192) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1km3sP-0003PQ-EA (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 06 Dec 2020 23:55:37 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884121 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.208.44 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.208.44 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [rob.y.lewis[at]gmail.com] * 0.0 HTML_MESSAGE BODY: HTML included in message * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-ed1-f44.google.com ([209.85.208.44]:43413) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1km3sO-000EnV-S7 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 06 Dec 2020 23:55:37 +0000 Received: by mail-ed1-f44.google.com with SMTP id q16so11799203edv.10 for ; Sun, 06 Dec 2020 15:55:36 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:from:date:message-id:subject:to; bh=HVCsBTw3v9Yc2A1li6lcQUjZPDFenSb2DFtPzHEVguY=; b=rO5MFf6rmiiixmQcB60oqnf1j7AnpfipBM63ez4+Z262PbqQKpQPDFl9KK38wg4Lzg HDg7CKzYuQhzsAIi0NLELyJXyLbE1FLNtYJkqtsJvPSsIKkUajB4QXkfU2GvHvKfEYx5 63JxuikBOgXOhMoKC+KMr0XNbbEMV9BPuicmb5vDr872pKVTOGzDdstLX9FM/NV/O8f2 Ea6p23UWmFM4wc02iAnYoZzO1zlaEZhfdiM8IuolrJJDvuuMNsifzoYWdzEn9+a0/uaY +4oqMGsHYCvapsja/exa55luAMfOFQPLmiKcrkivX3h8MNM8xaWWt1wsbasFJk6y10Bu sBLA== X-Gm-Message-State: AOAM531Ipo6LBqCVRMXYsiSuBsHSG//+VgghvTD8P10Tz0DJpkd59UVd PWm3zC6WzEVB3VXa44MmQ6ijHbeUkYztU6LO/9YTIHnErZw= X-Google-Smtp-Source: ABdhPJxtLAJyQOfayXta0f7hyzbYDFZAN910zpnll2q7hzLUUnq/TCmeAfsfiKIWa1Sq+DN4xnp3FAHbcVueNOToH5E= X-Received: by 2002:a05:6402:142f:: with SMTP id c15mr17708045edx.33.1607298936159; Sun, 06 Dec 2020 15:55:36 -0800 (PST) MIME-Version: 1.0 From: Rob Lewis Date: Sun, 6 Dec 2020 18:55:25 -0500 Message-ID: To: cl-isabelle-users at lists.cam.ac.uk Content-Type: multipart/alternative; boundary="0000000000002343ea05b5d4727b" X-Mailman-Approved-At: Mon, 07 Dec 2020 10:22:14 +0000 Subject: [isabelle] Lean Together 2021: January 4-7, Call for Participation X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 06 Dec 2020 23:55:37 -0000 --0000000000002343ea05b5d4727b Content-Type: text/plain; charset="UTF-8" Dear all, Lean Together 2021, a meeting for Lean users and other formalizers, will take place virtually January 4-7. https://leanprover-community.github.io/lt2021/ At this meeting we discuss ongoing projects in formalized mathematics and software verification, as well as infrastructure and outreach for Lean and its community. We welcome speakers and participants from other proof assistant communities, as well as people who are inexperienced with proof assistants but want to learn more. More detailed scheduling information will appear on the website soon. We hope that you'll save the dates and attend some or all of the sessions! If you have any questions please contact the organizers: * Robert Y. Lewis (r.y.lewis at vu.nl) * Patrick Massot (patrick.massot at math.cnrs.fr) --0000000000002343ea05b5d4727b Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Dear all,

Lean Together 2021, a meeting= for Lean users and other formalizers, will take place virtually January 4-= 7.

https://leanprover-community.github.io/lt2021= /

At this meeting we discuss ongoing proje= cts in formalized mathematics and software verification, as well as infrast= ructure and outreach for Lean and its community. We welcome speakers and pa= rticipants from other proof assistant communities, as well as people who ar= e inexperienced with proof assistants but want to learn more.

More detailed scheduling information will appear on the web= site soon. We hope that you'll save the dates and attend some or all of= the sessions!

If you have=C2=A0any questions plea= se contact the organizers:
* Robert Y. Lewis (r.y.lewis at vu.nl)
* Patrick = Massot (pa= trick.massot at math.cnrs.fr)
--0000000000002343ea05b5d4727b-- From lp15 at cam.ac.uk Mon Dec 07 12:17:52 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:53024) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kmFSi-00060o-H6 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 07 Dec 2020 12:17:52 +0000 X-Cam-SpamDetails: score -1.1 from SpamAssassin-3.4.4-1884147 * -1.0 ALL_TRUSTED Passed through trusted hosts only via SMTP * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta0.cl.cam.ac.uk ([128.232.25.20]:56027) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kmFSh-000E8b-SV (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 07 Dec 2020 12:17:52 +0000 Received: from ppsw-31.csi.cam.ac.uk ([131.111.8.131]) by mta0.cl.cam.ac.uk with esmtp (Exim 4.93) (envelope-from ) id 1kmFSh-004cpD-IZ for isabelle-users at cl.cam.ac.uk; Mon, 07 Dec 2020 12:17:51 +0000 X-Cam-AntiVirus: no malware found X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from palladium.mac.cl.cam.ac.uk ([128.232.56.51]:51643) by ppsw-31.csi.cam.ac.uk (smtp.hermes.cam.ac.uk [131.111.8.157]:587) with esmtpsa (PLAIN:lp15) (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kmFSh-000kvM-L5 (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Mon, 07 Dec 2020 12:17:51 +0000 From: Lawrence Paulson Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: quoted-printable Mime-Version: 1.0 (Mac OS X Mail 13.4 $3608.120.23.2.4$) Message-Id: <9EAFBBB4-B0E3-4306-A5D0-B46EDFFC81D3 at cam.ac.uk> Date: Mon, 7 Dec 2020 12:17:51 +0000 To: isabelle-users X-Mailer: Apple Mail (2.3608.120.23.2.4) X-debug-header: local_aliases has suffix Subject: [isabelle] new in the AFP: The Verification of Cryptographic Protocols X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 07 Dec 2020 12:17:52 -0000 I am happy to announce a new contribution to the AFP by one of our more = prolific contributors, Pasquale Noce. > The Relational Method with Message Anonymity for the Verification of = Cryptographic Protocols >=20 > This paper introduces a new method for the formal verification of = cryptographic protocols, the relational method, derived from Paulson's = inductive method by means of some enhancements aimed at streamlining = formal definitions and proofs, specially for protocols using public key = cryptography. Moreover, this paper proposes a method to formalize a = further security property, message anonymity, in addition to message = confidentiality and authenticity. The relational method, including = message anonymity, is then applied to the verification of a sample = authentication protocol, comprising Password Authenticated Connection = Establishment (PACE) with Chip Authentication Mapping followed by the = explicit verification of an additional password over the PACE secure = channel. https://www.isa-afp.org/entries/Relational_Method.html Larry Paulson From nipkow at in.tum.de Tue Dec 08 12:15:07 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:44646) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kmbtb-0002sp-4C (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 12:15:07 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884177 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.159.0.8 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.159.0.8 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta2.cl.cam.ac.uk ([128.232.25.22]:43346) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kmbta-000Rr2-RO (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 12:15:07 +0000 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]) by mta2.cl.cam.ac.uk with esmtp (Exim 4.86_2) (envelope-from ) id 1kmbta-0004n6-Dw for isabelle-users at cl.cam.ac.uk; Tue, 08 Dec 2020 12:15:06 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884177 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.159.0.8 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.159.0.8 listed in wl.mailspike.net] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-out1.in.tum.de ([131.159.0.8]:33475 helo=mail-out1.informatik.tu-muenchen.de) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kmbtZ-000RqO-RO (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Tue, 08 Dec 2020 12:15:06 +0000 Received: by mail.in.tum.de (Postfix, from userid 107) id B79841C12CB; Tue, 8 Dec 2020 13:15:04 +0100 (CET) Received: (Authenticated sender: nipkow) by mail.in.tum.de (Postfix) with ESMTPSA id 54D8F1C124B for ; Tue, 8 Dec 2020 13:15:02 +0100 (CET) (Extended-Queue-bit tech_ilyac at fff.in.tum.de) From: Tobias Nipkow To: Isabelle Users Message-ID: <6b4591e9-bb35-56b6-0495-86aa0a1b61b0 at in.tum.de> Date: Tue, 8 Dec 2020 13:15:01 +0100 User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.14; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 Content-Type: multipart/signed; protocol="application/pkcs7-signature"; micalg=sha-256; boundary="------------ms080306040104080804090500" X-debug-header: local_aliases has suffix Subject: [isabelle] New AFP entry: Full name: Relational Minimum Spanning Tree Algorithms X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 08 Dec 2020 12:15:07 -0000 This is a cryptographically signed message in MIME format. --------------ms080306040104080804090500 Content-Type: text/plain; charset=utf-8; format=flowed Content-Language: en-US Content-Transfer-Encoding: quoted-printable Relational Minimum Spanning Tree Algorithms Walter Guttmann, Nicolas Robinson-O'Brien We verify the correctness of Prim's, Kruskal's and Bor=C5=AFvka's minimum= spanning=20 tree algorithms based on algebras for aggregation and minimisation. https://www.isa-afp.org/entries/Relational_Minimum_Spanning_Trees.html Enjoy! --------------ms080306040104080804090500 Content-Type: application/pkcs7-signature; name="smime.p7s" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="smime.p7s" Content-Description: S/MIME Cryptographic Signature MIAGCSqGSIb3DQEHAqCAMIACAQExDzANBglghkgBZQMEAgEFADCABgkqhkiG9w0BBwEAAKCC EX4wggUSMIID+qADAgECAgkA4wvV+K8l2YEwDQYJKoZIhvcNAQELBQAwgYIxCzAJBgNVBAYT AkRFMSswKQYDVQQKDCJULVN5c3RlbXMgRW50ZXJwcmlzZSBTZXJ2aWNlcyBHbWJIMR8wHQYD VQQLDBZULVN5c3RlbXMgVHJ1c3QgQ2VudGVyMSUwIwYDVQQDDBxULVRlbGVTZWMgR2xvYmFs Um9vdCBDbGFzcyAyMB4XDTE2MDIyMjEzMzgyMloXDTMxMDIyMjIzNTk1OVowgZUxCzAJBgNV BAYTAkRFMUUwQwYDVQQKEzxWZXJlaW4genVyIEZvZXJkZXJ1bmcgZWluZXMgRGV1dHNjaGVu IEZvcnNjaHVuZ3NuZXR6ZXMgZS4gVi4xEDAOBgNVBAsTB0RGTi1QS0kxLTArBgNVBAMTJERG Ti1WZXJlaW4gQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgMjCCASIwDQYJKoZIhvcNAQEBBQAD ggEPADCCAQoCggEBAMtg1/9moUHN0vqHl4pzq5lN6mc5WqFggEcVToyVsuXPztNXS43O+FZs FVV2B+pG/cgDRWM+cNSrVICxI5y+NyipCf8FXRgPxJiZN7Mg9mZ4F4fCnQ7MSjLnFp2uDo0p eQcAIFTcFV9Kltd4tjTTwXS1nem/wHdN6r1ZB+BaL2w8pQDcNb1lDY9/Mm3yWmpLYgHurDg0 WUU2SQXaeMpqbVvAgWsRzNI8qIv4cRrKO+KA3Ra0Z3qLNupOkSk9s1FcragMvp0049ENF4N1 xDkesJQLEvHVaY4l9Lg9K7/AjsMeO6W/VRCrKq4Xl14zzsjz9AkH4wKGMUZrAcUQDBHHWekC AwEAAaOCAXQwggFwMA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUk+PYMiba1fFKpZFK4OpL 4qIMz+EwHwYDVR0jBBgwFoAUv1kgNgB5oKAia4zV8mHSuCzLgkowEgYDVR0TAQH/BAgwBgEB /wIBAjAzBgNVHSAELDAqMA8GDSsGAQQBga0hgiwBAQQwDQYLKwYBBAGBrSGCLB4wCAYGZ4EM AQICMEwGA1UdHwRFMEMwQaA/oD2GO2h0dHA6Ly9wa2kwMzM2LnRlbGVzZWMuZGUvcmwvVGVs ZVNlY19HbG9iYWxSb290X0NsYXNzXzIuY3JsMIGGBggrBgEFBQcBAQR6MHgwLAYIKwYBBQUH MAGGIGh0dHA6Ly9vY3NwMDMzNi50ZWxlc2VjLmRlL29jc3ByMEgGCCsGAQUFBzAChjxodHRw Oi8vcGtpMDMzNi50ZWxlc2VjLmRlL2NydC9UZWxlU2VjX0dsb2JhbFJvb3RfQ2xhc3NfMi5j ZXIwDQYJKoZIhvcNAQELBQADggEBAIcL/z4Cm2XIVi3WO5qYi3FP2ropqiH5Ri71sqQPrhE4 eTizDnS6dl2e6BiClmLbTDPo3flq3zK9LExHYFV/53RrtCyD2HlrtrdNUAtmB7Xts5et6u5/ MOaZ/SLick0+hFvu+c+Z6n/XUjkurJgARH5pO7917tALOxrN5fcPImxHhPalR6D90Bo0fa3S PXez7vTXTf/D6OWST1k+kEcQSrCFWMBvf/iu7QhCnh7U3xQuTY+8npTD5+32GPg8SecmqKc2 2CzeIs2LgtjZeOJVEqM7h0S2EQvVDFKvaYwPBt/QolOLV5h7z/0HJPT8vcP9SpIClxvyt7bP ZYoaorVyGTkwggWsMIIElKADAgECAgcbY7rQHiw9MA0GCSqGSIb3DQEBCwUAMIGVMQswCQYD VQQGEwJERTFFMEMGA1UEChM8VmVyZWluIHp1ciBGb2VyZGVydW5nIGVpbmVzIERldXRzY2hl biBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQLEwdERk4tUEtJMS0wKwYDVQQDEyRE Rk4tVmVyZWluIENlcnRpZmljYXRpb24gQXV0aG9yaXR5IDIwHhcNMTYwNTI0MTEzODQwWhcN MzEwMjIyMjM1OTU5WjCBjTELMAkGA1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9l cmRlcnVuZyBlaW5lcyBEZXV0c2NoZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UE CwwHREZOLVBLSTElMCMGA1UEAwwcREZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQTCCASIw DQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAJ07eRxH3h+Gy8Zp1xCeOdfZojDbchwFfylf S2jxrRnWTOFrG7ELf6Gr4HuLi9gtzm6IOhDuV+UefwRRNuu6cG1joL6WLkDh0YNMZj0cZGnl m6Stcq5oOVGHecwX064vXWNxSzl660Knl5BpBb+Q/6RAcL0D57+eGIgfn5mITQ5HjUhfZZkQ 0tkqSe3BuS0dnxLLFdM/fx5ULzquk1enfnjK1UriGuXtQX1TX8izKvWKMKztFwUkP7agCwf9 TRqaA1KgNpzeJIdl5Of6x5ZzJBTN0OgbaJ4YWa52fvfRCng8h0uwN89Tyjo4EPPLR22MZD08 WkVKusqAfLjz56dMTM0CAwEAAaOCAgUwggIBMBIGA1UdEwEB/wQIMAYBAf8CAQEwDgYDVR0P AQH/BAQDAgEGMCkGA1UdIAQiMCAwDQYLKwYBBAGBrSGCLB4wDwYNKwYBBAGBrSGCLAEBBDAd BgNVHQ4EFgQUazqYi/nyU4na4K2yMh4JH+iqO3QwHwYDVR0jBBgwFoAUk+PYMiba1fFKpZFK 4OpL4qIMz+EwgY8GA1UdHwSBhzCBhDBAoD6gPIY6aHR0cDovL2NkcDEucGNhLmRmbi5kZS9n bG9iYWwtcm9vdC1nMi1jYS9wdWIvY3JsL2NhY3JsLmNybDBAoD6gPIY6aHR0cDovL2NkcDIu cGNhLmRmbi5kZS9nbG9iYWwtcm9vdC1nMi1jYS9wdWIvY3JsL2NhY3JsLmNybDCB3QYIKwYB BQUHAQEEgdAwgc0wMwYIKwYBBQUHMAGGJ2h0dHA6Ly9vY3NwLnBjYS5kZm4uZGUvT0NTUC1T ZXJ2ZXIvT0NTUDBKBggrBgEFBQcwAoY+aHR0cDovL2NkcDEucGNhLmRmbi5kZS9nbG9iYWwt cm9vdC1nMi1jYS9wdWIvY2FjZXJ0L2NhY2VydC5jcnQwSgYIKwYBBQUHMAKGPmh0dHA6Ly9j ZHAyLnBjYS5kZm4uZGUvZ2xvYmFsLXJvb3QtZzItY2EvcHViL2NhY2VydC9jYWNlcnQuY3J0 MA0GCSqGSIb3DQEBCwUAA4IBAQCBeEWkTqR/DlXwCbFqPnjMaDWpHPOVnj/z+N9rOHeJLI21 rT7H8pTNoAauusyosa0zCLYkhmI2THhuUPDVbmCNT1IxQ5dGdfBi5G5mUcFCMWdQ5UnnOR7L n8qGSN4IFP8VSytmm6A4nwDO/afr0X9XLchMX9wQEZc+lgQCXISoKTlslPwQkgZ7nu7YRrQb tQMMONncsKk/cQYLsgMHM8KNSGMlJTx6e1du94oFOO+4oK4v9NsH1VuEGMGpuEvObJAaguS5 Pfp38dIfMwK/U+d2+dwmJUFvL6Yb+qQTkPp8ftkLYF3sv8pBoGH7EUkp2KgtdRXYShjqFu9V NCIaE40GMIIGtDCCBZygAwIBAgIMI5/lGur5RMzYJ/WbMA0GCSqGSIb3DQEBCwUAMIGNMQsw CQYDVQQGEwJERTFFMEMGA1UECgw8VmVyZWluIHp1ciBGb2VyZGVydW5nIGVpbmVzIERldXRz Y2hlbiBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQLDAdERk4tUEtJMSUwIwYDVQQD DBxERk4tVmVyZWluIEdsb2JhbCBJc3N1aW5nIENBMB4XDTIwMTAwOTEzMzcxOFoXDTIxMTIw MzE1MzYxN1owgcAxCzAJBgNVBAYTAkRFMQ8wDQYDVQQIDAZCYXllcm4xETAPBgNVBAcMCE11 ZW5jaGVuMSkwJwYDVQQKDCBUZWNobmlzY2hlIFVuaXZlcnNpdGFldCBNdWVuY2hlbjEiMCAG A1UECwwZRmFrdWx0YWV0IGZ1ZXIgSW5mb3JtYXRpazEWMBQGA1UEAwwNVG9iaWFzIE5pcGtv dzEmMCQGCSqGSIb3DQEJARYXdG9iaWFzLm5pcGtvd0Bpbi50dW0uZGUwggEiMA0GCSqGSIb3 DQEBAQUAA4IBDwAwggEKAoIBAQDUbnZWpbMWc0L36pKuee6yTHzlyzNHFmR8kbLounLgje8w 6j9bH8D7kbzEnlrh31Sa1alxP58+/NQ2d7lUuzPz/RDRXVl4d+NJ7tVMi1GrW9tS35yyV1/c 4dgAIlMoe2USxwg+b3UXmmdosbs9W6RJ/639htMAFWbUUTnj77qNMDbr9zEmdskIkOvJPmJG E3bAYMr4xh5ApkcuL0adZmyjLdFHIeIDgvgYp2dzh1L7h0qMs8npjdVYZhbaM6JL0XLc83Fj 9hw0QDt82YAHrKB0syh626JPqizlONVUiHnGoiVS/R0Xn2a+XIl4+pn2ufUbqAOfv3YTPOYD yh4FV6TVAgMBAAGjggLdMIIC2TA+BgNVHSAENzA1MA8GDSsGAQQBga0hgiwBAQQwEAYOKwYB BAGBrSGCLAEBBAgwEAYOKwYBBAGBrSGCLAIBBAgwCQYDVR0TBAIwADAOBgNVHQ8BAf8EBAMC BeAwHQYDVR0lBBYwFAYIKwYBBQUHAwIGCCsGAQUFBwMEMB0GA1UdDgQWBBRbgDDEK6sjPfEN p3HCLZWLbSJuyTAfBgNVHSMEGDAWgBRrOpiL+fJTidrgrbIyHgkf6Ko7dDCBrgYDVR0RBIGm MIGjgRBuaXBrb3dAaW4udHVtLmRlgRd0b2JpYXMubmlwa293QGluLnR1bS5kZYEgbmlwa293 QGluZm9ybWF0aWsudHUtbXVlbmNoZW4uZGWBJ3RvYmlhcy5uaXBrb3dAaW5mb3JtYXRpay50 dS1tdWVuY2hlbi5kZYERbmlwa293QGNzLnR1bS5lZHWBGHRvYmlhcy5uaXBrb3dAY3MudHVt LmVkdTCBjQYDVR0fBIGFMIGCMD+gPaA7hjlodHRwOi8vY2RwMS5wY2EuZGZuLmRlL2Rmbi1j YS1nbG9iYWwtZzIvcHViL2NybC9jYWNybC5jcmwwP6A9oDuGOWh0dHA6Ly9jZHAyLnBjYS5k Zm4uZGUvZGZuLWNhLWdsb2JhbC1nMi9wdWIvY3JsL2NhY3JsLmNybDCB2wYIKwYBBQUHAQEE gc4wgcswMwYIKwYBBQUHMAGGJ2h0dHA6Ly9vY3NwLnBjYS5kZm4uZGUvT0NTUC1TZXJ2ZXIv T0NTUDBJBggrBgEFBQcwAoY9aHR0cDovL2NkcDEucGNhLmRmbi5kZS9kZm4tY2EtZ2xvYmFs LWcyL3B1Yi9jYWNlcnQvY2FjZXJ0LmNydDBJBggrBgEFBQcwAoY9aHR0cDovL2NkcDIucGNh LmRmbi5kZS9kZm4tY2EtZ2xvYmFsLWcyL3B1Yi9jYWNlcnQvY2FjZXJ0LmNydDANBgkqhkiG 9w0BAQsFAAOCAQEAOCUU6IMxIBv685lR6sshbAl9YdfybY4Z8+MJxQ+/Uj0I+PE4i4JqqOiX vZbS+BqQXYs52i1eLvHsilp3vGU+iLoEAgAgaDKs+YKrYBTUQWHUJyMlgA9yKBgUge0uDNYZ kt8lleS0lT7aIg6bUfInHIaAN6fd7taz11CyC3WvPx2N9r6ZE6kzxN6whx/CvAzEZ9R5MVD8 Trk29zBUATA4KPiCxj48OTyR3e19fbXQ54dtF+aR0aPIUdknIFxMFcsZGRVEbhFSmDSasDuw LfRfDamQEPv0ZeCds8XzDcPovGuH8SLwtRQq5Dq5nCIeAP+ywJZwo+o5nX+lRBivQ7YRtjGC BAswggQHAgEBMIGeMIGNMQswCQYDVQQGEwJERTFFMEMGA1UECgw8VmVyZWluIHp1ciBGb2Vy ZGVydW5nIGVpbmVzIERldXRzY2hlbiBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQL DAdERk4tUEtJMSUwIwYDVQQDDBxERk4tVmVyZWluIEdsb2JhbCBJc3N1aW5nIENBAgwjn+Ua 6vlEzNgn9ZswDQYJYIZIAWUDBAIBBQCgggI9MBgGCSqGSIb3DQEJAzELBgkqhkiG9w0BBwEw HAYJKoZIhvcNAQkFMQ8XDTIwMTIwODEyMTUwMVowLwYJKoZIhvcNAQkEMSIEID5iJXRlP6G3 NH/ASXa9M3SOxBTzNtcS9mvAfahCcqOmMGwGCSqGSIb3DQEJDzFfMF0wCwYJYIZIAWUDBAEq MAsGCWCGSAFlAwQBAjAKBggqhkiG9w0DBzAOBggqhkiG9w0DAgICAIAwDQYIKoZIhvcNAwIC AUAwBwYFKw4DAgcwDQYIKoZIhvcNAwICASgwga8GCSsGAQQBgjcQBDGBoTCBnjCBjTELMAkG A1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9lcmRlcnVuZyBlaW5lcyBEZXV0c2No ZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UECwwHREZOLVBLSTElMCMGA1UEAwwc REZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQQIMI5/lGur5RMzYJ/WbMIGxBgsqhkiG9w0B CRACCzGBoaCBnjCBjTELMAkGA1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9lcmRl cnVuZyBlaW5lcyBEZXV0c2NoZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UECwwH REZOLVBLSTElMCMGA1UEAwwcREZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQQIMI5/lGur5 RMzYJ/WbMA0GCSqGSIb3DQEBAQUABIIBAFNM//nWlbpBgswKk7MPUewfUmToYAyMHwa+K76i x9S0OaWGikkKEeMswFNveF91gZ7bS2XWycQ6IBLd8wwBdPrXM011hlidTlX2QDNaDdB50y1s MGE2sYCcb3c3MoL8l49c7jjb65nM4hpvA40n+L5NFUHs7i78YEgu0KZrBMf2xeOHFv4xQwd3 yQKqgVLun1P7oJt8AYOYyzy3LpZzhqQo05zbchrK63iqpghlWA98Yd2BjsBaITWLFMa3f4LD IxiexZE1PqUJX+6gH9Z8J2AeOUKA/b3opo3kWj9zquML4Fmik7vWYDjqBnRhmd0BdUraMljU Bifl6m9z/prBgPYAAAAAAAA= --------------ms080306040104080804090500-- From holub at karlin.mff.cuni.cz Tue Dec 08 13:31:05 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:48788) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kmd57-0007Ge-SX (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 13:31:05 +0000 X-Cam-SpamDetails: score -2.5 from SpamAssassin-3.4.4-1884177 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [195.113.30.11 listed in list.dnswl.dnsbl.ja.net] * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from postak.karlin.mff.cuni.cz ([195.113.30.11]:39026) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtp id 1kmd56-000SD5-fC (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 13:31:05 +0000 Received: from [10.31.1.195] (unknown [10.31.1.195]) by postak.karlin.mff.cuni.cz (Postfix) with ESMTPSA id 55EBF1FF9C for ; Tue, 8 Dec 2020 14:31:03 +0100 (CET) To: cl-isabelle-users at lists.cam.ac.uk From: Stepan Holub Message-ID: Date: Tue, 8 Dec 2020 14:31:03 +0100 User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit Content-Language: en-US Subject: [isabelle] take_all is equivalence X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 08 Dec 2020 13:31:05 -0000 Hello, is it useful to point out that take_all from List.thy is actually an equivalence? Best regards Stepan From nipkow at in.tum.de Tue Dec 08 21:06:36 2020 Received: from ppsw-31.csi.cam.ac.uk ([131.111.8.131]:53252) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kmkBw-0004ES-Al (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 21:06:36 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884177 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.159.0.8 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.159.0.8 listed in wl.mailspike.net] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders * -0.0 NICE_REPLY_A Looks like a legit reply (A) X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-out1.in.tum.de ([131.159.0.8]:41975 helo=mail-out1.informatik.tu-muenchen.de) by ppsw-31.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.147]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kmkBv-000VWm-Kp (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 21:06:36 +0000 Received: by mail.in.tum.de (Postfix, from userid 107) id 1C0D91C1258; Tue, 8 Dec 2020 22:06:32 +0100 (CET) Received: (Authenticated sender: nipkow) by mail.in.tum.de (Postfix) with ESMTPSA id C55291C1219 for ; Tue, 8 Dec 2020 22:06:29 +0100 (CET) (Extended-Queue-bit tech_hhqza at fff.in.tum.de) To: cl-isabelle-users at lists.cam.ac.uk References: From: Tobias Nipkow Message-ID: Date: Tue, 8 Dec 2020 22:06:28 +0100 User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.14; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 In-Reply-To: Content-Type: multipart/signed; protocol="application/pkcs7-signature"; micalg=sha-256; boundary="------------ms030608010604000809030400" Subject: Re: [isabelle] take_all is equivalence X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 08 Dec 2020 21:06:36 -0000 This is a cryptographically signed message in MIME format. --------------ms030608010604000809030400 Content-Type: text/plain; charset=utf-8; format=flowed Content-Language: en-US Content-Transfer-Encoding: quoted-printable Dear Stepan, Thanks for pointing this out. The existing lemma take_all [simp]: "length xs <=3D n =3D=3D> take n xs =3D xs" already yields two conditional rewrite rules but is indeed a bit weaker t= han an=20 equivalence. I have added lemma take_all_iff [simp]: "(take n xs =3D xs) =3D (length xs <=3D n)" lemma drop_all_iff [simp]: "(drop n xs =3D []) =3D (length xs <=3D n)" locally to see what the effect is. It broke exactly one proof in the AFP = and=20 none in the distribution. Although this is not impressive, I will probabl= y add=20 it to the distribution. Keep them coming! Tobias On 08/12/2020 14:31, Stepan Holub wrote: > Hello, >=20 > is it useful to point out that take_all from List.thy is actually an eq= uivalence? >=20 > Best regards >=20 > Stepan >=20 --------------ms030608010604000809030400 Content-Type: application/pkcs7-signature; name="smime.p7s" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="smime.p7s" Content-Description: S/MIME Cryptographic Signature MIAGCSqGSIb3DQEHAqCAMIACAQExDzANBglghkgBZQMEAgEFADCABgkqhkiG9w0BBwEAAKCC EX4wggUSMIID+qADAgECAgkA4wvV+K8l2YEwDQYJKoZIhvcNAQELBQAwgYIxCzAJBgNVBAYT AkRFMSswKQYDVQQKDCJULVN5c3RlbXMgRW50ZXJwcmlzZSBTZXJ2aWNlcyBHbWJIMR8wHQYD VQQLDBZULVN5c3RlbXMgVHJ1c3QgQ2VudGVyMSUwIwYDVQQDDBxULVRlbGVTZWMgR2xvYmFs Um9vdCBDbGFzcyAyMB4XDTE2MDIyMjEzMzgyMloXDTMxMDIyMjIzNTk1OVowgZUxCzAJBgNV BAYTAkRFMUUwQwYDVQQKEzxWZXJlaW4genVyIEZvZXJkZXJ1bmcgZWluZXMgRGV1dHNjaGVu IEZvcnNjaHVuZ3NuZXR6ZXMgZS4gVi4xEDAOBgNVBAsTB0RGTi1QS0kxLTArBgNVBAMTJERG Ti1WZXJlaW4gQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgMjCCASIwDQYJKoZIhvcNAQEBBQAD ggEPADCCAQoCggEBAMtg1/9moUHN0vqHl4pzq5lN6mc5WqFggEcVToyVsuXPztNXS43O+FZs FVV2B+pG/cgDRWM+cNSrVICxI5y+NyipCf8FXRgPxJiZN7Mg9mZ4F4fCnQ7MSjLnFp2uDo0p eQcAIFTcFV9Kltd4tjTTwXS1nem/wHdN6r1ZB+BaL2w8pQDcNb1lDY9/Mm3yWmpLYgHurDg0 WUU2SQXaeMpqbVvAgWsRzNI8qIv4cRrKO+KA3Ra0Z3qLNupOkSk9s1FcragMvp0049ENF4N1 xDkesJQLEvHVaY4l9Lg9K7/AjsMeO6W/VRCrKq4Xl14zzsjz9AkH4wKGMUZrAcUQDBHHWekC AwEAAaOCAXQwggFwMA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUk+PYMiba1fFKpZFK4OpL 4qIMz+EwHwYDVR0jBBgwFoAUv1kgNgB5oKAia4zV8mHSuCzLgkowEgYDVR0TAQH/BAgwBgEB /wIBAjAzBgNVHSAELDAqMA8GDSsGAQQBga0hgiwBAQQwDQYLKwYBBAGBrSGCLB4wCAYGZ4EM AQICMEwGA1UdHwRFMEMwQaA/oD2GO2h0dHA6Ly9wa2kwMzM2LnRlbGVzZWMuZGUvcmwvVGVs ZVNlY19HbG9iYWxSb290X0NsYXNzXzIuY3JsMIGGBggrBgEFBQcBAQR6MHgwLAYIKwYBBQUH MAGGIGh0dHA6Ly9vY3NwMDMzNi50ZWxlc2VjLmRlL29jc3ByMEgGCCsGAQUFBzAChjxodHRw Oi8vcGtpMDMzNi50ZWxlc2VjLmRlL2NydC9UZWxlU2VjX0dsb2JhbFJvb3RfQ2xhc3NfMi5j ZXIwDQYJKoZIhvcNAQELBQADggEBAIcL/z4Cm2XIVi3WO5qYi3FP2ropqiH5Ri71sqQPrhE4 eTizDnS6dl2e6BiClmLbTDPo3flq3zK9LExHYFV/53RrtCyD2HlrtrdNUAtmB7Xts5et6u5/ MOaZ/SLick0+hFvu+c+Z6n/XUjkurJgARH5pO7917tALOxrN5fcPImxHhPalR6D90Bo0fa3S PXez7vTXTf/D6OWST1k+kEcQSrCFWMBvf/iu7QhCnh7U3xQuTY+8npTD5+32GPg8SecmqKc2 2CzeIs2LgtjZeOJVEqM7h0S2EQvVDFKvaYwPBt/QolOLV5h7z/0HJPT8vcP9SpIClxvyt7bP ZYoaorVyGTkwggWsMIIElKADAgECAgcbY7rQHiw9MA0GCSqGSIb3DQEBCwUAMIGVMQswCQYD VQQGEwJERTFFMEMGA1UEChM8VmVyZWluIHp1ciBGb2VyZGVydW5nIGVpbmVzIERldXRzY2hl biBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQLEwdERk4tUEtJMS0wKwYDVQQDEyRE Rk4tVmVyZWluIENlcnRpZmljYXRpb24gQXV0aG9yaXR5IDIwHhcNMTYwNTI0MTEzODQwWhcN MzEwMjIyMjM1OTU5WjCBjTELMAkGA1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9l cmRlcnVuZyBlaW5lcyBEZXV0c2NoZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UE CwwHREZOLVBLSTElMCMGA1UEAwwcREZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQTCCASIw DQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAJ07eRxH3h+Gy8Zp1xCeOdfZojDbchwFfylf S2jxrRnWTOFrG7ELf6Gr4HuLi9gtzm6IOhDuV+UefwRRNuu6cG1joL6WLkDh0YNMZj0cZGnl m6Stcq5oOVGHecwX064vXWNxSzl660Knl5BpBb+Q/6RAcL0D57+eGIgfn5mITQ5HjUhfZZkQ 0tkqSe3BuS0dnxLLFdM/fx5ULzquk1enfnjK1UriGuXtQX1TX8izKvWKMKztFwUkP7agCwf9 TRqaA1KgNpzeJIdl5Of6x5ZzJBTN0OgbaJ4YWa52fvfRCng8h0uwN89Tyjo4EPPLR22MZD08 WkVKusqAfLjz56dMTM0CAwEAAaOCAgUwggIBMBIGA1UdEwEB/wQIMAYBAf8CAQEwDgYDVR0P AQH/BAQDAgEGMCkGA1UdIAQiMCAwDQYLKwYBBAGBrSGCLB4wDwYNKwYBBAGBrSGCLAEBBDAd BgNVHQ4EFgQUazqYi/nyU4na4K2yMh4JH+iqO3QwHwYDVR0jBBgwFoAUk+PYMiba1fFKpZFK 4OpL4qIMz+EwgY8GA1UdHwSBhzCBhDBAoD6gPIY6aHR0cDovL2NkcDEucGNhLmRmbi5kZS9n bG9iYWwtcm9vdC1nMi1jYS9wdWIvY3JsL2NhY3JsLmNybDBAoD6gPIY6aHR0cDovL2NkcDIu cGNhLmRmbi5kZS9nbG9iYWwtcm9vdC1nMi1jYS9wdWIvY3JsL2NhY3JsLmNybDCB3QYIKwYB BQUHAQEEgdAwgc0wMwYIKwYBBQUHMAGGJ2h0dHA6Ly9vY3NwLnBjYS5kZm4uZGUvT0NTUC1T ZXJ2ZXIvT0NTUDBKBggrBgEFBQcwAoY+aHR0cDovL2NkcDEucGNhLmRmbi5kZS9nbG9iYWwt cm9vdC1nMi1jYS9wdWIvY2FjZXJ0L2NhY2VydC5jcnQwSgYIKwYBBQUHMAKGPmh0dHA6Ly9j ZHAyLnBjYS5kZm4uZGUvZ2xvYmFsLXJvb3QtZzItY2EvcHViL2NhY2VydC9jYWNlcnQuY3J0 MA0GCSqGSIb3DQEBCwUAA4IBAQCBeEWkTqR/DlXwCbFqPnjMaDWpHPOVnj/z+N9rOHeJLI21 rT7H8pTNoAauusyosa0zCLYkhmI2THhuUPDVbmCNT1IxQ5dGdfBi5G5mUcFCMWdQ5UnnOR7L n8qGSN4IFP8VSytmm6A4nwDO/afr0X9XLchMX9wQEZc+lgQCXISoKTlslPwQkgZ7nu7YRrQb tQMMONncsKk/cQYLsgMHM8KNSGMlJTx6e1du94oFOO+4oK4v9NsH1VuEGMGpuEvObJAaguS5 Pfp38dIfMwK/U+d2+dwmJUFvL6Yb+qQTkPp8ftkLYF3sv8pBoGH7EUkp2KgtdRXYShjqFu9V NCIaE40GMIIGtDCCBZygAwIBAgIMI5/lGur5RMzYJ/WbMA0GCSqGSIb3DQEBCwUAMIGNMQsw CQYDVQQGEwJERTFFMEMGA1UECgw8VmVyZWluIHp1ciBGb2VyZGVydW5nIGVpbmVzIERldXRz Y2hlbiBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQLDAdERk4tUEtJMSUwIwYDVQQD DBxERk4tVmVyZWluIEdsb2JhbCBJc3N1aW5nIENBMB4XDTIwMTAwOTEzMzcxOFoXDTIxMTIw MzE1MzYxN1owgcAxCzAJBgNVBAYTAkRFMQ8wDQYDVQQIDAZCYXllcm4xETAPBgNVBAcMCE11 ZW5jaGVuMSkwJwYDVQQKDCBUZWNobmlzY2hlIFVuaXZlcnNpdGFldCBNdWVuY2hlbjEiMCAG A1UECwwZRmFrdWx0YWV0IGZ1ZXIgSW5mb3JtYXRpazEWMBQGA1UEAwwNVG9iaWFzIE5pcGtv dzEmMCQGCSqGSIb3DQEJARYXdG9iaWFzLm5pcGtvd0Bpbi50dW0uZGUwggEiMA0GCSqGSIb3 DQEBAQUAA4IBDwAwggEKAoIBAQDUbnZWpbMWc0L36pKuee6yTHzlyzNHFmR8kbLounLgje8w 6j9bH8D7kbzEnlrh31Sa1alxP58+/NQ2d7lUuzPz/RDRXVl4d+NJ7tVMi1GrW9tS35yyV1/c 4dgAIlMoe2USxwg+b3UXmmdosbs9W6RJ/639htMAFWbUUTnj77qNMDbr9zEmdskIkOvJPmJG E3bAYMr4xh5ApkcuL0adZmyjLdFHIeIDgvgYp2dzh1L7h0qMs8npjdVYZhbaM6JL0XLc83Fj 9hw0QDt82YAHrKB0syh626JPqizlONVUiHnGoiVS/R0Xn2a+XIl4+pn2ufUbqAOfv3YTPOYD yh4FV6TVAgMBAAGjggLdMIIC2TA+BgNVHSAENzA1MA8GDSsGAQQBga0hgiwBAQQwEAYOKwYB BAGBrSGCLAEBBAgwEAYOKwYBBAGBrSGCLAIBBAgwCQYDVR0TBAIwADAOBgNVHQ8BAf8EBAMC BeAwHQYDVR0lBBYwFAYIKwYBBQUHAwIGCCsGAQUFBwMEMB0GA1UdDgQWBBRbgDDEK6sjPfEN p3HCLZWLbSJuyTAfBgNVHSMEGDAWgBRrOpiL+fJTidrgrbIyHgkf6Ko7dDCBrgYDVR0RBIGm MIGjgRBuaXBrb3dAaW4udHVtLmRlgRd0b2JpYXMubmlwa293QGluLnR1bS5kZYEgbmlwa293 QGluZm9ybWF0aWsudHUtbXVlbmNoZW4uZGWBJ3RvYmlhcy5uaXBrb3dAaW5mb3JtYXRpay50 dS1tdWVuY2hlbi5kZYERbmlwa293QGNzLnR1bS5lZHWBGHRvYmlhcy5uaXBrb3dAY3MudHVt LmVkdTCBjQYDVR0fBIGFMIGCMD+gPaA7hjlodHRwOi8vY2RwMS5wY2EuZGZuLmRlL2Rmbi1j YS1nbG9iYWwtZzIvcHViL2NybC9jYWNybC5jcmwwP6A9oDuGOWh0dHA6Ly9jZHAyLnBjYS5k Zm4uZGUvZGZuLWNhLWdsb2JhbC1nMi9wdWIvY3JsL2NhY3JsLmNybDCB2wYIKwYBBQUHAQEE gc4wgcswMwYIKwYBBQUHMAGGJ2h0dHA6Ly9vY3NwLnBjYS5kZm4uZGUvT0NTUC1TZXJ2ZXIv T0NTUDBJBggrBgEFBQcwAoY9aHR0cDovL2NkcDEucGNhLmRmbi5kZS9kZm4tY2EtZ2xvYmFs LWcyL3B1Yi9jYWNlcnQvY2FjZXJ0LmNydDBJBggrBgEFBQcwAoY9aHR0cDovL2NkcDIucGNh LmRmbi5kZS9kZm4tY2EtZ2xvYmFsLWcyL3B1Yi9jYWNlcnQvY2FjZXJ0LmNydDANBgkqhkiG 9w0BAQsFAAOCAQEAOCUU6IMxIBv685lR6sshbAl9YdfybY4Z8+MJxQ+/Uj0I+PE4i4JqqOiX vZbS+BqQXYs52i1eLvHsilp3vGU+iLoEAgAgaDKs+YKrYBTUQWHUJyMlgA9yKBgUge0uDNYZ kt8lleS0lT7aIg6bUfInHIaAN6fd7taz11CyC3WvPx2N9r6ZE6kzxN6whx/CvAzEZ9R5MVD8 Trk29zBUATA4KPiCxj48OTyR3e19fbXQ54dtF+aR0aPIUdknIFxMFcsZGRVEbhFSmDSasDuw LfRfDamQEPv0ZeCds8XzDcPovGuH8SLwtRQq5Dq5nCIeAP+ywJZwo+o5nX+lRBivQ7YRtjGC BAswggQHAgEBMIGeMIGNMQswCQYDVQQGEwJERTFFMEMGA1UECgw8VmVyZWluIHp1ciBGb2Vy ZGVydW5nIGVpbmVzIERldXRzY2hlbiBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQL DAdERk4tUEtJMSUwIwYDVQQDDBxERk4tVmVyZWluIEdsb2JhbCBJc3N1aW5nIENBAgwjn+Ua 6vlEzNgn9ZswDQYJYIZIAWUDBAIBBQCgggI9MBgGCSqGSIb3DQEJAzELBgkqhkiG9w0BBwEw HAYJKoZIhvcNAQkFMQ8XDTIwMTIwODIxMDYyOFowLwYJKoZIhvcNAQkEMSIEIHOG7iRUyFyi X0MlImDyMFqDjmwZtCGXKt4JyiuQvXgZMGwGCSqGSIb3DQEJDzFfMF0wCwYJYIZIAWUDBAEq MAsGCWCGSAFlAwQBAjAKBggqhkiG9w0DBzAOBggqhkiG9w0DAgICAIAwDQYIKoZIhvcNAwIC AUAwBwYFKw4DAgcwDQYIKoZIhvcNAwICASgwga8GCSsGAQQBgjcQBDGBoTCBnjCBjTELMAkG A1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9lcmRlcnVuZyBlaW5lcyBEZXV0c2No ZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UECwwHREZOLVBLSTElMCMGA1UEAwwc REZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQQIMI5/lGur5RMzYJ/WbMIGxBgsqhkiG9w0B CRACCzGBoaCBnjCBjTELMAkGA1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9lcmRl cnVuZyBlaW5lcyBEZXV0c2NoZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UECwwH REZOLVBLSTElMCMGA1UEAwwcREZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQQIMI5/lGur5 RMzYJ/WbMA0GCSqGSIb3DQEBAQUABIIBABkMhc4EDu41RWt2Hx3T3wn6k5uSFFz+6oN+KYbo k5xoCM+rsTZaPvfCAAzqlW9Et7O+xb9GmDMtAOgQhcAY+wvMhCb7xWreJcx5y/xvsPTt/wNN NPaPO6j+OnPYLgLxXGsHEDZKtLK+IOqC4GhHt34MaXEOa2H0Y3rQuVbJyvfgjutT/BEkdzWX 9rbiseFm8IiKE5VqWzG+jy90A9Ysvm5OlWwkFAGJIeVLnGzW6EoKMyGm9m1H0GsXWJG5IDoV 8FN+YKMlCvth72kfayMvLXhfBxjaaZA67Wj/i0zv9qF5KqIAmrzQPQBUV+sgTyg2mKVEaF9Q sEnLyXjYiYxN1R8AAAAAAAA= --------------ms030608010604000809030400-- From P.Achten at cs.ru.nl Tue Dec 08 16:00:01 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:39740) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kmfPF-0000Ah-C8 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 16:00:01 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884177 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.174.16.143 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.174.16.143 listed in wl.mailspike.net] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta0.cl.cam.ac.uk ([128.232.25.20]:36351) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kmfPE-000wDH-Rt (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 08 Dec 2020 16:00:01 +0000 Received: from ppsw-31.csi.cam.ac.uk ([131.111.8.131]) by mta0.cl.cam.ac.uk with esmtp (Exim 4.93) (envelope-from ) id 1kmfPE-004t8n-8P for isabelle-users at cl.cam.ac.uk; Tue, 08 Dec 2020 16:00:00 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884177 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.174.16.143 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.174.16.143 listed in wl.mailspike.net] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from smtp1.science.ru.nl ([131.174.16.143]:35942) by ppsw-31.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.147]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kmfPD-000BUl-Kn (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Tue, 08 Dec 2020 16:00:00 +0000 Received: from [192.168.2.10] (84-84-201-162.fixed.kpn.net [84.84.201.162]) (authen=peter88) by smtp1.science.ru.nl (8.15.2/5.32) with ESMTPSA id 0B8Fxw2U002595 for ; Tue, 8 Dec 2020 16:59:58 +0100 From: Peter Achten To: isabelle-users at cl.cam.ac.uk Message-ID: Date: Tue, 8 Dec 2020 16:59:58 +0100 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Content-Language: en-GB X-debug-header: local_aliases has suffix X-Mailman-Approved-At: Wed, 09 Dec 2020 11:15:30 +0000 Subject: [isabelle] [TFP'21] second call for papers: Trends in Functional Programming 2021, 18-19 February (online event with Lambda Days 2021 & TFPIE 2021) X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 08 Dec 2020 16:00:01 -0000 -------------------------------------------------------------------------                      Second call for papers         22nd Symposium on Trends in Functional Programming                           tfp2021.org ------------------------------------------------------------------------- Did you miss the deadline to submit a paper to Trends in Functional Programming http://tfp2021.org/? No worries -- it's not too late! Submission is open until January 15th 2021, for a presentation slot at the event and post-symposium reviewing. The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions. * TFP offers a supportive reviewing process designed to help less experienced authors succeed, with two rounds of review, both before and after the symposium itself. Authors have an opportunity to address reviewers' concerns before final decisions on publication in the proceedings. * TFP offers two "best paper" awards, the John McCarthy award for best paper, and the David Turner award for best student paper. * TFP is co-located with Lambda Days in beautiful Krakow. Lambda Days is a vibrant developer conference with hundreds of attendees and a lively programme of talks on functional programming in practice. Due to the covid pandemic, the event is online with a lot of attention to interaction and getting to socialize with the community. Important Dates --------------- Submission deadline for pre-symposium review:   20th November, 2020 -- passed -- Submission deadline for draft papers:           15th January, 2021 Symposium dates:                                18-19th February, 2021 Visit http://tfp2021.org/ for more information. From eberlm at in.tum.de Wed Dec 09 16:36:18 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:34074) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kn2Ru-0004gM-Tr (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 09 Dec 2020 16:36:18 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884200 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.159.0.8 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.159.0.8 listed in wl.mailspike.net] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-out1.in.tum.de ([131.159.0.8]:50266 helo=mail-out1.informatik.tu-muenchen.de) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kn2Ru-000xPi-Q1 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 09 Dec 2020 16:36:18 +0000 Received: by mail.in.tum.de (Postfix, from userid 107) id 3C7DF1C12CB; Wed, 9 Dec 2020 17:36:17 +0100 (CET) Received: (Authenticated sender: eberlm) by mail.in.tum.de (Postfix) with ESMTPSA id 839061C121A for ; Wed, 9 Dec 2020 17:36:14 +0100 (CET) (Extended-Queue-bit tech_siuhq at fff.in.tum.de) To: "cl-isabelle-users at lists.cam.ac.uk" From: Manuel Eberl Message-ID: Date: Wed, 9 Dec 2020 17:36:13 +0100 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:78.0) Gecko/20100101 Thunderbird/78.4.3 MIME-Version: 1.0 Content-Type: multipart/signed; protocol="application/pkcs7-signature"; micalg=sha-256; boundary="------------ms070605090708090606020606" Subject: [isabelle] Using LaTeX output print mode for source text X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 09 Dec 2020 16:36:19 -0000 This is a cryptographically signed message in MIME format. --------------ms070605090708090606020606 Content-Type: text/plain; charset=utf-8 Content-Language: en-US-large Content-Transfer-Encoding: quoted-printable Is there any way to force Isabelle to print source text (definitions, theorem statements, proofs, etc.) to LaTeX not the way it was typed, but with abbreviations? I.e. if I define an abbreviation "|X| =3D card X" and I have lemma "card X =3D 1" I want the LaTeX output to show "|X|", not "card X". Manuel --------------ms070605090708090606020606 Content-Type: application/pkcs7-signature; name="smime.p7s" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="smime.p7s" Content-Description: S/MIME Cryptographic Signature MIAGCSqGSIb3DQEHAqCAMIACAQExDzANBglghkgBZQMEAgEFADCABgkqhkiG9w0BBwEAAKCC EXkwggUSMIID+qADAgECAgkA4wvV+K8l2YEwDQYJKoZIhvcNAQELBQAwgYIxCzAJBgNVBAYT AkRFMSswKQYDVQQKDCJULVN5c3RlbXMgRW50ZXJwcmlzZSBTZXJ2aWNlcyBHbWJIMR8wHQYD VQQLDBZULVN5c3RlbXMgVHJ1c3QgQ2VudGVyMSUwIwYDVQQDDBxULVRlbGVTZWMgR2xvYmFs Um9vdCBDbGFzcyAyMB4XDTE2MDIyMjEzMzgyMloXDTMxMDIyMjIzNTk1OVowgZUxCzAJBgNV BAYTAkRFMUUwQwYDVQQKEzxWZXJlaW4genVyIEZvZXJkZXJ1bmcgZWluZXMgRGV1dHNjaGVu IEZvcnNjaHVuZ3NuZXR6ZXMgZS4gVi4xEDAOBgNVBAsTB0RGTi1QS0kxLTArBgNVBAMTJERG Ti1WZXJlaW4gQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgMjCCASIwDQYJKoZIhvcNAQEBBQAD ggEPADCCAQoCggEBAMtg1/9moUHN0vqHl4pzq5lN6mc5WqFggEcVToyVsuXPztNXS43O+FZs FVV2B+pG/cgDRWM+cNSrVICxI5y+NyipCf8FXRgPxJiZN7Mg9mZ4F4fCnQ7MSjLnFp2uDo0p eQcAIFTcFV9Kltd4tjTTwXS1nem/wHdN6r1ZB+BaL2w8pQDcNb1lDY9/Mm3yWmpLYgHurDg0 WUU2SQXaeMpqbVvAgWsRzNI8qIv4cRrKO+KA3Ra0Z3qLNupOkSk9s1FcragMvp0049ENF4N1 xDkesJQLEvHVaY4l9Lg9K7/AjsMeO6W/VRCrKq4Xl14zzsjz9AkH4wKGMUZrAcUQDBHHWekC AwEAAaOCAXQwggFwMA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUk+PYMiba1fFKpZFK4OpL 4qIMz+EwHwYDVR0jBBgwFoAUv1kgNgB5oKAia4zV8mHSuCzLgkowEgYDVR0TAQH/BAgwBgEB /wIBAjAzBgNVHSAELDAqMA8GDSsGAQQBga0hgiwBAQQwDQYLKwYBBAGBrSGCLB4wCAYGZ4EM AQICMEwGA1UdHwRFMEMwQaA/oD2GO2h0dHA6Ly9wa2kwMzM2LnRlbGVzZWMuZGUvcmwvVGVs ZVNlY19HbG9iYWxSb290X0NsYXNzXzIuY3JsMIGGBggrBgEFBQcBAQR6MHgwLAYIKwYBBQUH MAGGIGh0dHA6Ly9vY3NwMDMzNi50ZWxlc2VjLmRlL29jc3ByMEgGCCsGAQUFBzAChjxodHRw Oi8vcGtpMDMzNi50ZWxlc2VjLmRlL2NydC9UZWxlU2VjX0dsb2JhbFJvb3RfQ2xhc3NfMi5j ZXIwDQYJKoZIhvcNAQELBQADggEBAIcL/z4Cm2XIVi3WO5qYi3FP2ropqiH5Ri71sqQPrhE4 eTizDnS6dl2e6BiClmLbTDPo3flq3zK9LExHYFV/53RrtCyD2HlrtrdNUAtmB7Xts5et6u5/ MOaZ/SLick0+hFvu+c+Z6n/XUjkurJgARH5pO7917tALOxrN5fcPImxHhPalR6D90Bo0fa3S PXez7vTXTf/D6OWST1k+kEcQSrCFWMBvf/iu7QhCnh7U3xQuTY+8npTD5+32GPg8SecmqKc2 2CzeIs2LgtjZeOJVEqM7h0S2EQvVDFKvaYwPBt/QolOLV5h7z/0HJPT8vcP9SpIClxvyt7bP ZYoaorVyGTkwggWsMIIElKADAgECAgcbY7rQHiw9MA0GCSqGSIb3DQEBCwUAMIGVMQswCQYD VQQGEwJERTFFMEMGA1UEChM8VmVyZWluIHp1ciBGb2VyZGVydW5nIGVpbmVzIERldXRzY2hl biBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQLEwdERk4tUEtJMS0wKwYDVQQDEyRE Rk4tVmVyZWluIENlcnRpZmljYXRpb24gQXV0aG9yaXR5IDIwHhcNMTYwNTI0MTEzODQwWhcN MzEwMjIyMjM1OTU5WjCBjTELMAkGA1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9l cmRlcnVuZyBlaW5lcyBEZXV0c2NoZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UE CwwHREZOLVBLSTElMCMGA1UEAwwcREZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQTCCASIw DQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAJ07eRxH3h+Gy8Zp1xCeOdfZojDbchwFfylf S2jxrRnWTOFrG7ELf6Gr4HuLi9gtzm6IOhDuV+UefwRRNuu6cG1joL6WLkDh0YNMZj0cZGnl m6Stcq5oOVGHecwX064vXWNxSzl660Knl5BpBb+Q/6RAcL0D57+eGIgfn5mITQ5HjUhfZZkQ 0tkqSe3BuS0dnxLLFdM/fx5ULzquk1enfnjK1UriGuXtQX1TX8izKvWKMKztFwUkP7agCwf9 TRqaA1KgNpzeJIdl5Of6x5ZzJBTN0OgbaJ4YWa52fvfRCng8h0uwN89Tyjo4EPPLR22MZD08 WkVKusqAfLjz56dMTM0CAwEAAaOCAgUwggIBMBIGA1UdEwEB/wQIMAYBAf8CAQEwDgYDVR0P AQH/BAQDAgEGMCkGA1UdIAQiMCAwDQYLKwYBBAGBrSGCLB4wDwYNKwYBBAGBrSGCLAEBBDAd BgNVHQ4EFgQUazqYi/nyU4na4K2yMh4JH+iqO3QwHwYDVR0jBBgwFoAUk+PYMiba1fFKpZFK 4OpL4qIMz+EwgY8GA1UdHwSBhzCBhDBAoD6gPIY6aHR0cDovL2NkcDEucGNhLmRmbi5kZS9n bG9iYWwtcm9vdC1nMi1jYS9wdWIvY3JsL2NhY3JsLmNybDBAoD6gPIY6aHR0cDovL2NkcDIu cGNhLmRmbi5kZS9nbG9iYWwtcm9vdC1nMi1jYS9wdWIvY3JsL2NhY3JsLmNybDCB3QYIKwYB BQUHAQEEgdAwgc0wMwYIKwYBBQUHMAGGJ2h0dHA6Ly9vY3NwLnBjYS5kZm4uZGUvT0NTUC1T ZXJ2ZXIvT0NTUDBKBggrBgEFBQcwAoY+aHR0cDovL2NkcDEucGNhLmRmbi5kZS9nbG9iYWwt cm9vdC1nMi1jYS9wdWIvY2FjZXJ0L2NhY2VydC5jcnQwSgYIKwYBBQUHMAKGPmh0dHA6Ly9j ZHAyLnBjYS5kZm4uZGUvZ2xvYmFsLXJvb3QtZzItY2EvcHViL2NhY2VydC9jYWNlcnQuY3J0 MA0GCSqGSIb3DQEBCwUAA4IBAQCBeEWkTqR/DlXwCbFqPnjMaDWpHPOVnj/z+N9rOHeJLI21 rT7H8pTNoAauusyosa0zCLYkhmI2THhuUPDVbmCNT1IxQ5dGdfBi5G5mUcFCMWdQ5UnnOR7L n8qGSN4IFP8VSytmm6A4nwDO/afr0X9XLchMX9wQEZc+lgQCXISoKTlslPwQkgZ7nu7YRrQb tQMMONncsKk/cQYLsgMHM8KNSGMlJTx6e1du94oFOO+4oK4v9NsH1VuEGMGpuEvObJAaguS5 Pfp38dIfMwK/U+d2+dwmJUFvL6Yb+qQTkPp8ftkLYF3sv8pBoGH7EUkp2KgtdRXYShjqFu9V NCIaE40GMIIGrzCCBZegAwIBAgIMI4l7YMPKWG8NuOwAMA0GCSqGSIb3DQEBCwUAMIGNMQsw CQYDVQQGEwJERTFFMEMGA1UECgw8VmVyZWluIHp1ciBGb2VyZGVydW5nIGVpbmVzIERldXRz Y2hlbiBGb3JzY2h1bmdzbmV0emVzIGUuIFYuMRAwDgYDVQQLDAdERk4tUEtJMSUwIwYDVQQD DBxERk4tVmVyZWluIEdsb2JhbCBJc3N1aW5nIENBMB4XDTIwMDkyMjEzMzYxN1oXDTIxMTEx NjE1MzUzMlowgb4xCzAJBgNVBAYTAkRFMQ8wDQYDVQQIDAZCYXllcm4xETAPBgNVBAcMCE11 ZW5jaGVuMSkwJwYDVQQKDCBUZWNobmlzY2hlIFVuaXZlcnNpdGFldCBNdWVuY2hlbjEiMCAG A1UECwwZRmFrdWx0YWV0IGZ1ZXIgSW5mb3JtYXRpazEVMBMGA1UEAwwMTWFudWVsIEViZXJs MSUwIwYJKoZIhvcNAQkBFhZtYW51ZWwuZWJlcmxAaW4udHVtLmRlMIIBIjANBgkqhkiG9w0B AQEFAAOCAQ8AMIIBCgKCAQEAucaS1T3hcnzeraljQM15EbQ1VC+eOZU5K5myJfZX4UH+eZq4 kqh7scR/NhBd6S4wnUF4f5JCAIufOLa3r1YkVKuK3LfYpzQnaKEufsdo8+SEWnldxCv/VPv1 eRTlZT3Z0jguqp54oDt3RyVXb81NfqEuJzNp6KbkPokZ4sggA1gVjc19bge5Iesw2xDJ6R+a /ZeNhcPt2uF3qHptkiJIm/lL8PBBT2M7EEIc6zwe9vzK2YtfEG3kZ/N5N1rICavwdyfdsslV 4CMje5jrdj7hWUs9kFfLoCyq8YGzolLNh30JlH7UGjA+d008Yec0ewr7NKmYOUKIZlfaOam/ /CKXfQIDAQABo4IC2jCCAtYwPgYDVR0gBDcwNTAPBg0rBgEEAYGtIYIsAQEEMBAGDisGAQQB ga0hgiwBAQQHMBAGDisGAQQBga0hgiwCAQQHMAkGA1UdEwQCMAAwDgYDVR0PAQH/BAQDAgXg MB0GA1UdJQQWMBQGCCsGAQUFBwMCBggrBgEFBQcDBDAdBgNVHQ4EFgQUcpSUz9enXud8qDpV 3R0dGEl2Z1swHwYDVR0jBBgwFoAUazqYi/nyU4na4K2yMh4JH+iqO3QwgasGA1UdEQSBozCB oIEQZWJlcmxtQGluLnR1bS5kZYEWbWFudWVsLmViZXJsQGluLnR1bS5kZYEgZWJlcmxtQGlu Zm9ybWF0aWsudHUtbXVlbmNoZW4uZGWBJm1hbnVlbC5lYmVybEBpbmZvcm1hdGlrLnR1LW11 ZW5jaGVuLmRlgRFlYmVybG1AY3MudHVtLmVkdYEXbWFudWVsLmViZXJsQGNzLnR1bS5lZHUw gY0GA1UdHwSBhTCBgjA/oD2gO4Y5aHR0cDovL2NkcDEucGNhLmRmbi5kZS9kZm4tY2EtZ2xv YmFsLWcyL3B1Yi9jcmwvY2FjcmwuY3JsMD+gPaA7hjlodHRwOi8vY2RwMi5wY2EuZGZuLmRl L2Rmbi1jYS1nbG9iYWwtZzIvcHViL2NybC9jYWNybC5jcmwwgdsGCCsGAQUFBwEBBIHOMIHL MDMGCCsGAQUFBzABhidodHRwOi8vb2NzcC5wY2EuZGZuLmRlL09DU1AtU2VydmVyL09DU1Aw SQYIKwYBBQUHMAKGPWh0dHA6Ly9jZHAxLnBjYS5kZm4uZGUvZGZuLWNhLWdsb2JhbC1nMi9w dWIvY2FjZXJ0L2NhY2VydC5jcnQwSQYIKwYBBQUHMAKGPWh0dHA6Ly9jZHAyLnBjYS5kZm4u ZGUvZGZuLWNhLWdsb2JhbC1nMi9wdWIvY2FjZXJ0L2NhY2VydC5jcnQwDQYJKoZIhvcNAQEL BQADggEBAEpTbbFnQNh9aC08cx/DzduZ3ZDZD6xNW+4eyKfCnfyGr3XADGesbpRNqtv8ZBCR duT2g26iZgw0dHrVwxAzbbUkHHNM6FxQbO2ek5EHS2/NWLhzwq54LCseextQCYRMYxOM5Lrp HKfSqdZG6QmdY8Gl4XI6/RD70KYBoE1Ek6MHh+zrEwFNrvuuKdSBK2ekw4xMs9HqnKCf+DqU bpFkjecjHYSEiV8IwygHbzpimO4Eu8niFM7LlvuLnrKOcPefE2QxAX0uWzPCXyIYcPFZC8ue Lum8VtPNgj2WvLQ4B9rj0+ytw4157j4wKQGa+HX2frIblGajpjkEBYwpaI4cFBYxggQLMIIE BwIBATCBnjCBjTELMAkGA1UEBhMCREUxRTBDBgNVBAoMPFZlcmVpbiB6dXIgRm9lcmRlcnVu ZyBlaW5lcyBEZXV0c2NoZW4gRm9yc2NodW5nc25ldHplcyBlLiBWLjEQMA4GA1UECwwHREZO LVBLSTElMCMGA1UEAwwcREZOLVZlcmVpbiBHbG9iYWwgSXNzdWluZyBDQQIMI4l7YMPKWG8N uOwAMA0GCWCGSAFlAwQCAQUAoIICPTAYBgkqhkiG9w0BCQMxCwYJKoZIhvcNAQcBMBwGCSqG SIb3DQEJBTEPFw0yMDEyMDkxNjM2MTNaMC8GCSqGSIb3DQEJBDEiBCCy/iT9RkTrfU4gNyW9 7vkm+xqfZpoMurSlNEwmqWJiuDBsBgkqhkiG9w0BCQ8xXzBdMAsGCWCGSAFlAwQBKjALBglg hkgBZQMEAQIwCgYIKoZIhvcNAwcwDgYIKoZIhvcNAwICAgCAMA0GCCqGSIb3DQMCAgFAMAcG BSsOAwIHMA0GCCqGSIb3DQMCAgEoMIGvBgkrBgEEAYI3EAQxgaEwgZ4wgY0xCzAJBgNVBAYT AkRFMUUwQwYDVQQKDDxWZXJlaW4genVyIEZvZXJkZXJ1bmcgZWluZXMgRGV1dHNjaGVuIEZv cnNjaHVuZ3NuZXR6ZXMgZS4gVi4xEDAOBgNVBAsMB0RGTi1QS0kxJTAjBgNVBAMMHERGTi1W ZXJlaW4gR2xvYmFsIElzc3VpbmcgQ0ECDCOJe2DDylhvDbjsADCBsQYLKoZIhvcNAQkQAgsx gaGggZ4wgY0xCzAJBgNVBAYTAkRFMUUwQwYDVQQKDDxWZXJlaW4genVyIEZvZXJkZXJ1bmcg ZWluZXMgRGV1dHNjaGVuIEZvcnNjaHVuZ3NuZXR6ZXMgZS4gVi4xEDAOBgNVBAsMB0RGTi1Q S0kxJTAjBgNVBAMMHERGTi1WZXJlaW4gR2xvYmFsIElzc3VpbmcgQ0ECDCOJe2DDylhvDbjs ADANBgkqhkiG9w0BAQEFAASCAQAQqtt4fLP39WLMAFjWp+6wI9h+1taqcpdIAD/hxVc6wreu nFVLdrlwJxjse8lXLNoS1cdorJH+WQpP7pZJtFlM96s2yuukyKkFUaFSKTgvqHQ8Jn+cp2aQ IEXORg0+MYAllcCY/2PPpCwcqi4SzM9AqyrT8bnVL5NWCK3CBdH/r6eF1+AN/AJ4S/2ZLd5F 1zlN0SbxF98iV9mcz+Yxa1ucviFzVcuXes63/L2Es5NnxWovLsHL6jycybX7OTUXHDycJEZl ka5LJjoeBBkjOtHK/h1ONOae5eqM0g2P+XpY20HZV7y3A9+bqWnO51K1QoWSpg5e6hG9WWkS OT5Vb9RkAAAAAAAA --------------ms070605090708090606020606-- From p.m.sewell at googlemail.com Wed Dec 09 18:13:13 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:57934) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kn3xh-0000TB-G0 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 09 Dec 2020 18:13:13 +0000 X-Cam-SpamDetails: score 0.4 from SpamAssassin-3.4.4-1884200 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.208.173 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.208.173 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [p.m.sewell[at]googlemail.com] * 0.2 HEADER_FROM_DIFFERENT_DOMAINS From and EnvelopeFrom 2nd level mail * domains are different * 0.0 HTML_MESSAGE BODY: HTML included in message * 0.2 FREEMAIL_FORGED_FROMDOMAIN 2nd level domains in From and * EnvelopeFrom freemail headers are different * 0.0 LOTS_OF_MONEY Huge... sums of money X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta0.cl.cam.ac.uk ([128.232.25.20]:34059) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kn3xg-000q0I-dt (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 09 Dec 2020 18:13:13 +0000 Received: from ppsw-41.csi.cam.ac.uk ([2001:630:212:8::e:f41]) by mta0.cl.cam.ac.uk with esmtp (Exim 4.93) (envelope-from ) id 1kn3xf-00590B-UR for isabelle-users at cl.cam.ac.uk; Wed, 09 Dec 2020 18:13:11 +0000 X-Cam-SpamDetails: score 0.4 from SpamAssassin-3.4.4-1884200 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.208.173 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.208.173 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.2 HEADER_FROM_DIFFERENT_DOMAINS From and EnvelopeFrom 2nd level mail * domains are different * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [p.m.sewell[at]googlemail.com] * 0.0 HTML_MESSAGE BODY: HTML included in message * 0.0 LOTS_OF_MONEY Huge... sums of money * 0.2 FREEMAIL_FORGED_FROMDOMAIN 2nd level domains in From and * EnvelopeFrom freemail headers are different X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-lj1-f173.google.com ([209.85.208.173]:35115) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kn3xe-0011U1-SD (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Wed, 09 Dec 2020 18:13:11 +0000 Received: by mail-lj1-f173.google.com with SMTP id f11so3537468ljn.2 for ; Wed, 09 Dec 2020 10:13:10 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:reply-to:from:date:message-id :subject:to; bh=EegpsgqPdI37hLs5EvjAUNEv7jwrGWDyeFOsamCGq8w=; b=LjPKeS17Byu/+zc8tPIg95rGj5IecXBZPlBlmlJ3nLXoC1PHoOd9IxZl2o9UBg0w+O DtDWJ60QpgYqU21lBcN7IKiUmz8g7NOyKSNYw7sOFd6pgthfrqKEy7NWGoVflzdCOxI+ s4v/vrjQjnAgOqfF4ISuIeebbg+lQlX2hd928CayEMapOr0Bg+8n6wEvXmiov0b1pEl6 UJNGs4Ju54VtuGamzY7eSLosKKjeHjIvoMzCTSomJbpVNzqbuCUVlsaACBeYrbatJuB8 5JcPwloatRNyLVABmGXjGCWMuc3hDOyLIG1UDSLkyMUrLJkCrOfZWbulWHPG6L4fks2G kyIQ== X-Gm-Message-State: AOAM530MLEeB8K62kj84hg7rJxUjFZjOu7uOHNyCduL2/kFxdJfjT2fR pPv9Olk/MV1oHE5G/5ax54IfOmmwlN6Dzarhgeoc7HaR61s= X-Google-Smtp-Source: ABdhPJyZwxLZ0M5oSTDZMhtNtSWDTT/B1mmDPS/8AN/ARy9BW4sHZzNNNjHcXO/CimzLeVcoKJbc8c7fafz5JUD8218= X-Received: by 2002:a2e:2f0f:: with SMTP id v15mr1534946ljv.402.1607537590051; Wed, 09 Dec 2020 10:13:10 -0800 (PST) MIME-Version: 1.0 From: Peter Sewell Date: Wed, 9 Dec 2020 18:12:58 +0000 Message-ID: To: isabelle-users at cl.cam.ac.uk Content-Type: multipart/alternative; boundary="00000000000004aa2f05b60c03c1" X-debug-header: local_aliases has suffix Subject: [isabelle] Postdoc and research engineer positions in Semantics and Verification for Secure Systems Software X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list Reply-To: Peter.Sewell at cl.cam.ac.uk List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 09 Dec 2020 18:13:13 -0000 --00000000000004aa2f05b60c03c1 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Postdoc and research engineer positions in Semantics and Verification for Secure Systems Software Advert: http://www.jobs.cam.ac.uk/job/28012/ Closing date: 13 January 2021 Are you interested in developing and applying semantics and verification techniques to radically improve the foundations and security of mainstream computer systems? We are looking for postdoctoral researchers and research assistants to do exactly that, in a wide range of topics. In recent years, working with Arm, IBM, RISC-V International, the CHERI team, the C and C++ standards committees, and others, we have shown how one can develop and use authoritative semantics for full-scale architecture and language definitions, including instruction-set architectures of ARMv8-A, RISC-V, and CHERI in our Sail metalanguage ( https://www.cl.cam.ac.uk/~pes20/sail/), our Cerberus C semantics ( https://www.cl.cam.ac.uk/~pes20/cerberus/), and relaxed-memory concurrency models at the architecture and C/C++ language levels. These use a combination of semantic definitions made executable as test oracles, test generation, symbolic execution, and mechanised proof; they have resolved many questions about what these fundamental abstractions are or should be; and they can enable both lightweight formal engineering and full verification of key parts of real systems. We now aim to build above this in two related projects, for CHERI and Arm system software. (1) CHERI verification. CHERI ( https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-941.pdf, https://www.cl.cam.ac.uk/research/security/ctsrd/cheri/) extends conventional hardware Instruction-Set Architectures (ISAs) with new architectural features, using capabilities, to enable fine-grained memory protection and highly scalable software compartmentalization. The CHERI project is led by Robert Watson, Simon Moore, and Peter Sewell at the University of Cambridge and Peter Neumann at SRI International. CHERI allows historically memory-unsafe programming languages such as C and C++ to be adapted to protect against many currently widely exploited security vulnerabilities, and enables the fine-grained decomposition of operating-system (OS) and application code, to limit the effects of security vulnerabilities. CHERI is a hardware/software/semantics co-design project, bringing together computer architecture, systems software, security, and semantics. In October 2019, Arm announced Morello ( https://www.cl.cam.ac.uk/research/security/ctsrd/cheri/cheri-morello.html), an experimental CHERI-extended, multicore, superscalar ARMv8-A processor, System-on-Chip (SoC), and prototype board. Morello is a part of the UKRI =C2=A3187M Digital Security by Design Challenge (DSbD), supported by the UK Industrial Strategy Challenge Fund, including a commitment of over =C2=A350= M by Arm. Morello will support industrial-scale evaluation of CHERI, with a view to mass-market adoption - which would transform the security landscape. We have previously developed rigorous engineering methods ( https://www.cl.cam.ac.uk/research/security/ctsrd/cheri/cheri-formal.html) to precisely define the CHERI ISA, for CHERI-MIPS and CHERI-RISC-V variants, and to prove (in Isabelle) that they satisfy key intended security properties (https://www.cl.cam.ac.uk/users/pes20/cheri-formal.pdf)= . We are now collaborating with Arm and researchers at the University of Edinburgh to do the same for the full Morello CHERI ARMv8 ISA, building on our Sail ARMv8-A ISA semantics, and to study the semantics and security of higher-level languages and system software above CHERI, building also on our Cerberus C semantics (https://www.cl.cam.ac.uk/~pes20/cerberus/). Morello and this verification aim to improve the security of all Arm mobile device software. (2) Arm system software verification. This ongoing project, in collaboration with Google and with researchers at MPI-SWS, Radboud, SNU, and Aarhus, aims to establish correctness and security properties of key hypervisor system software above the ARMv8-A ISA semantics mentioned above, integrated with the ARMv8-A concurrency architecture (including both the previous "user-mode" models and the system concurrency semantics, being developed in collaboration with Arm) ( https://www.cl.cam.ac.uk/~pes20/armv8-mca/). The Cambridge work is led by Peter Sewell, Neel Krishnaswami, and Robert Watson. Here too, there is the prospect of the resulting system being very widely deployed. We are looking for postdocs and research assistants to contribute to all aspects of both projects. You should have a strong background in semantics and verification, the motivation and flexibility to develop practical ways to use them at scale for real systems, and experience in one or more of: - interactive theorem proving, in Coq and/or Isabelle (we use both) - program logics (especially separation logics and Iris) - relaxed-memory concurrency - low-level system software - programming language semantics and type systems - program analysis - model checking - computer security - functional programming We are also seeking candidates with a research engineering focus, to assist in the development of robust and widely usable tools based on the above. For this, you should have experience in functional programming, especially OCaml. For more details of our recent work, see (https://www.cl.cam.ac.uk/~pes20/)= , and especially the REMS (https://www.cl.cam.ac.uk/~pes20/rems/index.html) and CHERI (https://www.cl.cam.ac.uk/research/security/ctsrd/cheri/) projects, which are both lively and effective collaborations. The positions are available to start as soon as possible. For candidates with substantial relevant expertise, we may be able to appoint at the Senior Research Associate level. Research Assistant (without PhD): =C2=A326,715-=C2=A330,942, Research Assoc= iate (with PhD): =C2=A332,816-=C2=A340,322, or Senior Research Associate: =C2=A341,526= -=C2=A352,559. Appointment to Senior Research Associate will be considered for exceptional candidates. Fixed-term: The funds for these posts are available for 2 years in the first instance. Further details may be obtained from Prof. Peter Sewell, email Peter.Sewell at cl.cam.ac.uk You will need to upload a full curriculum vitae (CV) and a covering letter outlining your interests, potential contributions to the project, and relevant past experience; both in pdf format. You should also include the contact details for 2 referees who will be able to promptly provide letters if requested. If you upload any additional documents which haven't been requested we will not be able to consider these as part of your application= . Due to the current circumstances, there may be a possibility for remote working in the first instance. Please contact the HR Manager to discuss the finer details. Please quote reference NR25056 on your application and in any correspondence about this vacancy. Apply online: http://hrsystems.admin.cam.ac.uk/recruit-ui/apply/NR25056 The University actively supports equality, diversity and inclusion and encourages applications from all sections of society. The University has a responsibility to ensure that all employees are eligible to live and work in the UK. --00000000000004aa2f05b60c03c1 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Postdoc and research engineer positions in Semantics and V= erification for Secure Systems Software

Advert: http://www.jobs.cam.ac.uk/job/28012/
Cl= osing date: 13 January 2021

Are you interested in developing and app= lying semantics and verification techniques to radically improve the founda= tions and security of mainstream computer systems? We are looking for postd= octoral researchers and research assistants to do exactly that, in a wide r= ange of topics.

In recent years, working with Arm, IBM, RISC-V Inter= national, the CHERI team, the C and C++ standards committees, and others, w= e have shown how one can develop and use authoritative semantics for full-s= cale architecture and language definitions, including instruction-set archi= tectures of ARMv8-A, RISC-V, and CHERI in our Sail metalanguage (https://www.cl.cam.ac.uk/~pes20/sai= l/), our Cerberus C semantics (https://www.cl.cam.ac.uk/~pes20/cerberus/), and relaxed-m= emory concurrency models at the architecture and C/C++ language levels. The= se use a combination of semantic definitions made executable as test oracle= s, test generation, symbolic execution, and mechanised proof; they have res= olved many questions about what these fundamental abstractions are or shoul= d be; and they can enable both lightweight formal engineering and full veri= fication of key parts of real systems.

We now aim to build above thi= s in two related projects, for CHERI and Arm system software.

(1) CH= ERI verification. CHERI (https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-941.pdf, htt= ps://www.cl.cam.ac.uk/research/security/ctsrd/cheri/) extends conventio= nal hardware Instruction-Set Architectures (ISAs) with new architectural fe= atures, using capabilities, to enable fine-grained memory protection and hi= ghly scalable software compartmentalization. The CHERI project is led by Ro= bert Watson, Simon Moore, and Peter Sewell at the University of Cambridge a= nd Peter Neumann at SRI International. CHERI allows historically memory-uns= afe programming languages such as C and C++ to be adapted to protect agains= t many currently widely exploited security vulnerabilities, and enables the= fine-grained decomposition of operating-system (OS) and application code, = to limit the effects of security vulnerabilities. CHERI is a hardware/softw= are/semantics co-design project, bringing together computer architecture, s= ystems software, security, and semantics.

In October 2019, Arm annou= nced Morello (https://www.cl.cam.ac.uk/research/security/ctsrd/c= heri/cheri-morello.html), an experimental CHERI-extended, multicore, su= perscalar ARMv8-A processor, System-on-Chip (SoC), and prototype board. Mor= ello is a part of the UKRI =C2=A3187M Digital Security by Design Challenge = (DSbD), supported by the UK Industrial Strategy Challenge Fund, including a= commitment of over =C2=A350M by Arm. Morello will support industrial-scale= evaluation of CHERI, with a view to mass-market adoption - which would tra= nsform the security landscape.

We have previously developed rigorous= engineering methods (https://www.cl.cam.ac.uk/research/security/= ctsrd/cheri/cheri-formal.html) to precisely define the CHERI ISA, for C= HERI-MIPS and CHERI-RISC-V variants, and to prove (in Isabelle) that they s= atisfy key intended security properties (https://www.cl.cam.ac.uk/users/pes20/cheri-= formal.pdf). We are now collaborating with Arm and researchers at the U= niversity of Edinburgh to do the same for the full Morello CHERI ARMv8 ISA,= building on our Sail ARMv8-A ISA semantics, and to study the semantics and= security of higher-level languages and system software above CHERI, buildi= ng also on our Cerberus C semantics (https://www.cl.cam.ac.uk/~pes20/cerberus/). Morello and= this verification aim to improve the security of all Arm mobile device sof= tware.

(2) Arm system software verification. This ongoing project, i= n collaboration with Google and with researchers at MPI-SWS, Radboud, SNU, = and Aarhus, aims to establish correctness and security properties of key hy= pervisor system software above the ARMv8-A ISA semantics mentioned above, i= ntegrated with the ARMv8-A concurrency architecture (including both the pre= vious "user-mode" models and the system concurrency semantics, be= ing developed in collaboration with Arm) (https://www.cl.cam.ac.uk/~pes20/armv8-mca/). The = Cambridge work is led by Peter Sewell, Neel Krishnaswami, and Robert Watson= . Here too, there is the prospect of the resulting system being very widely= deployed.

We are looking for postdocs and research assistants to co= ntribute to all aspects of both projects. You should have a strong backgrou= nd in semantics and verification, the motivation and flexibility to develop= practical ways to use them at scale for real systems, and experience in on= e or more of:

- interactive theorem proving, in Coq and/or Isabelle = (we use both)
- program logics (especially separation logics and Iris)- relaxed-memory concurrency
- low-level system software
- programm= ing language semantics and type systems
- program analysis
- model ch= ecking
- computer security
- functional programming

We are als= o seeking candidates with a research engineering focus, to assist in the de= velopment of robust and widely usable tools based on the above. For this, y= ou should have experience in functional programming, especially OCaml.
<= br>For more details of our recent work, see (https://www.cl.cam.ac.uk/~pes20/), and especially the RE= MS (https://www= .cl.cam.ac.uk/~pes20/rems/index.html) and CHERI (https://www.cl.cam.ac.uk/rese= arch/security/ctsrd/cheri/) projects, which are both lively and effecti= ve collaborations.

The positions are available to start as soon as p= ossible. For candidates with substantial relevant expertise, we may be able= to appoint at the Senior Research Associate level.

Research Assista= nt (without PhD): =C2=A326,715-=C2=A330,942, Research Associate (with PhD):= =C2=A332,816-=C2=A340,322, or Senior Research Associate: =C2=A341,526-=C2= =A352,559. Appointment to Senior Research Associate will be considered for = exceptional candidates.

Fixed-term: The funds for these posts are av= ailable for 2 years in the first instance.

Further details may be o= btained from Prof. Peter Sewell, email Peter.Sewell at cl.cam.ac.uk

You will need to upload a ful= l curriculum vitae (CV) and a covering letter outlining your interests, pot= ential contributions to the project, and relevant past experience; both in = pdf format. You should also include the contact details for 2 referees who = will be able to promptly provide letters if requested. If you upload any ad= ditional documents which haven't been requested we will not be able to = consider these as part of your application.

Due to the current circu= mstances, there may be a possibility for remote working in the first instan= ce. Please contact the HR Manager to discuss the finer details.

Plea= se quote reference NR25056 on your application and in any correspondence ab= out this vacancy.

Apply online: http://hrsystems.admin.cam.ac.uk/recruit-= ui/apply/NR25056

The University actively supports equality, dive= rsity and inclusion and encourages applications from all sections of societ= y.

The University has a responsibility to ensure that all employees = are eligible to live and work in the UK.
--00000000000004aa2f05b60c03c1-- From carsten at dcs.bbk.ac.uk Wed Dec 09 13:49:16 2020 Received: from ppsw-40.csi.cam.ac.uk ([131.111.8.140]:60686) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kmzqG-0003cf-04 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 09 Dec 2020 13:49:16 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884200 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [193.61.29.4 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 MAY_BE_FORGED Relay IP's reverse DNS does not resolve to IP X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mailer2.dcs.bbk.ac.uk ([193.61.29.4]:35903) by ppsw-40.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.148]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kmzqF-000AEv-ja (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 09 Dec 2020 13:49:15 +0000 Received: from [192.168.10.134] (193-28-39-130.customers.pinemedia.net [193.28.39.130] (may be forged)) (authenticated bits=0) by mailer2.dcs.bbk.ac.uk (8.15.2+Sun/8.15.2) with ESMTPSA id 0B9Dm9CO005426 (version=TLSv1.2 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Wed, 9 Dec 2020 13:48:10 GMT From: Carsten Fuhs Autocrypt: addr=carsten at dcs.bbk.ac.uk; prefer-encrypt=mutual; keydata= mQINBFTeqy4BEACc/1FhOOiFUxdM+9U3hiSEq3y/pSlhPfaYy8UstUrZHNr9Tayidg1BVQIz nBz8N+u/pqXIykDFXc72e6PU3769eVQiUJZWJOspv7Vc51GrdbQ7p8aXL32vF33EkIdEWXa3 9szXDDXnRBE5RMp2zouRfgwoGbNIsSHkht/Y8ukURg5yT7kxLGZhIp9kXK0Xy368W141egVs IblN4SfeNA73r97B1VbqXq8vWa/hv9KMTXWWM/Gd9otrC2wSeLnp8Vl8YuSCYdee/PVtMjcB HcDTS+P+c36WuxC19LSkxPr0IezU8DUCZAp3152SAW/ZPyWnVo1aMnRxPNXC+n6+fIv/nJjE 50reUzkTMdvbKGeKdkaIMboWGoPqe/3aLPCFqU+MhDmSSryDar8pFn1LehA2ZZGHSsT10gRJ lw0omV3S+CFLTtjwguqoVKSDKc5E12MFgcLqL28W1ankAU2NVCc0ZDlccVhPW9pkxth4RMZr qOlD+9aC2COqMF9glF38s2DFQLiCSdp9CBQ4GDv1EaqyqJaLpI45ciBFZrgp23c1h6Kc+RWR 0qCZuCLU7H/ynDnguE4foKacsLRqJ0W4cmfURmCAF3CrHNHWQLmQgGHdaJdB64AAIkeloO7q OJT9zHtQQGXxvGiyjmbCmT7EgsMugLZY/61QDuckGuauzBMmGQARAQABtB9DYXJzdGVuIEZ1 aHMgPGMuZnVoc0B1Y2wuYWMudWs+iQI7BBMBAgAlAhsjBgsJCAcDAgYVCAIJCgsEFgIDAQIe AQIXgAUCVN8powIZAQAKCRA3wWyTqCMjUUvZD/9/M0IcqKODCyyIm8PxbSSyef8ZUdR5v8GN Z9zhoXUH4dVfZszxmpk6KuyFzeWgLOGPfeqQGXsorAlaldeimN96eGPyDgg8wViwlWDkBMCK zNd2nBZTmSlIchM1fA0JrA3RywVFcwyBIS6M2SHoeb7KrXRswrbBG81GuRecD6+hTyir0Wbl rHsizNsRAP0kWqYrofc6QvfapnlSiWwY3gBtoI5z8Kzm7jI23i+J51i9ZhDbbWhjQE1UBxTb 7MJe6zPUBYOLWMP3Ah68MtX+T5EMM0yKyYNX0g+5sTAh6hdxyde9CxHHKSasAhsCYzYi94q8 cNYBwhE8HpS7atYaDLXy7WMDsdJlo3EF8EBfnibp06oZ3pvNiw5Vb2BvqbqARqcJzwbbA7eU +3FB5uL2gEwYFWBVj5NuXr09IYlYLRhqPvC5X0J3BwoytUaPYDKLth9FZlALVnujQqrlQ+mK y2TIt9tEgjpu+TSLOh7GC/IUh7thJHQqOOyGqzPNUqLJWc0lrpDs9GBtQUE4p5EkOiEl5VA2 6ZrDU0xUlx5Bn2bDQ+dnw4nZFqw/t4lsCAPT7hfe3QgcPdp1petr9NUMMSorbU7msoIie+ps q1Oulx2AMlHhW4dX6p72wAJGTjUxkHJ04gOyQY3lL4o7C9JQco81Cdf3/zBTM4Z/51P4WDDV BrkCDQRU3qsuARAA72cCI1oDvK90BcUZIijbBIISg2URKoXNKawWyqcsYBi8QuwBPrmD3G0z Ooll4BoPiqFlGQpnC75GXgcHcHjlrKPvhbLy6SHQlBr9Aed4YOQ0dAXRcCDBR3UW67Si+CGm eoC+tVrLGYpMp0bgTT+omkvlr615zozmXoJ6to2GBKDDg7R/SIUCFefZgeOdAg5eAXAJIIyz QNwoonMZRrK1wYc0LRGuZf2tF4qlmkA/TC8bJxpLBbNxQZ1HmDvnN0PaIiL6IZXNFbr1bvnL IQ+DQujkQk+ovGJ7jOpIn2i1wsZw3ZUjXSOpW7Y0gQBaMUyZiXdCJc9tScWDq0C3rmTDsbd4 WURJHD7jUk7emt5TViR32ij1zGnjp63EW25BFu6HSGAQtn7E7+TZzkSRuRPZTPLBzfHizyCM LSLd84aT8Ec7cA2ScvesIRpIg+uAsgO+0Is+3bfGlEqnLcDXH643CtwSFOEqV0shbFo3c7cG jLyD5/Qc5r1MDImCkYc7pb9oRBzjVkxYvlSFa2al2ASW2vxi1qUnDYU92i7Oe+HHpOAaQaFX eDyxQCqNnyImCDtbkXAeTmaRnJ7RFvN0Bz2pGAiYhIDo7iak1pIZtUhfOmQHaLEfEMUA4nBL TJNk9bsXZgF9rXnD7BODAHtW9P2nk4HUKeyje71qhNztMYTRpdkAEQEAAYkCHwQYAQIACQIb DAUCVN6/EgAKCRA3wWyTqCMjUTIpD/9p6vAq7MCUz2JpZONkvKNj5wRkWuhqkJd/WcWf1T+J oJMfRlhbuoWYQrz7e0enh2b5hPB6eCfY6WnbRIJaZFVyksw9x9RBFJT70/WZdYILg37WVT2a E7K5oLymOQb2ycFWjZOn4wqyBBR9IklC5uRECKuX6T/0efUdUxi6/QQlKzXg+mEFrnhVzWjE rD+suiiVT/zNh2/1kS+aSphkp2pzrt5qGEF2Op/VXX2QYajUAHYv7VezdtsP0HPUkVsKfcPj 7GnQuULW1jOSP5zmvtMIaS7Vyg0/Y6mY5mb+8T9iWchXJzOrMw8z0h7mOcCi+Y+uuFH491mY +mMMwBAJmMVa3YOkdV6WJ8mwtPchV3PhC5Xx9YdBzr5A46opIBfxk4qr8KXWIzCY9MDJWxh3 1GYA0vN3HF0UrHEjGoNm6Mfge9PTqJo1ERSpwzPuRrctNkiFvKqa4CnClJptzEnricBuKkUg onMWfHmHpMiWdbDs/RS10i02S3TNoYVj+TqNU+oac71ewqUzS7ck6Dn2OpoT8bDbGvHlN4Ki gsIF6s/bZIN2RnyFE8npuhooqXhfPETBK7C/CxkXaHJdRY5FIm8FySVESRtQKsgGEp1V89+Z n2uT/LLsU0pv4JpUEKI5ItFjdfnjxaSuuPO45cltSlXpspebUOM1XTs+PJqIqnL37A== To: fscd.conference at dcc.fc.up.pt, cl-isabelle-users at lists.cam.ac.uk, types-announce at lists.seas.upenn.edu, rewriting at ens-lyon.fr, ProofTheory at Lists.Bath.Ac.UK, appsem at lists.tcs.ifi.lmu.de, coq-club at inria.fr, caml-list at inria.fr, termtools at lists.rwth-aachen.de, cade at itu.dk, categories at mta.ca, finite-model-theory at lists.rwth-aachen.de, lfcs-interest at inf.ed.ac.uk, linear at cs.stanford.edu, GAMES at lists.rwth-aachen.de, eutypes at cs.ru.nl, theorem-provers at ai.mit.edu, theory-logic at CS.CMU.EDU, agda at lists.chalmers.se, asl at vassar.edu, las-lics at lists.tu-berlin.de, types at lists.chalmers.se, logic at math.uni-bonn.de, aprove at i2.informatik.rwth-aachen.de, ttt2 at informatik.uibk.ac.at, pplv at cs.ucl.ac.uk, nvti-list at cwi.nl, clap at groupes.renater.fr, pvs-announce at csl.sri.com, relmics-l at mcmaster.ca Message-ID: <35548689-6a9b-a5bb-4bdb-8d9d8aaeeee5 at dcs.bbk.ac.uk> Date: Wed, 9 Dec 2020 13:48:09 +0000 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Language: en-GB Content-Transfer-Encoding: 7bit X-Scanned-By: MIMEDefang 2.84 on 193.61.29.4 X-Mailman-Approved-At: Thu, 10 Dec 2020 11:52:58 +0000 Subject: [isabelle] FSCD 2021: Third Call for Workshop Proposals - Extended Deadline: 20 Dec 2020 X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 09 Dec 2020 13:49:16 -0000 -------------------------------------------------------------- Call for Workshop Proposals FSCD 2021 - Extension 20th December 2020 - https://fscd2021.dc.uba.ar Buenos Aires, Argentina Main Conference: 19-22 July 2021 Workshops: 17-18 and 23-24 July 2021 -------------------------------------------------------------- FSCD 2021 will be the sixth edition of the International Conference on Formal Structures for Computation and Deduction. Due to the Covid 19 pandemic situation, the 2021 edition of FSCD and its satellite workshops will be held online. We invite proposals for workshops, tutorials or other satellite events, on any topic related to formal structures in computation, deduction and automated reasoning, from theoretical foundations to tools and applications. Satellite events will take place online on the 17-18 and 23-24 July, before and after the main conference (19-22 July). It is expected that satellite events would run for 1 or 2 days, and be open to participants of parallel events. PROPOSALS -------------------- Proposals must be limited to three pages and should be submitted via EasyChair https://easychair.org/conferences/?conf=fscd2021 (Workshops track) Each proposal should consist of the following two parts. 1) A description part including: - a short scientific justification of the proposed topic, Its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant); - a brief description (up to 120 words) of the event for the website and publicity material. 2) An organisational part including: - contact information for the workshop organisers; - name of the organiser in the role of FSCD Workshops Scheduling Committee member (*); - estimate of the number of workshop participants; - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.) - potential invited speakers; - procedures for selecting papers and participants; - tentative schedule for paper submission and notification of acceptance; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from one day to two days); - preferred period (pre, or post main conference); - any other special requirements. (*) The FSCD Workshops Scheduling Committee will include one of the organisers of each accepted workshop and have the role to concoct a scientifically coherent program of all workshops mitigating superpositions of connected talks. This organisational effort will require that each workshop finalise their selection of talks and invited speakers within a common pertinent deadline to be defined so that possible overlaps can be minimised. Please, consider this when preparing the tentative schedule of your workshop proposal. The Organising Committee of FSCD will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs and availability of space and facilities. The organisers of satellite events are expected to create and maintain a website for the event; handle paper selection, reviewing and acceptance; draw up a tentative programme of talks; advertise their event though specialist mailing lists; prepare the informal pre-proceedings (if applicable) in a timely fashion; and arrange any post-proceedings. Some amount of financial support may be offered to workshops, depending on the number of participants. The FSCD Organising Committee will handle promotion of the event on the main conference website; integration of the event's programme into the overall timetable; registration of participants; arrangement of an appropriate virtual meeting room and technical support will be provided by the FSCD organising committee. IMPORTANT DATES -------------------- Submission of workshop proposals: 20 December, 2020 - Extended - Notification of success of proposals: 30 December, 2020 -------------------- Best regards, Carlos Lopez Pombo, Mauricio Ayala-Rincon FSCD 2021 Workshop Chairs From mihaela.rozman at tuwien.ac.at Thu Dec 10 14:40:49 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:45400) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1knN7h-000292-KY (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Thu, 10 Dec 2020 14:40:49 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884238 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [128.130.30.71 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 HTML_MESSAGE BODY: HTML included in message X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta1.cl.cam.ac.uk ([128.232.0.57]:57201) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1knN7g-000Jfl-S1 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Thu, 10 Dec 2020 14:40:49 +0000 Received: from ppsw-31.csi.cam.ac.uk ([2001:630:212:8::e:f31]) by mta1.cl.cam.ac.uk with esmtp (Exim 4.90_1) (envelope-from ) id 1knN7g-0000Am-Jg for isabelle-users at cl.cam.ac.uk; Thu, 10 Dec 2020 14:40:48 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884238 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [128.130.30.71 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 HTML_MESSAGE BODY: HTML included in message X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from secgw1.intern.tuwien.ac.at ([128.130.30.71]:34464) by ppsw-31.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.147]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1knN7f-000HM6-LD (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Thu, 10 Dec 2020 14:40:48 +0000 Received: from totemomail (localhost [127.0.0.1]) by secgw1.intern.tuwien.ac.at (8.14.7/8.14.7) with ESMTP id 0BAEekUL018281 for ; Thu, 10 Dec 2020 15:40:46 +0100 Received: from localhost ([127.0.0.1]) by totemomail (Totemo SMTP Server) with SMTP ID 533 for ; Thu, 10 Dec 2020 15:40:46 +0100 (CET) Received: from edge13b.intern.tuwien.ac.at (edge13b.intern.tuwien.ac.at [IPv6:2001:629:1005:30::67]) by secgw1.intern.tuwien.ac.at (8.14.7/8.14.7) with ESMTP id 0BAEek6s018274 (version=TLSv1/SSLv3 cipher=ECDHE-RSA-AES256-SHA384 bits=256 verify=FAIL) for ; Thu, 10 Dec 2020 15:40:46 +0100 Received: from mbx13e.intern.tuwien.ac.at (2001:629:1005:30::65) by edge13b.intern.tuwien.ac.at (2001:629:1005:30::67) with Microsoft SMTP Server (TLS) id 15.0.1497.2; Thu, 10 Dec 2020 15:40:46 +0100 Received: from mbx13b.intern.tuwien.ac.at (2001:629:1005:30::62) by mbx13e.intern.tuwien.ac.at (2001:629:1005:30::65) with Microsoft SMTP Server (TLS) id 15.0.1497.2; Thu, 10 Dec 2020 15:40:46 +0100 Received: from mbx13b.intern.tuwien.ac.at ([fe80::f0e9:7c2:196e:5846]) by mbx13b.intern.tuwien.ac.at ([fe80::f0e9:7c2:196e:5846%20]) with mapi id 15.00.1497.008; Thu, 10 Dec 2020 15:40:46 +0100 From: "Rozman, Mihaela" To: "isabelle-users at cl.cam.ac.uk" Thread-Topic: Invitation to celebrate the World Logic Day digitally - 14 January 2021 - Ambassadors of Logic and public Vienna Logic Day Lecture Thread-Index: AQHWzuacY1sGNfNsJkODPLcMnqVRHKnwL/9EgAABbo6AACtAVoAAAId3gAAAZL6AAAATOoAAAFrtgAAAtMOAAADE7oAAAKIYgAAAcbqAAADTsoAAASECgAAAVkWAAABDW4AAAKVdgAAAXniAAADSNoAAAJaqgAAAsimAAACHTIAAAE+V Date: Thu, 10 Dec 2020 14:40:45 +0000 Message-ID: <1607611244639.15302 at tuwien.ac.at> References: <1607599369858.53819 at tuwien.ac.at>, <1607599465850.57543 at tuwien.ac.at>, <1607599726151.25463 at tuwien.ac.at>, <1607609014213.91058 at tuwien.ac.at>, <1607609127663.94110 at tuwien.ac.at>, <1607609210451.95766 at tuwien.ac.at>, <1607609228102.31652 at tuwien.ac.at>, <1607609303172.44132 at tuwien.ac.at>, <1607609454920.24271 at tuwien.ac.at>, <1607609618061.69080 at tuwien.ac.at>, <1607609754453.25371 at tuwien.ac.at>, <1607609849778.67989 at tuwien.ac.at>, <1607610026889.21552 at tuwien.ac.at>, <1607610270104.36065 at tuwien.ac.at>, <1607610340353.72380 at tuwien.ac.at>, <1607610395649.66189 at tuwien.ac.at>, <1607610542553.68908 at tuwien.ac.at>, <1607610613392.85833 at tuwien.ac.at>, <1607610789942.32111 at tuwien.ac.at>, <1607610918422.81880 at tuwien.ac.at>, <1607611066108.21473 at tuwien.ac.at>, <1607611181220.92276 at tuwien.ac.at> In-Reply-To: <1607611181220.92276 at tuwien.ac.at> Accept-Language: en-GB, de-AT, en-US Content-Language: en-GB X-MS-Has-Attach: X-MS-TNEF-Correlator: x-ms-exchange-transport-fromentityheader: Hosted x-originating-ip: [80.110.121.43] Content-Type: multipart/alternative; boundary="_000_160761124463915302tuwienacat_" MIME-Version: 1.0 X-debug-header: local_aliases has suffix X-Mailman-Approved-At: Fri, 11 Dec 2020 09:23:48 +0000 Subject: [isabelle] Invitation to celebrate the World Logic Day digitally - 14 January 2021 - Ambassadors of Logic and public Vienna Logic Day Lecture X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 10 Dec 2020 14:40:49 -0000 --_000_160761124463915302tuwienacat_ Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Dear colleagues, dear friends of logic, On 14 January 2021, you are cordially invited to celebrate the World Logic = Day digitally with the community from the city of Kurt G=F6del, Ludwig Witt= genstein, and the Vienna Circle. The Vienna Center for Logic and Algorithms at Vienna University of Technolo= gy (VCLA at TU Wien) represents six research groups celebrating the World L= ogic Day 2021 (WLD) with: ---------------------------------------------------------- Vienna World Logic Day Lecture ---------------------------------------------------------- Vienna World Logic Day Lecture with Prof. Georg Gottlob on the future of lo= gic in the world shaped by Artificial intelligence Date: 14 January 2021 Time: 8am PST | 11am EST | 1pm GMT-3 | 5pm CET Digital venue: Zoom or YouTube ---------------------------------------------------------- Ambassadors of Logic ---------------------------------------------------------- We asked renowned logicians from the fields of computer science, philosophy= , mathematics, artificial intelligence to provide us with short statements = on the WLD. This is what they have to say: https://logicday.vcla.at ---------------------------------------------------------- Celebrating World Logic Day 2021 around the globe ---------------------------------------------------------- We are featuring events celebrating World Logic Day 2021 around the globe. = Send us an email, and we will include you on our website. Additionally, if = you are organising an event and wish to be listed in the official list of t= he World Logic Day 2021 events and use the official WLD logo in your announ= cements, please submit your event as listed on the website of the WLD 2021. UNESCO proclaimed World Logic Day in 2019, in association with the Internat= ional Council for Philosophy and Human Sciences (CIPSH), to enhance public = understanding of logic and its implications for science, technology and inn= ovation. "In the twenty-first century - indeed, now more than ever - the di= scipline of logic is a particularly timely one, utterly vital to our societ= ies and economies. Computer science and information and communications tech= nology, for example, are rooted in logical and algorithmic reasoning." - Au= drey Azoulay, Director General of UNESCO ---------------------------------------------------------- Free access and non-obligatory registration on the website ---------------------------------------------------------- Please visit the website of Vienna World Logic Day at: https://logicday.vcl= a.at/ --_000_160761124463915302tuwienacat_ Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable

Dear colleagues, dear friends of logic,

On 14 January 2021, you are cordially invited to celebrate the World Log= ic Day digitally with the community from the city of Kurt G=F6del, Ludwig W= ittgenstein, and the Vienna Circle.

The Vienna Center for Logic and Algorithms at Vienna University of Technolo= gy (VCLA at TU Wien) represents six research groups celebrating the World L= ogic Day 2021 (WLD) with:

----------------------------------------------------------

Vienna World Logic Day Lecture

----------------------------------------------------------

Vienna World Logic Day Lecture with Prof. Georg Gottlob on the future of= logic in the world shaped by Artificial intelligence
Date: 14 January 2021
Time: 8am PST | 11am EST | 1pm GMT-3 | 5pm CET
Digital venue: Zoom or YouTube

----------------------------------------------------------

Ambassadors of Logic

----------------------------------------------------------

We asked renowned logicians from the fields of computer science, philoso= phy, mathematics, artificial intelligence to provide us with short statemen= ts on the WLD.
This is what they have to say: https:/= /logicday.vcla.at

----------------------------------------------------------

Celebrating World Logic Day 2021 around the globe

----------------------------------------------------------
We are featuring events celebrating World Logic Day 2021 around the globe. = Send us an email, and we will include you on our website. Additionally, if = you are organising an event and wish to be listed in the official list of t= he World Logic Day 2021 events and use the official WLD logo in your announcements, please submit your event = as listed on the website of the WLD 2021.

UNESCO proclaimed World Logic Day in 2019, in association with the Internat= ional Council for Philosophy and Human Sciences (CIPSH), to enhance public = understanding of logic and its implications for science, technology and inn= ovation. "In the twenty-first century – indeed, now more than ever – the discipline of logic is a pa= rticularly timely one, utterly vital to our societies and economies. Comput= er science and information and communications technology, for example, are = rooted in logical and algorithmic reasoning." — Audrey Azoulay, Director General of UNESCO

----------------------------------------------------------
Free access and non-obligatory registration on the website

----------------------------------------------------------
Please visit the website of Vienna World Logic Day at: https://logicday.vcla.at/

--_000_160761124463915302tuwienacat_-- From lhansen at uni-bremen.de Thu Dec 10 15:35:59 2020 Received: from ppsw-40.csi.cam.ac.uk ([131.111.8.140]:43258) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1knNz5-0005LT-Ef (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Thu, 10 Dec 2020 15:35:59 +0000 X-Cam-SpamDetails: score -2.6 from SpamAssassin-3.4.4-1884238 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [134.102.50.17 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H4 RBL: Very Good reputation (+4) * [134.102.50.17 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from gabriel-vm-2.zfn.uni-bremen.de ([134.102.50.17]:33448) by ppsw-40.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.148]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1knNz4-0006Mi-lh (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Thu, 10 Dec 2020 15:35:59 +0000 Received: from [192.168.178.5] (dslb-178-012-019-059.178.012.pools.vodafone-ip.de [178.12.19.59]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by gabriel-vm-2.zfn.uni-bremen.de (Postfix) with ESMTPSA id 4CsJ0Z34CnzygQ for ; Thu, 10 Dec 2020 16:35:58 +0100 (CET) References: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> To: cl-isabelle-users at lists.cam.ac.uk From: Leon Hansen X-Forwarded-Message-Id: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> Message-ID: <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> Date: Thu, 10 Dec 2020 16:35:57 +0100 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 In-Reply-To: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit X-Mailman-Approved-At: Fri, 11 Dec 2020 09:23:48 +0000 Subject: [isabelle] Question regarding nitpick X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 10 Dec 2020 15:35:59 -0000 Hello everybody, I am currently writing my master thesis and I am trying to fetch entries from a list that fulfil some properties. Similar to a query on a database or an ontology. My first approach looked like this: datatype room = LivingRoom | Kitchen | SleepingRoom consts connectedRooms:: "room ⇒ room ⇒ bool" axiomatization where a1: "connectedRooms LivingRoom Kitchen" lemma patheval2: "connectedRooms X SleepingRoom" nitpick[satisfy,show_consts,user_axioms] oops In this case nitpick answers "X = LivingRoom" even though that is not correct. What can i do about that? My other approach was to avoid axiomatisation completely and use datatypes like this: datatype ID = NewID nat datatype Thing = Bed (height: nat) ID definition bed1 where "bed1 ≡ Bed 2 (NewID 1)" definition bed2 where "bed2 ≡ Bed 8 (NewID 3)" definition bed3 where "bed3 ≡ Bed 2 (NewID 5)" definition bedList where "bedList ≡ [bed1, bed2, bed3]" lemma "List.filter (%c::Thing. ∃x. c = (Bed 2 (NewName x))) bedList = res" nitpick sorry However this becomes very slow for larger lists. Is there a way to do this more efficiently? Kind regards Leon Hansen From john_hughes at brown.edu Fri Dec 11 12:10:58 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:54668) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1knhGE-0004TI-1G (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 11 Dec 2020 12:10:58 +0000 X-Cam-SpamDetails: score -0.1 from SpamAssassin-3.4.4-1884238 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.208.54 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.208.54 listed in wl.mailspike.net] * 0.0 HTML_MESSAGE BODY: HTML included in message X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-ed1-f54.google.com ([209.85.208.54]:46764) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1knhGD-000OUH-QZ (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 11 Dec 2020 12:10:58 +0000 Received: by mail-ed1-f54.google.com with SMTP id b73so9069614edf.13 for ; Fri, 11 Dec 2020 04:10:57 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:references:in-reply-to:from:date :message-id:subject:to:cc; bh=jSA4PFMnNk4KiwHzuYsuRYA4HqcDPYAbrRr3RJP9Ano=; b=ucVBcKOjQPGW+4b0A7IQqj8HqebGwjYTmJWrI8+IQHheS3h9T3JUYyTxHr+nWY4Ufn U+geIOawgBjQKx731nyzGlE1ujIJrTzM3aCywST+GyiVfIs/u13VbKgmdHtjSSdKieSe 2PzJCm7ngcJ85RomrLQf1xP3bLx24HwMSCoQRLp+r34776IQA/s2zEhS8+EHNQP9YlJR zfn+N1kHQJdPuRtS9CyUrM2J9AmbalIGKnOy272/g580rtya5br7SRZm/K+ZTCntQirj Wg1AaDYCK5cNexSL4ZId+DZoOuhEMARmNuo+Pb30DTAQhBxRTyexrYNdhLeuhfX6eldA ZV9Q== X-Gm-Message-State: AOAM532jxGSdX3FgdZxdB2pETLYfeu6kPyxdL7foK2tpc3lsZKeWqURy k+M71ot44F7Yi0NbmiHI8Du5Wz5nbSwT5VGMrtge9Q== X-Google-Smtp-Source: ABdhPJzfwPJ1bKKCwUSO0Z6SYcdnjcARb3GSphned0X4MaJzsbUDOiBHFvrtcJpZ5N53CF6fwCc7gmhWOZ7jx7hvdWQ= X-Received: by 2002:a05:6402:404:: with SMTP id q4mr11758311edv.295.1607688656817; Fri, 11 Dec 2020 04:10:56 -0800 (PST) MIME-Version: 1.0 References: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> In-Reply-To: <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> From: "John F. Hughes" Date: Fri, 11 Dec 2020 07:10:45 -0500 Message-ID: To: Leon Hansen Content-Type: multipart/alternative; boundary="0000000000004caee405b62f2f5b" Cc: Cl-isabelle Users Subject: Re: [isabelle] Question regarding nitpick X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 11 Dec 2020 12:10:58 -0000 --0000000000004caee405b62f2f5b Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable I believe that the problem here is that you've specified what "connectedRooms" does *only* when applied to LivingRoom and Kitchen, but have not specified its value on any other pair of rooms. Nitpick says "Hey, assigning "connectedRooms LivingRoom SleepingRoom" to be "true" is consistent with all the axioms. I guess I'm done!" So axiom 1 needs to be much richer --- either a complete enumeration of the 9 possibilities, or something with an "if" that says "if we're in this one special case, then true; otherwise false." NB: You could additionally specify a symmetry axiom --- connectedRooms a b =3D> connectedRooms b a [I'm forgetting the correct syntax here] and then safely have an enumeration of only 6 items instead of all 9. -John On Fri, Dec 11, 2020 at 4:24 AM Leon Hansen wrote: > Hello everybody, > > I am currently writing my master thesis and I am trying to fetch entries > from a list that fulfil some properties. Similar to a query on a > database or an ontology. > > My first approach looked like this: > > datatype room =3D LivingRoom | Kitchen | SleepingRoom > consts connectedRooms:: "room =E2=87=92 room =E2=87=92 bool" > axiomatization where > a1: "connectedRooms LivingRoom Kitchen" > > lemma patheval2: "connectedRooms X SleepingRoom" > nitpick[satisfy,show_consts,user_axioms] oops > > In this case nitpick answers "X =3D LivingRoom" even though that is not > correct. > > What can i do about that? > > My other approach was to avoid axiomatisation completely and use > datatypes like this: > > datatype ID =3D NewID nat > datatype Thing =3D Bed (height: nat) ID > definition bed1 where > "bed1 =E2=89=A1 Bed 2 (NewID 1)" > definition bed2 where > "bed2 =E2=89=A1 Bed 8 (NewID 3)" > definition bed3 where > "bed3 =E2=89=A1 Bed 2 (NewID 5)" > definition bedList where > "bedList =E2=89=A1 [bed1, bed2, bed3]" > lemma "List.filter (%c::Thing. =E2=88=83x. c =3D (Bed 2 (NewName x))) bed= List =3D > res" nitpick sorry > > However this becomes very slow for larger lists. Is there a way to do > this more efficiently? > > > Kind regards > > Leon Hansen > > > --0000000000004caee405b62f2f5b Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
I believe that the problem here is that you've specifi= ed what "connectedRooms" does only when applied to = LivingRoom and Kitchen, but have not specified its value on any other pair = of rooms. Nitpick says "Hey, assigning "connectedRooms LivingRoom= SleepingRoom" to be "true" is consistent with all the axiom= s. I guess I'm done!"=C2=A0

So axiom 1 needs to= be much richer --- either a complete enumeration of the 9 possibilities, o= r something with an "if" that says "if we're in this one= special case, then true; otherwise false."=C2=A0

=
NB: You could additionally specify a symmetry axiom ---

=
connectedRooms a b =3D> connectedRooms b a=C2=A0 =C2=A0[I'= ;m forgetting the correct syntax here]

and then sa= fely have an enumeration of only 6 items instead of all 9.=C2=A0
=
-John

On F= ri, Dec 11, 2020 at 4:24 AM Leon Hansen <lhansen at uni-bremen.de> wrote:
Hello everybody,

I am currently writing my master thesis and I am trying to fetch entries from a list that fulfil some properties. Similar to a query on a
database or an ontology.

My first approach looked like this:

datatype room =3D LivingRoom | Kitchen | SleepingRoom
consts connectedRooms:: "room =E2=87=92 room =E2=87=92 bool"
axiomatization where
=C2=A0=C2=A0a1: "connectedRooms LivingRoom Kitchen"

lemma patheval2: "connectedRooms X SleepingRoom"
nitpick[satisfy,show_consts,user_axioms] oops

In this case nitpick answers "X =3D LivingRoom" even though that = is not
correct.

What can i do about that?

My other approach was to avoid axiomatisation completely and use
datatypes like this:

datatype ID =3D NewID nat
datatype Thing =3D Bed (height: nat) ID
definition bed1 where
"bed1 =E2=89=A1 Bed 2 (NewID 1)"
definition bed2 where
"bed2 =E2=89=A1 Bed 8 (NewID 3)"
definition bed3 where
"bed3 =E2=89=A1 Bed 2 (NewID 5)"
definition bedList where
"bedList =E2=89=A1 [bed1, bed2, bed3]"
lemma "List.filter (%c::Thing. =E2=88=83x. c =3D (Bed 2 (NewName x))) = bedList =3D
res" nitpick sorry

However this becomes very slow for larger lists. Is there a way to do
this more efficiently?

Kind regards

Leon Hansen

--0000000000004caee405b62f2f5b-- From lhansen at uni-bremen.de Fri Dec 11 12:24:13 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:52502) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1knhT3-0005M2-Cg (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 11 Dec 2020 12:24:13 +0000 X-Cam-SpamDetails: score -2.6 from SpamAssassin-3.4.4-1884238 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [134.102.50.17 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H4 RBL: Very Good reputation (+4) * [134.102.50.17 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 HTML_MESSAGE BODY: HTML included in message * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders * -0.0 NICE_REPLY_A Looks like a legit reply (A) X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from gabriel-vm-2.zfn.uni-bremen.de ([134.102.50.17]:45016) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1knhT2-000YgC-RL (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 11 Dec 2020 12:24:13 +0000 Received: from [192.168.178.5] (dslb-178-012-019-059.178.012.pools.vodafone-ip.de [178.12.19.59]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by gabriel-vm-2.zfn.uni-bremen.de (Postfix) with ESMTPSA id 4Csqhq2nHcz102J; Fri, 11 Dec 2020 13:24:11 +0100 (CET) To: "John F. Hughes" References: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> From: Leon Hansen Message-ID: <2d0f6324-a92c-f91f-2bc5-d56f951dc5f4 at uni-bremen.de> Date: Fri, 11 Dec 2020 13:24:09 +0100 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 In-Reply-To: Content-Type: multipart/alternative; boundary="------------F00A4F7BCE8C042C3A2B48B4" Cc: cl-isabelle-users at lists.cam.ac.uk Subject: Re: [isabelle] Question regarding nitpick X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 11 Dec 2020 12:24:13 -0000 This is a multi-part message in MIME format. --------------F00A4F7BCE8C042C3A2B48B4 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit I do have the reflexivity and transitivity in there already: axiomatization where refl: "connectedRooms x x" and trans: "connectedRooms x y ∧ connectedRooms y z ⟶ connectedRooms x z" I just shortend the example by a lot. For that reason it is not possible to list every possibility as well. I would need to add something like the "connectedRooms _ _ = False" that would work if it were a function and not an axiomatisation. -Leon Am 11.12.2020 um 13:10 schrieb John F. Hughes: > I believe that the problem here is that you've specified what > "connectedRooms" does /*only*/ when applied to LivingRoom and Kitchen, > but have not specified its value on any other pair of rooms. Nitpick > says "Hey, assigning "connectedRooms LivingRoom SleepingRoom" to be > "true" is consistent with all the axioms. I guess I'm done!" > > So axiom 1 needs to be much richer --- either a complete enumeration > of the 9 possibilities, or something with an "if" that says "if we're > in this one special case, then true; otherwise false." > > NB: You could additionally specify a symmetry axiom --- > > connectedRooms a b => connectedRooms b a [I'm forgetting the correct > syntax here] > > and then safely have an enumeration of only 6 items instead of all 9. > > -John > > > > > On Fri, Dec 11, 2020 at 4:24 AM Leon Hansen > wrote: > > Hello everybody, > > I am currently writing my master thesis and I am trying to fetch > entries > from a list that fulfil some properties. Similar to a query on a > database or an ontology. > > My first approach looked like this: > > datatype room = LivingRoom | Kitchen | SleepingRoom > consts connectedRooms:: "room ⇒ room ⇒ bool" > axiomatization where >   a1: "connectedRooms LivingRoom Kitchen" > > lemma patheval2: "connectedRooms X SleepingRoom" > nitpick[satisfy,show_consts,user_axioms] oops > > In this case nitpick answers "X = LivingRoom" even though that is not > correct. > > What can i do about that? > > My other approach was to avoid axiomatisation completely and use > datatypes like this: > > datatype ID = NewID nat > datatype Thing = Bed (height: nat) ID > definition bed1 where > "bed1 ≡ Bed 2 (NewID 1)" > definition bed2 where > "bed2 ≡ Bed 8 (NewID 3)" > definition bed3 where > "bed3 ≡ Bed 2 (NewID 5)" > definition bedList where > "bedList ≡ [bed1, bed2, bed3]" > lemma "List.filter (%c::Thing. ∃x. c = (Bed 2 (NewName x))) bedList = > res" nitpick sorry > > However this becomes very slow for larger lists. Is there a way to do > this more efficiently? > > > Kind regards > > Leon Hansen > > --------------F00A4F7BCE8C042C3A2B48B4 Content-Type: text/html; charset=utf-8 Content-Transfer-Encoding: 8bit
I do have the reflexivity and transitivity in there already:

axiomatization where
refl: "connectedRooms x x" and
trans: "connectedRooms x y ∧ connectedRooms y z ⟶ connectedRooms x z"

I just shortend the example by a lot. For that reason it is not possible to list every possibility as well.

I would need to add something like the "connectedRooms _ _ = False" that would work if it were a function and not an axiomatisation.

-Leon

Am 11.12.2020 um 13:10 schrieb John F. Hughes:

I believe that the problem here is that you've specified what "connectedRooms" does only when applied to LivingRoom and Kitchen, but have not specified its value on any other pair of rooms. Nitpick says "Hey, assigning "connectedRooms LivingRoom SleepingRoom" to be "true" is consistent with all the axioms. I guess I'm done!"

So axiom 1 needs to be much richer --- either a complete enumeration of the 9 possibilities, or something with an "if" that says "if we're in this one special case, then true; otherwise false."

NB: You could additionally specify a symmetry axiom ---

connectedRooms a b => connectedRooms b a [I'm forgetting the correct syntax here]

and then safely have an enumeration of only 6 items instead of all 9.

-John

On Fri, Dec 11, 2020 at 4:24 AM Leon Hansen <lhansen at uni-bremen.de> wrote:

Hello everybody,

I am currently writing my master thesis and I am trying to fetch entries
from a list that fulfil some properties. Similar to a query on a
database or an ontology.

My first approach looked like this:

datatype room = LivingRoom | Kitchen | SleepingRoom
consts connectedRooms:: "room ⇒ room ⇒ bool"
axiomatization where
  a1: "connectedRooms LivingRoom Kitchen"

lemma patheval2: "connectedRooms X SleepingRoom"
nitpick[satisfy,show_consts,user_axioms] oops

In this case nitpick answers "X = LivingRoom" even though that is not
correct.

What can i do about that?

My other approach was to avoid axiomatisation completely and use
datatypes like this:

datatype ID = NewID nat
datatype Thing = Bed (height: nat) ID
definition bed1 where
"bed1 ≡ Bed 2 (NewID 1)"
definition bed2 where
"bed2 ≡ Bed 8 (NewID 3)"
definition bed3 where
"bed3 ≡ Bed 2 (NewID 5)"
definition bedList where
"bedList ≡ [bed1, bed2, bed3]"
lemma "List.filter (%c::Thing. ∃x. c = (Bed 2 (NewName x))) bedList =
res" nitpick sorry

However this becomes very slow for larger lists. Is there a way to do
this more efficiently?

Kind regards

Leon Hansen

--------------F00A4F7BCE8C042C3A2B48B4-- From kutsia at risc.jku.at Mon Dec 14 07:37:09 2020 Received: from ppsw-31.csi.cam.ac.uk ([131.111.8.131]:47700) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1koiPt-0001F4-ER (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 14 Dec 2020 07:37:09 +0000 X-Cam-SpamDetails: score -0.1 from SpamAssassin-3.4.4-1884376 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from smtp2.risc.uni-linz.ac.at ([193.170.37.227]:47903) by ppsw-31.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.147]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1koiPs-000fEw-L3 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 14 Dec 2020 07:37:09 +0000 Received: from [10.128.9.95] (cm56-128-170.liwest.at [86.56.128.170]) (authenticated bits=0) by smtp2.risc.uni-linz.ac.at (8.14.4/8.14.4/Debian-8+deb8u2) with ESMTP id 0BE7b4H6031694 (version=TLSv1/SSLv3 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128 verify=NOT) for ; Mon, 14 Dec 2020 08:37:07 +0100 To: cl-isabelle-users at lists.cam.ac.uk From: Temur Kutsia Message-ID: <3f6bc952-e8f2-f7c2-e8cd-b99786c8b15c at risc.jku.at> Date: Mon, 14 Dec 2020 08:37:04 +0100 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Language: en-US Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Mon, 14 Dec 2020 11:01:01 +0000 Subject: [isabelle] Deadline extension: AMAI Special Issue on Theoretical and Practical Aspects of Unification X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 14 Dec 2020 07:37:09 -0000 Due to requests, the submission deadline for the special issue of the Annals of Mathematics and Artificial Intelligence (AMAI) on Theoretical and Practical Aspects of Unification has been extended to January 31st, 2021. ------------------------------------------------- Call for submissions Annals of Mathematics and Artificial Intelligence Special Issue on Theoretical and Practical Aspects of Unification ------------------------------------------------- SCOPE -------- In 2020, Annals of Mathematics and Artificial Intelligence (AMAI) celebrates its 30th anniversary. Over the years, the journal has promoted better understanding of the application of quantitative, combinatorial, logical, algebraic and algorithmic methods to artificial intelligence areas as diverse as decision support, automated deduction, reasoning, knowledge-based systems, machine learning, computer vision, robotics and planning. AMAI special issues are intended to be collections of original research papers reflecting the intersection of mathematics and a focussed discipline demonstrating how each has contributed greatly to the other. A further goal of the journal is to close the gaps between the fields even further. Papers should report on current research in the appropriate areas, as well as more retrospective papers in which progress has been ongoing over a period of time. The purpose of this special issue of AMAI is to promote research on theoretical and practical aspects of unification. Unification is concerned with the problem of making two terms equal, finding solutions for equations or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc. The special issue is related to the topics of the 34th International Workshop on Unification - UNIF 2020. Participants of the workshop, as well as other authors are invited to submit contributions. EXAMPLES OF TOPICS ------------------- This special issue focuses on advanced results on the topics of unification in a broad sense, which include, but are not limited to, the following: - Unification algorithms, calculi and implementations - Equational unification and unification modulo theories - Unification in modal, fuzzy, temporal and description logics - Anti-unification/generalization - Semi-unification - Narrowing - Matching problems - Unification in special theories - Higher-order unification - Combination problems - Constraint solving - Disunification - Complexity issues - Type checking and reconstruction - Admissibility of inference rules - Formalization of unification - Tools - Applications SUBMISSION ----------- This special issue welcomes original high-quality contributions that have been neither published in nor simultaneously submitted to any journals or refereed conferences. Submissions will be peer-reviewed using the standard refereeing procedure of the Annals of Mathematics and Artificial Intelligence. Submitted papers must be in English, prepared in LaTeX according to the guidelines of the journal: https://www.springer.com/journal/10472/submission-guidelines. PDF versions of papers should be uploaded at the submission page https://www.editorialmanager.com/amai by January 31, 2021. Please choose S704 - Unification - UNIF 2020 when you will be selecting the article type. GUEST EDITORS -------------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Andrew M. Marshall (University of Mary Washington, USA) FURTHER INFORMATION ------------------------------- Temur Kutsia Andrew M. Marshall From ballarin at in.tum.de Mon Dec 14 20:36:44 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:40918) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kouaK-0004oe-72 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 14 Dec 2020 20:36:44 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884376 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.159.0.8 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.159.0.8 listed in wl.mailspike.net] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-out1.in.tum.de ([131.159.0.8]:46550 helo=mail-out1.informatik.tu-muenchen.de) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kouaJ-000uww-Rp (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 14 Dec 2020 20:36:44 +0000 Received: from webmail.in.tum.de (localhost [IPv6:::1]) by vmrbg98.informatik.tu-muenchen.de (Postfix) with ESMTP id 91CA54021E for ; Mon, 14 Dec 2020 21:36:37 +0100 (CET) MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII; format=flowed Content-Transfer-Encoding: 7bit Date: Mon, 14 Dec 2020 21:36:37 +0100 From: Clemens Ballarin To: cl-isabelle-users Message-ID: X-Sender: ballarin at in.tum.de User-Agent: Roundcube Webmail/1.3.3 Subject: [isabelle] Debug facilities of locales X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 14 Dec 2020 20:36:44 -0000 Locales do not have many means for debugging a development. But even the tools that are available seem not as widely known as I thought. I would like to highlight two: * Method 'intro_locales'. Unlike its sibling 'unfold_locales' it does not descend into locale assumptions but leaves statements involving locale predicates in the goal state. This makes immediately clear which locale instances the goals originate from. While 'unfold_locales' is part of the default method of 'proof' and often invoked behind the scenes, 'intro_locales' needs to be invoked manually. * Attribute 'trace_locales'. This is a recent addition (Isabelle 2020). When set to 'true', prints the locale instances activated during roundup. This can be helpful when locale commands yield obscure errors due to conflicting syntax or for understanding local theories created by complex locale hierarchies. I have amended the Isar Reference Manual (development version) accordingly, so these hints will become part of the documentation. Clemens From mathias.fleury12 at gmail.com Wed Dec 16 08:52:41 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:34512) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kpSY5-0008M7-Gx (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 16 Dec 2020 08:52:41 +0000 X-Cam-SpamDetails: score -0.1 from SpamAssassin-3.4.4-1884447 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.208.50 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.208.50 listed in wl.mailspike.net] * 0.2 FREEMAIL_ENVFROM_END_DIGIT Envelope-from freemail username ends in * digit * [mathias.fleury12[at]gmail.com] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [mathias.fleury12[at]gmail.com] * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.0 NICE_REPLY_A Looks like a legit reply (A) X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-ed1-f50.google.com ([209.85.208.50]:40329) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kpSY4-000jRW-eb (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Wed, 16 Dec 2020 08:52:41 +0000 Received: by mail-ed1-f50.google.com with SMTP id h16so23951102edt.7 for ; Wed, 16 Dec 2020 00:52:40 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:subject:from:to:references:message-id:date :user-agent:mime-version:in-reply-to:content-transfer-encoding :content-language; bh=/YXve2i2P43G/S1+yUYENxgHWKPl8iPFqmCgQq7rtXg=; b=Hy6hhINFRyhSgxDvIRzKmmM8mDnevXSHbDLN7giSCQuPAGn+/1wjfWyLCGv5xmolX5 B8M6qeJQC9L3ALcOBeoJpUyYZYsUq475ObHpahwD0mLy7S56VGCZRJU1ZWhzX+jFqAgj I7jyMM5m3WTU97cqKFPZXa5gWHuZoIfXcOZCxtm/rutgF4M2g3ZbCLNiOpoOcAGwuqkZ 99t2LLp0hTxNWjpQW0JoORSuOJQ8GmQWjtkMd9IppgdYmhQWrgzFOLiqh/ZICJCQIXF0 ITUMTv0wYciz7IsB1C3tt6NNFZMSr/PJvMhrjetn0k2uwO5Gl4zkA02IT5/09x/KNCD4 I9Aw== X-Gm-Message-State: AOAM533NU8DSuGDIXK/2Tvf0JBcbt03+cmXXjXLgiVfAUAIQhMVseSoT t77mt6k1LG59gOtwqh3Su/tNJ7A0RA== X-Google-Smtp-Source: ABdhPJzAgW5QJupoQI+00PA+rjlLzihPzD8JyE/n5GOBPVVzjKL6K30VkKZIMPqPo1Lvbr1vCbhEjw== X-Received: by 2002:a05:6402:1d24:: with SMTP id dh4mr32596947edb.161.1608108759822; Wed, 16 Dec 2020 00:52:39 -0800 (PST) Received: from ?IPv6:2a02:1748:dd5e:5950:4f16:50b7:ca4e:54fd? ([2a02:1748:dd5e:5950:4f16:50b7:ca4e:54fd]) by smtp.gmail.com with ESMTPSA id k23sm888452ejs.100.2020.12.16.00.52.38 for (version=TLS1_3 cipher=TLS_AES_128_GCM_SHA256 bits=128/128); Wed, 16 Dec 2020 00:52:39 -0800 (PST) From: Mathias Fleury To: cl-isabelle-users at lists.cam.ac.uk References: <90cbccef-c731-d7c5-a364-740465150f96 at in.tum.de> <623009df-7ffb-ee55-f015-7b7b35426f70 at gmail.com> <024bd901-6a36-1d9c-8aa8-059e3fd2e6e4 at gmail.com> Message-ID: <35d53c06-0bca-c4cd-6862-c530c2bc52d7 at gmail.com> Date: Wed, 16 Dec 2020 09:52:38 +0100 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:78.0) Gecko/20100101 Thunderbird/78.6.0 MIME-Version: 1.0 In-Reply-To: <024bd901-6a36-1d9c-8aa8-059e3fd2e6e4 at gmail.com> Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Content-Language: en-US Subject: Re: [isabelle] Bug report Isabelle 2019 and Isabelle 2020 X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 16 Dec 2020 08:52:41 -0000 Hi all, the problem is now fixed (https://isabelle-dev.sketis.net/rISABELLEf9424ceea3c33538bd3e52a12d9f8225c8256738). Best, Mathias On 23/11/2020 11:12, Mathias Fleury wrote: > Hi all, > > Some explanation on the bug. The SMT-Lib format makes it possible to > write (_ bv4 9) to mean 4 :: 9 word. However, if the word does not > fit, like for 3 :: 1 word, it is not clear what this means. > > If the solver accepts it, it has to discard the leftover bits > (truncating the number). But the SMT-Lib format is not explicit about > that and CVC4 rejects the problem file. > > The solution is to generate 1:: 1 word (corresponding to _bv1 1) > instead of `3 :: 1 word` (corresponding to _bv3 1). > > > I am currently testing a fix for that. > > Mathias > > > > On 23/11/2020 09:14, Mathias Fleury wrote: >> Hi all, >> >> I had a look and the problems comes from the generated SMT file. CVC4 >> does not accept a type annotation in the generated problem (and >> returns a nice error message), while Z3 accepts it. >> >> I don't know enough about the SMT-lib format to know who is right, >> but I have asked experts to see which solver is wrong. >> >> >> Thanks for reporting, >> >> Mathias >> >> >> On 23/11/2020 08:48, Manuel Eberl wrote: >>> Just a hunch, did you get your Isabelle distribtion from the official >>> website or from a package repository (e.g. installed using apt, pacman, >>> etc.)? >>> >>> Manuel >>> >>> >>> On 23/11/2020 04:23, Peter Reitinger wrote: >>>> Hi again, >>>> >>>> maybe this helps... >>>> >>>> Here I could produce a crash in "cvc4" with modified Word_Examples: >>>> >>>> theory Word_Examples >>>>    imports Word_Bitwise >>>> begin >>>> (* commented previous lemmas out *) >>>> lemma "slice 3 (0b101111::6 word) = (0b101::3 word)" by simp >>>> (* BEGIN preitinger *) >>>> declare [[show_sorts]] >>>> lemma "takefill False (size (1::6 word) - (3::nat)) (to_bl (1::6 >>>> word)) >>>> = [False, False, False]" >>>>    apply sledgehammer >>>> >>>> Sledgehammering... >>>> /tmp/isabelle-peter/process3745657003709610034/bash_script3287864: >>>> Zeile >>>> 1: 6505 Abgebrochen (Speicherabzug geschrieben) >>>> /home/peter/isabelle/Isabelle2020/contrib/cvc4-1.5-5/x86_64-linux/cvc4 >>>> --full-saturate-quant --inst-when\=full-last-call --inst-no-entail >>>> --term-db-mode\=relevant --multi-trigger-linear --no-statistics >>>> --random-seed\=1 --lang\=smt2 --continued-execution --tlimit 9990 >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3287858 > >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3287860 2>&1 >>>> /tmp/isabelle-peter/process3745657003709610034/bash_script3292002: >>>> Zeile >>>> 1: 6520 Abgebrochen (Speicherabzug geschrieben) >>>> /home/peter/isabelle/Isabelle2020/contrib/cvc4-1.5-5/x86_64-linux/cvc4 >>>> --full-saturate-quant --inst-when\=full-last-call --inst-no-entail >>>> --term-db-mode\=relevant --multi-trigger-linear --no-statistics >>>> --random-seed\=1 --lang\=smt2 --continued-execution --tlimit 9845 >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3291998 > >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3292000 2>&1 >>>> /tmp/isabelle-peter/process3745657003709610034/bash_script3298144: >>>> Zeile >>>> 1: 6618 Abgebrochen (Speicherabzug geschrieben) >>>> /home/peter/isabelle/Isabelle2020/contrib/cvc4-1.5-5/x86_64-linux/cvc4 >>>> --full-saturate-quant --inst-when\=full-last-call --inst-no-entail >>>> --term-db-mode\=relevant --multi-trigger-linear --no-statistics >>>> --random-seed\=1 --lang\=smt2 --continued-execution --tlimit 3923 >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3298140 > >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3298142 2>&1 >>>> /tmp/isabelle-peter/process3745657003709610034/bash_script3298666: >>>> Zeile >>>> 1: 6626 Abgebrochen (Speicherabzug geschrieben) >>>> /home/peter/isabelle/Isabelle2020/contrib/cvc4-1.5-5/x86_64-linux/cvc4 >>>> --full-saturate-quant --inst-when\=full-last-call --inst-no-entail >>>> --term-db-mode\=relevant --multi-trigger-linear --no-statistics >>>> --random-seed\=1 --lang\=smt2 --continued-execution --tlimit 3827 >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3298662 > >>>> /tmp/isabelle-peter/process3745657003709610034/cache-io-3298664 2>&1 >>>> "e": Timed out >>>> "cvc4": The prover crashed >>>> "z3": Timed out >>>> "vampire": Timed out >>>> >>>> Am Sa., 21. Nov. 2020 um 13:02 Uhr schrieb Makarius >>>> >>> >: >>>> >>>>      On 21/11/2020 06:56, Peter Reitinger wrote: >>>>      > >>>>      > sorry for recently reporting just confusing behavior because of >>>>      > polymorphism as a bug. >>>>      > >>>>      > But this time, I am very sure to have observed a bug, if >>>> creation >>>>      of a memory >>>>      > dump characterizes a bug. ;-) >>>> >>>>      The "bug" terminology does not make much sense beyond a certain >>>>      complexity of >>>>      systems (or rather a multi-system compound like the Isabelle >>>>      ecosystem). You >>>>      do have a large space that is "inhabitable", but you also have >>>>      uncharted areas >>>>      where things don't work. >>>> >>>> >>>>      > First the screenshot: >>>>      > >>>>      > image.png >>>> >>>>      I recommend to copy paste actual source text and output, >>>> unless this >>>>      is a >>>>      problem of GUI rendering or interaction. >>>> >>>>      The relevant part of the error is this: >>>> >>>> /home/makarius/lib/Isabelle2020/contrib/z3-4.4.0pre-3/x86_64-linux/z3 >>>>      smt.random_seed\=1 smt.refine_inj_axioms\=false -T:10 -smt2 >>>> /tmp/isabelle-makarius/process1270985018603270244/cache-io-3287480 > >>>> /tmp/isabelle-makarius/process1270985018603270244/cache-io-3287482 >>>> 2>&1 >>>> >>>> >>>>      So this is a hard crash of the (rather old) version of z3 that we >>>>      are using. >>>> >>>>      There have been other z3 inconveniences before, but I guess we >>>> can't >>>>      upgrade >>>>      it easily. >>>> >>>>      Maybe an expert on the Isabelle/z3 can say more about the >>>> situation. >>>> >>>> >>>>      Makarius >>>> From j.c.blanchette at vu.nl Fri Dec 18 14:54:40 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:41230) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kqH9U-0001Qw-8Y (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 18 Dec 2020 14:54:40 +0000 X-Cam-SpamDetails: score -0.1 from SpamAssassin-3.4.4-1884543 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mailin.vu.nl ([130.37.164.73]:1122) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kqH9T-000hOo-RX (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 18 Dec 2020 14:54:40 +0000 Received: from pexch012b.vu.local (130.37.237.89) by mailin.vu.nl (130.37.164.73) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256) id 15.1.1979.3; Fri, 18 Dec 2020 15:54:39 +0100 Received: from jasminsinriambp.fritz.box (130.37.253.6) by PEXCH012b.vu.local (130.37.237.89) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256) id 15.1.1979.3; Fri, 18 Dec 2020 15:54:38 +0100 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 (Mac OS X Mail 13.4 $3608.80.23.2.2$) In-Reply-To: <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> Date: Fri, 18 Dec 2020 15:54:38 +0100 Content-Transfer-Encoding: quoted-printable Message-ID: References: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> To: Leon Hansen X-Mailer: Apple Mail (2.3608.80.23.2.2) X-Originating-IP: [130.37.253.6] X-ClientProxiedBy: pexch014b.vu.local (130.37.237.91) To PEXCH012b.vu.local (130.37.237.89) Cc: cl-isabelle-users at lists.cam.ac.uk Subject: Re: [isabelle] Question regarding nitpick X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list From: Jasmin Blanchette via Cl-isabelle-users Reply-To: Jasmin Blanchette List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 18 Dec 2020 14:54:40 -0000 Dear Leon, > My first approach looked like this: >=20 > datatype room =3D LivingRoom | Kitchen | SleepingRoom > consts connectedRooms:: "room =E2=87=92 room =E2=87=92 bool" > axiomatization where > a1: "connectedRooms LivingRoom Kitchen" >=20 > lemma patheval2: "connectedRooms X SleepingRoom" = nitpick[satisfy,show_consts,user_axioms] oops >=20 > In this case nitpick answers "X =3D LivingRoom" even though that is = not correct. Although it doesn't correspond to your expectations, Nitpick's behavior = is correct. Your "nitpick" command is asking for a model of the formula. = Nitpick finds one. In that model, "connectedRooms LivingRoom = SleepingRoom" is true. This is perfectly consistent with your = axiomatization. It is not *entailed* by the axiomatization, but it is = clearly consistent with it. If you want to find a value X such that "connectedRooms X SleepingRoom" = is provable -- in other words, a witness for X in "EX X. connectedRooms = X SleepingRoom", I'm afraid there's no tool that will reliably give you = that in Isabelle. The existential formula would be a candidate for = Sledgehammer, but in general you wouldn't get the witness out of the = proof. > Is there a way to do this more efficiently? The problem is that I don't clearly understand what "this" refers to. = I'm starting to suspect that your axiomatization above is wrong; you = probably also want to say "~ connectedRooms LivingRoom SleepingRoom" = etc., if you mean that these are not connected. (Otherwise, they'll be = connected in some models of the formulas and not in others.) Typically a better approach is to avoid low-level mechanisms such as = "consts" and "axiomatization" and instead rely on the definitional = mechanisms, like "inductive" (which is probably your best option here), = "fun", and "definition". With "inductive", what you don't explicitly = make true is automatically false, which is very convenient. You also = don't need to worry about models; there's only one model. I hope this helps. Cheers, Jasmin From lhansen at uni-bremen.de Sat Dec 19 10:02:52 2020 Received: from ppsw-40.csi.cam.ac.uk ([131.111.8.140]:39676) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kqZ4e-0005Fc-Lz (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sat, 19 Dec 2020 10:02:52 +0000 X-Cam-SpamDetails: score -1.0 from SpamAssassin-3.4.4-1884601 * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.7 RCVD_IN_DNSWL_LOW RBL: Sender listed at https://www.dnswl.org/, low * trust * [134.102.50.17 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H4 RBL: Very Good reputation (+4) * [134.102.50.17 listed in wl.mailspike.net] * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders * -0.0 NICE_REPLY_A Looks like a legit reply (A) X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from gabriel-vm-2.zfn.uni-bremen.de ([134.102.50.17]:33276) by ppsw-40.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.148]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kqZ4e-000oSc-jZ (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sat, 19 Dec 2020 10:02:52 +0000 Received: from [192.168.178.5] (dslb-178-012-019-059.178.012.pools.vodafone-ip.de [178.12.19.59]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by gabriel-vm-2.zfn.uni-bremen.de (Postfix) with ESMTPSA id 4CyhB151JhzyVW; Sat, 19 Dec 2020 11:02:49 +0100 (CET) To: Jasmin Blanchette References: <4ab088a7-23ae-6f41-e52e-84b33318f52e at uni-bremen.de> <1cabdf9d-af62-a3bd-40c8-30cb0cb939c4 at uni-bremen.de> From: Leon Hansen Message-ID: <94a5c20a-d716-3cf4-4fab-4ec2e341db17 at uni-bremen.de> Date: Sat, 19 Dec 2020 11:02:49 +0100 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.6.0 MIME-Version: 1.0 In-Reply-To: Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit Cc: cl-isabelle-users at lists.cam.ac.uk Subject: Re: [isabelle] Question regarding nitpick X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 19 Dec 2020 10:02:52 -0000 Dear Jasmin, thank you for your detailed response. > If you want to find a value X such that "connectedRooms X SleepingRoom" is provable -- in other words, a witness for X in "EX X. connectedRooms X SleepingRoom", I'm afraid there's no tool that will reliably give you that in Isabelle. The existential formula would be a candidate for Sledgehammer, but in general you wouldn't get the witness out of the proof. That confirmation is very helpful for me. I thought I was just doing it completely wrong. > The problem is that I don't clearly understand what "this" refers to. My goal is to embed knowledge from an owl ontology in an Isabelle theory and be able to retrieve it again in reasonable time. > Typically a better approach is to avoid low-level mechanisms such as "consts" and "axiomatization" and instead rely on the definitional mechanisms, like "inductive" (which is probably your best option here), "fun", and "definition". With "inductive", what you don't explicitly make true is automatically false, which is very convenient. You also don't need to worry about models; there's only one model. That is more or less what i did in my second approach where i used "datatype" and "definition" only. Thank you for the tip with "inductive". For small theories nitpick returns the requested information reliably and fast. For theories with a few hundred lines it was taking way to much time. I hoped there was a simple way to limit nitpicks search space and speed up the search for witnesses for X in "EX X. connectedRooms X SleepingRoom" for example. Kind regards, Leon From P.Achten at cs.ru.nl Fri Dec 18 16:00:09 2020 Received: from ppsw-40.csi.cam.ac.uk ([131.111.8.140]:43814) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kqIAr-0005Tc-4R (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 18 Dec 2020 16:00:09 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884543 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.174.16.143 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.174.16.143 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta1.cl.cam.ac.uk ([128.232.0.57]:57535) by ppsw-40.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.148]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1kqIAq-0009yC-jr (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Fri, 18 Dec 2020 16:00:09 +0000 Received: from ppsw-30.csi.cam.ac.uk ([2001:630:212:8::e:f30]) by mta1.cl.cam.ac.uk with esmtp (Exim 4.90_1) (envelope-from ) id 1kqIAq-0006Lm-2w for isabelle-users at cl.cam.ac.uk; Fri, 18 Dec 2020 16:00:08 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884543 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [131.174.16.143 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [131.174.16.143 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from smtp1.science.ru.nl ([131.174.16.143]:41178) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kqIAo-0009hG-fr (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Fri, 18 Dec 2020 16:00:08 +0000 Received: from [192.168.2.10] (84-84-201-162.fixed.kpn.net [84.84.201.162]) (authen=peter88) by smtp1.science.ru.nl (8.15.2/5.32) with ESMTPSA id 0BIG06Er007468 for ; Fri, 18 Dec 2020 17:00:06 +0100 To: isabelle-users at cl.cam.ac.uk From: Peter Achten Message-ID: <5ccbf634-ac5d-5e35-4b05-604a807f8473 at cs.ru.nl> Date: Fri, 18 Dec 2020 17:00:05 +0100 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.5.1 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Content-Language: en-GB X-debug-header: local_aliases has suffix X-Mailman-Approved-At: Sat, 19 Dec 2020 11:07:02 +0000 Subject: [isabelle] [TFPIE'21] Second Call For Papers: Trends in Functional Programming *in Education* 2021, 16 February 2021 (with Lambda Days 2021 & TFP 2021) X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 18 Dec 2020 16:00:09 -0000 -----------------------------------    TFPIE 2021 2nd Call for papers ----------------------------------- https://wiki.tfpie.science.ru.nl/TFPIE2021#TFPIE_2021 (February 16 2021, co-organized with TFP 2021 and Lambda Days 2021) Because of the covid pandemic, the events are online this year. The goal of the International Workshops on Trends in Functional Programming in Education is to gather researchers, professors, teachers, and all professionals that use or are interested in the use of functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas, and work in progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. TFPIE 2021 welcomes submissions in the above mentioned areas. This year many teaching programmes have had to make a rapid transition to online teaching, and we explicitly solicit papers that explore this area of teaching functional programming. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy - The pedagogy of teaching FP - FP and e-learning: MOOCs, automated assessment etc. - Best Lectures - more details below In addition to papers, we are requesting best lecture presentations. What's your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. The length of the presentation should be comparable to that of a paper. On top of the lecture itself, the presentation can also provide commentary on the lecture. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2021 After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Dates - Submission deadline: January 11 2021, Anywhere on Earth. - Notification: January 15 2021 - Workshop: February 16 2021 - Submission for formal review: April 20 2021, Anywhere on Earth. - Notification of full article: June 7 2021 - Camera ready: July 1st 2021 Program Committee - Peter Achten,    Radboud University, Netherlands (chair) - Edwin Brady,     University of St Andrews, UK - Laura Castro,    Universidade da Coruña, Spain - Stephen Chang,   University of Massachusetts Boston, USA - Youyou Cong,     Tokyo Institute of Technology, Japan - Matthew Flatt,   University of Utah, USA - Seth Fogarty,    Trinity University, USA - Alex Gerdes,     University of Gothenburg, Sweden - Gabriele Keller, Utrecht University, Netherlands - Prabhakar Ragde, University of Waterloo, Canada - Melinda Tóth,    Eötvös Loránd University, Budapest, Hungary Registration TFPIE is part of Lambda Days. Please visit the Lambda Days 2021 pages when registration information becomes available. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. Information on Lambda Days is available at https://www.lambdadays.org/lambdadays2021 Information on TFP         is available at http://tfp2021.org From Rene.Thiemann at uibk.ac.at Tue Dec 22 13:12:35 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:52404) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1krhSt-00019K-Ps (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 22 Dec 2020 13:12:35 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884673 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [138.232.1.142 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [138.232.1.142 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta1.cl.cam.ac.uk ([128.232.0.57]:56017) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1krhSt-0003ZE-d5 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 22 Dec 2020 13:12:35 +0000 Received: from ppsw-30.csi.cam.ac.uk ([2001:630:212:8::e:f30]) by mta1.cl.cam.ac.uk with esmtp (Exim 4.90_1) (envelope-from ) id 1krhSt-0003SA-1W for isabelle-users at cl.cam.ac.uk; Tue, 22 Dec 2020 13:12:35 +0000 X-Cam-SpamDetails: score -2.4 from SpamAssassin-3.4.4-1884673 * -2.3 RCVD_IN_DNSWL_MED RBL: Sender listed at https://www.dnswl.org/, * medium trust * [138.232.1.142 listed in list.dnswl.dnsbl.ja.net] * 0.0 RCVD_IN_MSPIKE_H3 RBL: Good reputation (+3) * [138.232.1.142 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 RCVD_IN_MSPIKE_WL Mailspike good senders X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from lmr1.uibk.ac.at ([138.232.1.142]:53408 helo=smtp.uibk.ac.at) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1krhSm-0003NW-ev (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Tue, 22 Dec 2020 13:12:34 +0000 Received: from exchange.uibk.ac.at (xmbx6.uibk.ac.at [138.232.2.158]) by smtp.uibk.ac.at (8.14.4/8.14.4/F1) with ESMTP id 0BMDC16l002072 (version=TLSv1/SSLv3 cipher=AES256-GCM-SHA384 bits=256 verify=FAIL) for ; Tue, 22 Dec 2020 14:12:01 +0100 Received: from xmbx11.uibk.ac.at (138.232.2.173) by xmbx6.uibk.ac.at (138.232.2.158) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256) id 15.1.2044.4; Tue, 22 Dec 2020 14:12:01 +0100 Received: from xmbx11.uibk.ac.at ([fe80::a59a:6f10:b35:eede]) by xmbx11.uibk.ac.at ([fe80::a59a:6f10:b35:eede%3]) with mapi id 15.01.2044.012; Tue, 22 Dec 2020 14:12:01 +0100 From: =?utf-8?B?VGhpZW1hbm4sIFJlbsOp?= To: isabelle-users Thread-Topic: New in the AFP: Topological semantics for paraconsistent and paracomplete logics Thread-Index: AQHW2GQJAI8Q7rV1ZU2ZEFDaquRVzw== Date: Tue, 22 Dec 2020 13:12:01 +0000 Message-ID: <7CC01FFC-823B-47BF-B2E5-A8A83407164A at uibk.ac.at> Accept-Language: de-DE, de-AT, en-US Content-Language: en-US X-MS-Has-Attach: X-MS-TNEF-Correlator: x-originating-ip: [138.232.2.105] Content-Type: text/plain; charset="utf-8" Content-ID: <5E7ECF389841824D96C9D135B933504D at exchange.uibk.ac.at> Content-Transfer-Encoding: base64 MIME-Version: 1.0 X-Spam-Score: () -4.9 FROM_EXCESS_BASE64,FROM_NET_2,RCV_SMTP_UIBK X-Scanned-By: MIMEDefang 2.84 at uibk.ac.at X-debug-header: local_aliases has suffix Subject: [isabelle] New in the AFP: Topological semantics for paraconsistent and paracomplete logics X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 22 Dec 2020 13:12:35 -0000 RGVhciBhbGwsDQoNCknigJlkIGxpa2UgdG8gYW5ub3VuY2UgYSBuZXcgQUZQIGVudHJ5IGJ5IERh dmlkIEZ1ZW5tYXlvci4NCg0KVG9wb2xvZ2ljYWwgc2VtYW50aWNzIGZvciBwYXJhY29uc2lzdGVu dCBhbmQgcGFyYWNvbXBsZXRlIGxvZ2ljcw0KDQpBYnN0cmFjdDoNCg0KV2UgaW50cm9kdWNlIGEg Z2VuZXJhbGl6ZWQgdG9wb2xvZ2ljYWwgc2VtYW50aWNzIGZvciBwYXJhY29uc2lzdGVudCBhbmQN CnBhcmFjb21wbGV0ZSBsb2dpY3MgYnkgZHJhd2luZyB1cG9uIGVhcmx5IHdvcmtzIG9uIHRvcG9s b2dpY2FsIEJvb2xlYW4gYWxnZWJyYXMNCihjZi4gd29ya3MgYnkgS3VyYXRvd3NraSwgWmFyeWNr aSwgTWNLaW5zZXkgJiBUYXJza2ksIGV0Yy4pLiBJbiBwYXJ0aWN1bGFyLCB0aGlzDQp3b3JrIGV4 ZW1wbGFyaWx5IGlsbHVzdHJhdGVzIHRoZSBzaGFsbG93IHNlbWFudGljYWwgZW1iZWRkaW5ncyBh cHByb2FjaCAoU1NFIFsxXSkNCmVtcGxveWluZyB0aGUgcHJvb2YgYXNzaXN0YW50IElzYWJlbGxl L0hPTC4gQnkgbWVhbnMgb2YgdGhlIFNTRSB0ZWNobmlxdWUNCndlIGNhbiBlZmZlY3RpdmVseSBo YXJuZXNzIHRoZW9yZW0gcHJvdmVycywgbW9kZWwgZmluZGVycyBhbmQgJ2hhbW1lcnMnIGZvcg0K cmVhc29uaW5nIHdpdGggcXVhbnRpZmllZCBub24tY2xhc3NpY2FsIGxvZ2ljcy4gDQoNCg0KWzFd OiBodHRwOi8vZHguZG9pLm9yZy8xMC4xMDA3L3MxMTc4Ny0wMTItMDA1Mi15DQoNCg0KU2VlIGh0 dHBzOi8vd3d3LmlzYS1hZnAub3JnL2VudHJpZXMvVG9wb2xvZ2ljYWxfU2VtYW50aWNzLmh0bWwg Zm9yIG1vcmUgZGV0YWlscy4NCg0KDQpFbmpveSBhbmQgaGF2ZSBhIG5pY2UgWG1hcy10aW1lLA0K UmVuw6k= From andrei.h.popescu at gmail.com Tue Dec 22 18:37:06 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:47718) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1krmWw-0005CZ-Bd (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 22 Dec 2020 18:37:06 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884673 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.219.51 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.219.51 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [andrei.h.popescu[at]gmail.com] * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-qv1-f51.google.com ([209.85.219.51]:37884) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1krmWv-0006Ze-RT (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 22 Dec 2020 18:37:06 +0000 Received: by mail-qv1-f51.google.com with SMTP id l7so6429540qvt.4 for ; Tue, 22 Dec 2020 10:37:05 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:from:date:message-id:subject:to:cc :content-transfer-encoding; bh=kQj+1oY7LXp5Jqv4W7QQrdLFSQGihCCls/ZiG3x5gxk=; b=Z/Frl3iOiKjLtL2Z7rXaNFVq1wmP2hKIP3uQs7uNRGzzwo7vhSgqeE3KmPwIC64FGV IV6JPnPYQzlPyak8vQPm6iIaLbaKLsoueIla+Rr/NpieaNED38wSFop4Sh915ik8cOFh thPjS4Y0wcxU1V5kA9bFBYiUtKbDQsxX+zzR7UNy92V//jv8CjHEjAgZ6iV0SPblx/Od 8yKVHgawf0ph2nArkv3eREKxN6iaFr/iuzDFdOIkjCT0985iI44hwDajC9LHbSjhr19j NdUA214Z+Ws+iv54fb/dnu0Pv0vEE61r1BTJVYffactEzZme7naVnBblHZGW7OFfOoha 6IiA== X-Gm-Message-State: AOAM532JIvmwzffacITHRSHrPKfHJPqdt80DQcAnhAb96kuP93cuEgzK mJNmvaEXAQheW9wn6DNcI4KWDSktdxdO6Sd8XGs+r+8LsZqCeQ== X-Google-Smtp-Source: ABdhPJwRIG+2tyr8jW8Kns2M9CNI9n1wPMmAkCrzqQJO7j18N0K7qE5xBuTrKlcVPmrW2wAy53Kf6T446g7JAKiYyf8= X-Received: by 2002:ad4:4c8c:: with SMTP id bs12mr23768595qvb.11.1608662224330; Tue, 22 Dec 2020 10:37:04 -0800 (PST) MIME-Version: 1.0 From: Andrei Popescu Date: Tue, 22 Dec 2020 18:36:53 +0000 Message-ID: To: cl-isabelle-users at lists.cam.ac.uk, agda at lists.chalmers.se, acl2 at utlists.utexas.edu Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Cc: Catalin Hritcu , Lennart Beringer Subject: [isabelle] CPP 2021: Call for Participation and Lightning Talks X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 22 Dec 2020 18:37:06 -0000 *** Call for Participation and Lightning Talks *** *** Certified Programs and Proofs (CPP 2021) *** #### Executive Summary * Conference dates: 17-19 January 2021 (extended to 3 days!) * Lightning talks submission deadline: 8 January 2021 (AoE) * Lightning talks session: 18 January 2021 at 20:00 CET * Registration: https://popl21.sigplan.org/attending/Registration - Early registration deadline: 10 January 2021 (!) - Discounted registration available (see below) * Long pre-recorded talks available by: 11 January 2021 (AoE) #### General Information Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm. CPP spans areas of computer science, mathematics, logic, and education. CPP is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. For more information please visit https://popl21.sigplan.org/home/CPP-2021 CPP 2021 will be co-located with POPL 2021 and will take place on 17-19 January 2021, as a virtual meeting, where all papers are presented online. For more information about virtual conference organization have a look here: https://popl21.sigplan.org/venue/POPL-2021-venue CPP will also have both long and short versions of presentations, just that for us the short versions are 10 minutes long (not 5). #### Call for Lightning Talks CPP 2021 will include a session of 5-minute talks where attendees can present work-in-progress, preliminary research results, and emerging topics. Submission of such lightning talks proposals is lightweight: all we need is a title, an abstract, and the author names, affiliations, and contact information. - Lightning talks submission deadline: 8 January 2021 (AoE) - Lightning talks session: 18 January 2021 at 20:00 CET - Submission information coming up in the next couple of days at: https://popl21.sigplan.org/home/CPP-2021#Call-for-Participation-and-Light= ning-Talks #### Discounted Registration We offer a $10 alternative registration fee for anyone for whom the normal registration fees could be an impediment to participation. #### Industrial Supporters Warm thanks to our generous industrial supporters: - Gold supporter: JetBrains - Silver supporters: Algorand, IOHK, and Nomadic Labs - Bronze supporters: Arm, BedRock Systems Inc, Digital Asset, Galois, Informal Systems Inc, and Zilliqa #### Invited Talks - Tobias Nipkow (Technische Universit=C3=A4t M=C3=BCnchen): Teaching Algorithms and Data Structures with a Proof Assistant - Peter Sewell (University of Cambridge): Underpinning the foundations: Sail-based semantics, testing, and reasoning, for production and CHERI-enabled architectures #### Accepted Papers, Program, and Distinguished Paper Awards The list of papers accepted at CPP 2021 is available at https://popl21.sigplan.org/home/CPP-2021#event-overview A preliminary program is also available: https://popl21.sigplan.org/home/CPP-2021#program Starting with this edition we introduced the CPP Distinguished Paper Awards, aimed at accepted submissions that stand out with respect to originality, significance, and clarity. The three Distinguished Papers selected for CPP 2021 are: - A Minimalistic Verified Bootstrapped Compiler (Proof Pearl) by Magnus O. Myreen - Formalizing the Ring of Witt Vectors by Johan Commelin and Robert Y. Lewis - Machine-Checked Semantic Session Typing by Jonas Kastberg Hinrichsen, Daniel Louwrink, Robbert Krebbers and Jesper Bengtson #### Contact For any questions please contact the chairs: Catalin Hritcu , Andrei Popescu , Lennart Beringer From mikhail.chekhov.w at gmail.com Sun Dec 27 15:58:28 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:47586) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1ktYRA-0001IT-EH (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 27 Dec 2020 15:58:28 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884812 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.166.53 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.166.53 listed in wl.mailspike.net] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [mikhail.chekhov.w[at]gmail.com] * 0.0 HTML_MESSAGE BODY: HTML included in message * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-io1-f53.google.com ([209.85.166.53]:45348) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1ktYR9-000uMh-R0 (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 27 Dec 2020 15:58:28 +0000 Received: by mail-io1-f53.google.com with SMTP id n4so7438938iow.12 for ; Sun, 27 Dec 2020 07:58:27 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:from:date:message-id:subject:to; bh=Uzt8TCvJgm+oKWqGNkJkDbScUU4elfnLYqN1cp+Wbj8=; b=LiyY9XavrLqsu/rGTbcWYoK+aIG/cqJifGD0ZOoIZ37tPC3VhUoI8hHCVrcAoTvx5h 5R8sV/vPVIXehb7sHuFwCg4dSxgPl1vQbloD3fQjYWMqN53KEWCjNAyuOhHVvB0DBBIa ajbEF/jsXTFWg7+8T9T+96L7qw4TrL5vA+nmoOGdlnMQgyBAW794yoheV43mbD95Yv/s DrNHGXBAdb1YWS5VdMdwos7LCKLMBkQULtK0En96s1nHIi9AN+fbw7M4QoaeN45V46JF qReUzu0/9s9p6NI/r2qE2/JjGaWKJN83ClcoQS9DV2gDsUBJafCXF5mnlJ9XZZHvgQ/W pgng== X-Gm-Message-State: AOAM532S2hcAbXvROdy3thWI4J8v5+bOsPUJ4y7uImTi8RZ/6I1SzoT6 W8Dr/Cc9zcVmYzaHuZj5ZkEZDLzYcgauuzDppVnZDjMP7l0= X-Google-Smtp-Source: ABdhPJwG5XvVK021QVPfszfDgKz2nja21uDMvOtgKRavbS/4R+KZfwWYAlf77nUBnFv4XkhJ/mkkGMXbHoCio9SkYEI= X-Received: by 2002:a5d:9c91:: with SMTP id p17mr33573025iop.36.1609084706128; Sun, 27 Dec 2020 07:58:26 -0800 (PST) MIME-Version: 1.0 From: Mikhail Chekhov Date: Sun, 27 Dec 2020 17:58:15 +0200 Message-ID: To: cl-isabelle-users at lists.cam.ac.uk Content-Type: multipart/alternative; boundary="0000000000005284f605b7743a99" Subject: [isabelle] Several questions about the availability of certain specific proof tools for classical reasoning/simplification in Isabelle/HOL X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 27 Dec 2020 15:58:28 -0000 --0000000000005284f605b7743a99 Content-Type: text/plain; charset="UTF-8" Dear All, I have several questions about the availability of certain types of proof methods for Isabelle (I guess, these questions can also be seen as reference requests). I am working on a certain applied formalization study. This work is carried out in the object logic ZFC in HOL. The type of reasoning that it requires is very similar to the type of reasoning that is used in HOL-Algebra. When I started my work on this project, I relied, primarily, on the tools that combine classical reasoning with simplification, such as *auto*. However, I found myself struggling more and more in my attempts to provide appropriate sets of simp/intro/dest/elim rules that would not cause significant delays and loops when solving typical set-based goals. Besides, my proof code seemed to be unnecessarily verbose. However, please do not view this as a criticism of the aforementioned proof tools: I can hardly claim to have an extensive knowledge of the analytical properties of the involved algorithms. ---------------------------------------------------------------------------------- Problem 1 >From the manual of the simplifier: "conditions in conditional rewrite rules are solved recursively before the rewrite rule is applied". Empirically, I have established that it could be useful to be able to treat rewriting in the same manner as intro-resolution, allowing the side conditions of the rewrite rules to be resolved both using rewriting or intro-resolution after the application of the rewrite rule to a given goal (of course, this is also meant to be done recursively). I devised a prototype method based on this algorithm (CS in https://gitlab.com/user9716869/Isabelle-Complement-Library). For my own needs, practically, I found this type of 'coupling' of rewriting and intro-resolution to be exceptionally capable at solving complex goals in comparison with some of the existing tools that seem to combine simplification and classical reasoning that I tried before (by now, for my own needs, I rely on the methods provided by CS almost exclusively in a reasonably sizeable development). Unfortunately, my formal background in the area of the algorithms that are used in the common proof tools is, somewhat, limited (I have always been far more interested in the applications of the proof assistants to the development of formally verified software and applied formalization of mathematics, rather than the technology behind them). Thus, I have little doubt that I have reinvented the wheel. My primary question is whether any of the existing proof tools already provide access to the algorithm that I have described. ---------------------------------------------------------------------------------- Problem 2 I would like to know if there exist any reasonably generic proof tools for Isabelle that would take into account associativity implicitly. Somehow, when performing rewriting, I would like to be able to treat ((ab)c)d, (ab)(cd), ... as members of the same equivalence class with respect to the relation induced by the associativity. Therefore, if there is an additional rewrite rule b(cd)=e (again, treated with respect to the same equivalence relation), it would be immediately applicable to any form of abcd, immediately yielding ae. Intuitively, it seems that this strategy could work rather well for the types of problems that I am facing regularly, and I am considering implementing it within the scope of the aforementioned proof tools. However, I am slightly concerned about whether there already exist canonical implementations or better alternative solutions (please note, however, that my setting is, effectively, a partial semigroup). Kind Regards, Mikhail Chekhov --0000000000005284f605b7743a99 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Dear All,

I have several questions abou= t the availability of certain types of proof methods for Isabelle (I guess,= these questions can also be seen as reference requests).

I am working on a certain applied formalization study. This work is= carried out in the object logic ZFC in HOL. The type of reasoning that it = requires is very similar to the type of reasoning that is used in HOL-Algeb= ra. When I started my work on this project, I relied, primarily, on the too= ls that combine classical reasoning with simplification, such as auto. However, I found myself struggling more and more in my attempts to provi= de appropriate sets of simp/intro/dest/elim rules that would not cause sign= ificant delays and loops when solving typical set-based goals. Besides, my = proof code seemed to be unnecessarily verbose. However, please do not view = this as a criticism of the aforementioned proof tools: I can hardly claim t= o have an extensive knowledge of the analytical properties of the involved = algorithms.

----------------------------------= ------------------------------------------------

Problem 1

From the manual of the simplifier: &q= uot;conditions in conditional rewrite rules are solved recursively before t= he rewrite rule is applied". Empirically, I have established that it c= ould be useful to be able to treat rewriting in the same manner as intro-re= solution, allowing the side conditions of the rewrite rules to be resolved = both using rewriting or intro-resolution after the application of the rewri= te rule to a given goal (of course, this is also meant to be done recursive= ly). I devised a prototype method based on this algorithm (CS in https://gitlab= .com/user9716869/Isabelle-Complement-Library). For my own needs, practi= cally, I found this type of 'coupling' of rewriting and intro-resol= ution to be exceptionally capable at solving complex goals in comparison wi= th some of the existing tools that seem to combine simplification and class= ical reasoning that I tried before (by now, for my own needs, I rely on the= methods provided by CS almost exclusively in a reasonably sizeable develop= ment).=C2=A0

Unfortunately, my formal backgro= und in the area of the algorithms that are used in the common proof tools i= s, somewhat, limited (I have always been far more interested in the applica= tions of the proof assistants to the development of formally verified softw= are and applied formalization of mathematics, rather than the technology be= hind them). Thus, I have little doubt that I have reinvented the wheel. My = primary question is whether any of the existing proof tools already provide= access to the algorithm that I have described.=C2=A0

<= /div>
-----------------------------------------------------------------= -----------------

Problem 2
I would like to know if there exist any reasonably generic proo= f tools for Isabelle that would take into account associativity implicitly.= Somehow, when performing rewriting, I would like to be able to treat ((ab)= c)d, (ab)(cd), ... as members of the same equivalence class with respect to= the relation induced by the associativity. Therefore, if there is an addit= ional rewrite rule b(cd)=3De (again, treated with respect to the same equiv= alence relation), it would be immediately applicable to any form of abcd, i= mmediately yielding ae. Intuitively, it seems that this strategy could work= rather well for the types of problems that I am facing regularly, and I am= considering implementing it within the scope of the aforementioned proof t= ools. However, I am slightly concerned about whether there already exist ca= nonical implementations or better alternative=C2=A0solutions (please note, = however, that my setting is, effectively, a partial semigroup).=C2=A0
=

Kind Regards,
Mikhail Chekho= v
--0000000000005284f605b7743a99-- From makarius at sketis.net Sun Dec 27 19:15:13 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:58350) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1ktbVZ-0005vV-Mk (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 27 Dec 2020 19:15:13 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884812 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [185.244.194.184 listed in list.dnswl.dnsbl.ja.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from relay.yourmailgateway.de ([185.244.194.184]:34183) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1ktbVY-000CYQ-fI (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Sun, 27 Dec 2020 19:15:13 +0000 Received: from relay01-mors.netcup.net (localhost [127.0.0.1]) by relay01-mors.netcup.net (Postfix) with ESMTPS id 4D3r3g6K1lz8tTF for ; Sun, 27 Dec 2020 20:15:11 +0100 (CET) Received: from policy02-mors.netcup.net (unknown [46.38.225.35]) by relay01-mors.netcup.net (Postfix) with ESMTPS id 4D3r3g5xHwz8BFp for ; Sun, 27 Dec 2020 20:15:11 +0100 (CET) X-Virus-Scanned: Debian amavisd-new at policy02-mors.netcup.net X-Spam-Flag: NO X-Spam-Score: -2.9 X-Spam-Level: X-Spam-Status: No, score=-2.9 required=6.31 tests=[ALL_TRUSTED=-1, BAYES_00=-1.9, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no Received: from mx2f26.netcup.net (unknown [10.243.12.53]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by policy02-mors.netcup.net (Postfix) with ESMTPS id 4D3r3g0tcQz8sk6 for ; Sun, 27 Dec 2020 20:15:11 +0100 (CET) Received: from [192.168.178.32] (aftr-62-216-204-194.dynamic.mnet-online.de [62.216.204.194]) by mx2f26.netcup.net (Postfix) with ESMTPSA id 4B4A9A7361 for ; Sun, 27 Dec 2020 20:15:10 +0100 (CET) Authentication-Results: mx2f26; spf=pass (sender IP is 62.216.204.194) smtp.mailfrom=makarius at sketis.net smtp.helo=[192.168.178.32] Received-SPF: pass (mx2f26: connection is authenticated) To: cl-isabelle-users From: Makarius Autocrypt: addr=makarius at sketis.net; prefer-encrypt=mutual; keydata= mQINBFcrF+4BEADMcXMnu3XHg6bRsGe3tajAHqvm89+ecn/Y0WhjI2FplhkZs1LwM+ZA9eXh hiBrC/yX0FJ+qjzVIfm66CX4nzVG1f8qwaervMpvpA+gbhtQiXc0t+LDcqV+5cdtpKplPHSu oW+KzJKyCdkDB5fYMOzuaXQwYi12YAEQH2r6K7Q7Np+k82Xli1pWe+Tha/BH0pKJ5Q01aPep ASrNW9F+moX7C0fxWl65LiXGmF0UJep6fqKruhy8oNF4p6I2oZhktvaR/x6tkL2PkT3r+xUS 6g5i3BOjfwhoGY57nsioeK+8VFvdRH5DK4CbrTgDl7ddcrEeENrfpDiPLs/afVbe/T9oDXmJ OJAO4WMpfZNiFhx9SSVTHohw29Fyzn0N1UQGjPqAY1jg32DAxlnMQ0co/KabEFAcoQsW1/6U ZGiNxYVIyEKGrnSY4WuLuNC8CmU1RaYSdTk1y9tYdxufM9lH9ynzJwac6FdalOOxMR2G9JG8 L9/dk3ytlP6DVwkPBSCpJaTkTyMp1wSkF1oK/BDu5xKUQh0zvvLCuZ16hiKRBBSjpVExXRZC u+NC1Y4wqm1HOH7HBwgZ1Hv9S/EPmI9iwgcW0SpDJqPf2Cm7oFMZsZ5Dbs6/nOQoe4Zegy45 ymqDRlIekP7zj+vOoR80XAYfmAH5DElJHldcjmgLBMdpvvqGZwARAQABtB5NYWthcml1cyA8 bWFrYXJpdXNAc2tldGlzLm5ldD6JAj0EEwEIACcFAlcrF+4CGyMFCQlmAYAFCwkIBwIGFQgJ CgsCBBYCAwECHgECF4AACgkQ89KUEoG/TbiVrw/9FjEBgh2CB7Qof7Y4k0yc7j+x/A0Wmkc0 iwP5jaKJuxRv1JJT8CFqm392+/cdh3EkRUk/UWD+hpNndYJwxZltrEpKVqFAWoVOg3ZJ4cuI MYhlp4tk/T0KSl/gKT16dc6uJ7M/FzW0zv50vjFtAdianEDuqLXHKaGDUwWoOTDly0gdZ7aH /eNby6ONHUSJMdTNOErh2N+uESM4aZqUuuL/dTb6xiVzCpV5saT8EMakoazUd7QhoBaHvqfs BL7DEmvcTtA79GF3ufHrF/UndIcx8aMznZ2PGNjmy5seDCoKX0EYHdLam8vgo/TuU4dRw5Zn 6E/ouyNOliXT1Mn+SomeBSXTR5MXRq4TQ9MKVGiP0Yl+7GJQU0JFtDC1ZZEOyjIiwGWOhbUR pYujVm8C1iQ7NcEn2BqOAmRML6IR6+En4RLbgCNsBNXlmTPRJOaI+iV6DZzg3x9zcaDGhoYt jkBTEFpb0F3jU9yuaEU5401NV34fUxg8tqXs0R9CKinO7kQ8N+RDjyyY8k2KZiDYBJ6r+OK0 d7TaTj7F9tmpAu2pmQ8lxOKjDZIwlbGTsC4lxISmcPzBGTKXja5nakcWYx/lZ4vje0WZ12HN amnD1weakFixRYit0d+Kz7cuj684NSbhwC0oN2t9R06Nfq8UPEWRKEitCly0OtRgio8zVZ/L eAC5Ag0EVysX7gEQAKs5NVOvYkE/r8KLsJ8/L/9eulpJDOFilZ9fyuqii7t1UpHZLb58QghW JM+IB2GSGsB+pOi6Je7hmwxcVdXYbGlYZ4Btqqw48/XptfbNZ8alCk6AqoVFP4MbYxij/Qqv f/Yw6GR0p1RIC/W4GF/JgDDwDFEiMT6Pv6dpM8acdNFCERDZdoOJiC+XJRwy5lZ2g5FOJkT9 rVI9EnA7mBXLLjPOMUp2/eZxN6gKOZzI3ej9vixg3adWR2yfKPgacHP/ujnVfITOl0OyLE5f zIHq85dEV4zW6Mpx7+Um0tdkwlUVMaW2nQ1bcwejgVAuD/MLSF/lSs3N5D1ctw5QUemYh7/e 2dC12UJuFDFxNPzcltQTlkBCVWV1D0SjScDHdlF6HhzpZOlt52/rwTn5GHtY4nwAL4IJ+Yvl WX8YKmyILH4Ai8c/N2IVRERQ2qorWFlsQnqrXV+hXf8aUwjc/pq4K9rsWxvle3TpeZfoBefU /s1PEX0SepZFAqAXHlQ9DZPsdPDo9EFK695G5w4nf03EhE9TV1MKGUuc1XJ6f1ZLaxu0TwTA 6qYtKIyBcU0Yn61S2Kh7Dgb5LdLV8nfl71+n/xIt2IWH5UJ9YuwEgGEP0c6ImnAUZ+nRodFI 0RwtCWlRkSJWtQln1vcphrz8PjWZH6e/nWnceXR/Al5P0WexQgtvABEBAAGJAiUEGAEIAA8F AlcrF+4CGwwFCQlmAYAACgkQ89KUEoG/Tbh7VQ/9Fc4bdwJYc3jH/LiuXv6uMg50Cv6lg2NT bL9DClWGNiYzejfM2A4c5K+GRUXhyD7S9U203MOv3z7uTbtyQL8XVolNnQlRIkB00f8nJ2sw HMXx/hemjXBvtlneq+vrMORJexldXUMFq19ZZrvj0zZL+pUnGFqt+IWTEE5GpL7wu20Demaj jYyGyKcDZyJOWZcl4e45Yn3hl0EI2xVmVh7ZinVsb3+nqgcltFy4Jt+drezwV2EiLGJHfGsT jEQb3C9VpneU4Jo+hHtfqLK4Q8+WlIOzSfyvwbabxrhyqg7i11fu8yckNW3dCURPYigV07HK 4dN0zhj53M0Q3eTwegJRPJb8XoLDcSdbsaU2HIShlGDKmzS9KL4JzLikQ9dXROC4cae3jRKH aexFi4B55Ab6FxIfXj09wUCO6Nm0owDfIBDMgiywvi2Rb2etCjBgRbSj71S2nntd9ZitoYvE yKirLkWmJRbp3ln8cHi8Uc/jr1cDPVRWuLUN0uceMj5+AR+NZVakcNUHWJCinMMjacho0SyP QmocdU8pzzupreaVWruqaSzqcpWBPwrE5OxEtJ+OyIBjKmRJ5eptjh4rKgNaVnKjhqbvr+Yz pUAgPp38jjf4HJghUGIfWArKNelKJEJOYk94DAbmT67LgqEdZ0yaA2BCHmreN727WIzV9vkX NMc= Message-ID: <7ed0b844-dd72-5fc4-2f0e-8d0d489b27ed at sketis.net> Date: Sun, 27 Dec 2020 20:15:10 +0100 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Language: en-US Content-Transfer-Encoding: 8bit X-PPP-Message-ID: <160909651047.32471.13580345555503283120 at mx2f26.netcup.net> X-PPP-Vhost: sketis.net X-NC-CID: bEcceFOKWcUC77RM63phJ6wvmsNBKM19T5MA5KmfRe79T30= Subject: [isabelle] Isabelle2021-RC1 available for testing X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 27 Dec 2020 19:15:13 -0000 Dear Isabelle users, 2021 will presumably be a special year with 2 Isabelle releases. The next one is scheduled for 15-Feb-2021: thus we have approx. 7 weeks of testing and finalization, including various open questions about external components (e.g. Java on macOS Big Sur). The ongoing release process is continuously documented on the blog entry https://isabelle-dev.sketis.net/phame/post/view/28/release_candidates_for_isabelle2021 The current release candidate is https://isabelle.in.tum.de/website-Isabelle2021-RC1 Any feedback about release candidates should be posted with a meaningful Subject (not just a clone of the announcement). I will also go through old posts from the past 8-12 weeks, to ensure that nothing remains unanswered. In the next few days, I will be unavailable, though. Makarius From lp15 at cam.ac.uk Mon Dec 28 10:54:09 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:59372) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1ktqAD-0002Hw-BR (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 28 Dec 2020 10:54:09 +0000 X-Cam-SpamDetails: score -1.1 from SpamAssassin-3.4.4-1884834 * -1.0 ALL_TRUSTED Passed through trusted hosts only via SMTP * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mta1.cl.cam.ac.uk ([128.232.0.57]:49053) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1ktqAC-0001tS-ew (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 28 Dec 2020 10:54:09 +0000 Received: from ppsw-30.csi.cam.ac.uk ([2001:630:212:8::e:f30]) by mta1.cl.cam.ac.uk with esmtp (Exim 4.90_1) (envelope-from ) id 1ktqAC-00018o-K1 for isabelle-users at cl.cam.ac.uk; Mon, 28 Dec 2020 10:54:08 +0000 X-Cam-AntiVirus: no malware found X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from lpaulson.plus.com ([81.174.248.240]:61785 helo=selenium.lan) by ppsw-30.csi.cam.ac.uk (smtp.hermes.cam.ac.uk [131.111.8.156]:25) with esmtpsa (PLAIN:lp15) (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1ktqAC-0001tL-eV (Exim 4.92.3) for isabelle-users at cl.cam.ac.uk (return-path ); Mon, 28 Dec 2020 10:54:08 +0000 From: Lawrence Paulson Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: quoted-printable Mime-Version: 1.0 (Mac OS X Mail 14.0 $3654.40.0.2.32$) Message-Id: Date: Mon, 28 Dec 2020 10:50:31 +0000 To: isabelle-users X-Mailer: Apple Mail (2.3654.40.0.2.32) X-debug-header: local_aliases has suffix Subject: [isabelle] Another ZF entry for the AFP X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 28 Dec 2020 10:54:09 -0000 I=E2=80=99m happy to announce another addition to our tiny collection of = entries based on Isabelle/ZF: Cofinality and the Delta System Lemma, by Pedro S=C3=A1nchez Terraf > We formalize the basic results on cofinality of linearly ordered sets = and ordinals and =C5=A0anin=E2=80=99s Lemma for uncountable families of = finite sets. This last result is used to prove the countable chain = condition for Cohen posets. We work in the set theory framework of = Isabelle/ZF, using the Axiom of Choice as needed. It=E2=80=99s online at = https://www.isa-afp.org/entries/Delta_System_Lemma.html Larry Paulson From lp15 at cam.ac.uk Mon Dec 28 11:07:17 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:45130) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1ktqMv-0002ch-Or (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 28 Dec 2020 11:07:17 +0000 X-Cam-AntiVirus: no malware found X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from lpaulson.plus.com ([81.174.248.240]:62110 helo=selenium.lan) by ppsw-30.csi.cam.ac.uk (smtp.hermes.cam.ac.uk [131.111.8.156]:25) with esmtpsa (PLAIN:lp15) (TLSv1.2:ECDHE-RSA-AES256-GCM-SHA384:256) id 1ktqMv-0008A7-ez (Exim 4.92.3) (return-path ); Mon, 28 Dec 2020 11:07:17 +0000 Content-Type: text/plain; charset=us-ascii Mime-Version: 1.0 (Mac OS X Mail 14.0 $3654.40.0.2.32$) From: Lawrence Paulson In-Reply-To: Date: Mon, 28 Dec 2020 11:07:17 +0000 Content-Transfer-Encoding: quoted-printable Message-Id: References: To: Mikhail Chekhov X-Mailer: Apple Mail (2.3654.40.0.2.32) Cc: cl-isabelle-users at lists.cam.ac.uk Subject: Re: [isabelle] Several questions about the availability of certain specific proof tools for classical reasoning/simplification in Isabelle/HOL X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 28 Dec 2020 11:07:17 -0000 Dear Mikhail, this sounds intriguing, though intro-resolution and = conditional rewriting will behave similarly in many cases. Do you have = simple examples to demonstrate where intro-rewriting works better? I = imagine they may involve variable instantiation (i.e. P(x) =3D=3D> l=3Dr, = where x is not mentioned in l). Larry > On 27 Dec 2020, at 15:58, Mikhail Chekhov = wrote: >=20 > =46rom the manual of the simplifier: "conditions in conditional = rewrite rules are solved recursively before the rewrite rule is = applied". Empirically, I have established that it could be useful to be = able to treat rewriting in the same manner as intro-resolution, allowing = the side conditions of the rewrite rules to be resolved both using = rewriting or intro-resolution after the application of the rewrite rule = to a given goal (of course, this is also meant to be done recursively). = I devised a prototype method based on this algorithm (CS in = https://gitlab.com/user9716869/Isabelle-Complement-Library). For my own = needs, practically, I found this type of 'coupling' of rewriting and = intro-resolution to be exceptionally capable at solving complex goals in = comparison with some of the existing tools that seem to combine = simplification and classical reasoning that I tried before (by now, for = my own needs, I rely on the methods provided by CS almost exclusively in = a reasonably sizeable development).=20 From mikhail.chekhov.w at gmail.com Mon Dec 28 16:05:57 2020 Received: from ppsw-41.csi.cam.ac.uk ([131.111.8.141]:37206) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1ktv1x-000242-4H (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 28 Dec 2020 16:05:57 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884834 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.166.169 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.166.169 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [mikhail.chekhov.w[at]gmail.com] * 0.0 HTML_MESSAGE BODY: HTML included in message * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-il1-f169.google.com ([209.85.166.169]:38760) by ppsw-41.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.149]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1ktv1v-000ubB-SI (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Mon, 28 Dec 2020 16:05:57 +0000 Received: by mail-il1-f169.google.com with SMTP id v3so9841557ilo.5 for ; Mon, 28 Dec 2020 08:05:55 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:references:in-reply-to:from:date :message-id:subject:to:cc; bh=I44We1fq30uj8f5Dd0caroVQXU8NWBnnqj3p9cdSptw=; b=Kwlf7JHsi8ROuzuMMm78U89Jf88rIpVu/5/8m4bXkj1cdyejV8//jL9PvzELz9NVnc jF3CFIc0E/cH2Xo5L440C1l/Brf438Q8DiY+ceuon7DQcqF58FrzhJcBgPT+moc26aiF Mr2SalH+t78IUThzbhJmQ+XnkZTABRWlN7ytdbuivnZRPdTaKi5wl1Wbao5j0/TXOwFL 3LWkyrAtCKFc1ptftlMefYhE09lW35NJI27WepUfVgHHW3w8eWDLlaisoHZtBJ2+USTr wYvAufhKKUbiS78jwHiy7haftfVsYE59VwJxuSqGyVIskcitnRDvmMgvFGBkdFSd57bN 8phw== X-Gm-Message-State: AOAM5312SMkunY6khFGOd3VSAip6ll91QVnT8mXzJoDSjhHerK8ut96e tMt7kxlYpZEhwYQLXEQLPSgKeNdMTsz9NKZsesmWJIma/pc= X-Google-Smtp-Source: ABdhPJxipGjEXz2dBI4yl+Y/UHVXL747T5/sdpg1zCvU9DZTyYKrgFEYDHwWYQGU6EJxydUGytZZvFYkSlaRZsJ5M/o= X-Received: by 2002:a92:5802:: with SMTP id m2mr43604253ilb.271.1609171554528; Mon, 28 Dec 2020 08:05:54 -0800 (PST) MIME-Version: 1.0 References: In-Reply-To: From: Mikhail Chekhov Date: Mon, 28 Dec 2020 18:05:43 +0200 Message-ID: To: cl-isabelle-users at lists.cam.ac.uk Content-Type: multipart/alternative; boundary="000000000000e3f2f305b78872f4" Cc: Lawrence Paulson Subject: Re: [isabelle] Several questions about the availability of certain specific proof tools for classical reasoning/simplification in Isabelle/HOL X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 28 Dec 2020 16:05:57 -0000 --000000000000e3f2f305b78872f4 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Dear Lawrence Paulson, > this sounds intriguing, though intro-resolution and conditional rewriting > will behave similarly in many cases. > > Would it possible to suggest a reference that explains this in more detail? I have a certain degree of familiarity with the conventional theory of abstract/term rewriting, but I am not certain how would one go about establishing analytical properties of a set of intro+simp rules for a method like auto. ---------------------------------------------------------------------------= --- > Do you have simple examples to demonstrate where intro-rewriting works > better? I imagine they may involve variable instantiation (i.e. P(x) =3D= =3D> > l=3Dr, where x is not mentioned in l). > > Effectively, you have already proposed one such example. An expanded variant stated in Isabelle/HOL can be found in Appendix A after my signature. Indeed, I use this type of pattern quite frequently in my work. For example, I have introduced predicates that indicate that a given entity is a function from a to b. Also, similar predicates exist for injective/surjective/bijective functions and, even more generally, for various specific arrows in arbitrary categories. Practically, I found it unwieldy to use different predicates to distinguish the arrows with a specified domain or codomain only, or stating their domain/codomain explicitly in the statements of theorems, or using additional 'composability' predicates: when using the latter two methodologies it also seems to be difficult to establish a good set of rewriting/introduction rules for reasons unrelated to the choice of the method/strategy for rewriting/introduction. Besides, the chosen methodology leads to (what I would consider being) a very natural textbook-like style of presentation. For example, to state that the horizontal composition of (horizontally composable) natural isomorphisms is a natural isomorphism, I may use something similar to (=CE=B1 is a size parameter; see https://en.wikipedia.org/wiki/Strict_2-category for the source of the inspiration for the notation): assumes "=F0=9D=94=90 : =F0=9D=94=89' =E2=86=A6iso =F0=9D=94=8A' : =F0=9D= =94=85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" and "=F0=9D=94=91 : =F0=9D=94=89 =E2=86=A6iso =F0=9D=94=8A : =F0=9D=94= =84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=85" shows "=F0=9D=94=90 =E2=88=98 =F0=9D=94=91 : =F0=9D=94=89' =E2=88=98 =F0= =9D=94=89 =E2=86=A6iso =F0=9D=94=8A' =E2=88=98 =F0=9D=94=8A : =F0=9D=94=84 = =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" However, given these conventions, a natural form of the associativity law for the horizontal transformations now looks like assumes "=F0=9D=94=8F : =F0=9D=94=89'' =E2=86=A6 =F0=9D=94=8A'' : =E2=84= =AD =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=87" and "=F0=9D=94=90 : =F0=9D=94=89' =E2=86=A6 =F0=9D=94=8A' : =F0=9D=94= =85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" and "=F0=9D=94=91 : =F0=9D=94=89 =E2=86=A6 =F0=9D=94=8A : =F0=9D=94=84 = =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=85" shows "(=F0=9D=94=8F =E2=88=98 =F0=9D=94=90) =E2=88=98 =F0=9D=94=91 =3D = =F0=9D=94=8F =E2=88=98 (=F0=9D=94=90 =E2=88=98 =F0=9D=94=91)" This does cause a problem when trying to use it in conjunction with intro-resolution and conditional rewriting. However, cs_concl copes with it reasonably well for relatively complex use cases. ---------------------------------------------------------------------------= --- There is another practical aspect that may lead to problems when using intro-resolution + simp: I am not certain whether it is a good idea to maintain a large collection of theorems that state how various predicates are related to each other in the form of a simpset. Consider the following example: context fixes P Q R f b assumes [intro, cs_intros]: "P x =E2=9F=B9 Q x" and [intro, cs_intros]: "Q x =E2=9F=B9 R x" and [simp, intro, cs_simps]: "R x =E2=9F=B9 f x =3D b" and Qb: "Q b" begin lemma assumes "P x" shows "Q (f x)" using assms Qb oops (*by simp, auto, force, fast, fastforce, blast*) lemma assumes "P x" shows "Q (f x)" using assms Qb by (cs_concl cs_simp: cs_simps cs_intro: cs_intros) end In this case, if "P x =E2=9F=B9 Q x" and "Q x =E2=9F=B9 R x" are part of t= he simpset, then the example works. However, I am not certain whether one can always replace/augment intro with simp in this way and how practical is it in general. Is it possible to build upon this example to ensure that simp rules cannot be used instead of introduction? Could simp eliminate the side conditions that one does not want to be eliminated when proving other theorems? I thought that I have observed such problems with this methodology when working with simp/auto, but I cannot find a way to produce a minimal example in this instance. Perhaps, there was a way around them. However, one of the most pleasant aspects of the strategy employed in cs_concl is that one no longer needs to think about whether a rule should be declared as simp, intro, or both. Effectively, intro-resolution is used exclusively, making it easier to predict how the method will behave with a given set of rules. Kind Regards, Mikhail Chekhov Appendix A named_theorems cs_simps named_theorems cs_intros definition surj_from_to where "surj_from_to a b f =3D (f ` a =3D b)" context fixes f c P assumes f[intro, simp, cs_simps]: "surj_from_to a b f =E2=9F=B9 x =E2=88= =88 a =E2=9F=B9 f x =3D c + x" and [intro, simp, cs_intros]: "P a b x =E2=9F=B9 surj_from_to a b f" and [intro, simp, cs_intros]: "P a b x =E2=9F=B9 c + x =3D x" begin lemma assumes "P a b x" and "x =E2=88=88 a" shows "f x =3D x" using assms oops (*by simp, auto, force, fast, fastforce, blast*) lemma assumes "P a b x" and "x =E2=88=88 a" shows "f x =3D x" using assms by (cs_concl cs_simp: cs_simps cs_intro: cs_intros) end On Mon, Dec 28, 2020 at 1:07 PM Lawrence Paulson wrote: > Dear Mikhail, this sounds intriguing, though intro-resolution and > conditional rewriting will behave similarly in many cases. Do you have > simple examples to demonstrate where intro-rewriting works better? I > imagine they may involve variable instantiation (i.e. P(x) =3D=3D> l=3Dr,= where x > is not mentioned in l). > > Larry > > > On 27 Dec 2020, at 15:58, Mikhail Chekhov > wrote: > > > > From the manual of the simplifier: "conditions in conditional rewrite > rules are solved recursively before the rewrite rule is applied". > Empirically, I have established that it could be useful to be able to tre= at > rewriting in the same manner as intro-resolution, allowing the side > conditions of the rewrite rules to be resolved both using rewriting or > intro-resolution after the application of the rewrite rule to a given goa= l > (of course, this is also meant to be done recursively). I devised a > prototype method based on this algorithm (CS in > https://gitlab.com/user9716869/Isabelle-Complement-Library). For my own > needs, practically, I found this type of 'coupling' of rewriting and > intro-resolution to be exceptionally capable at solving complex goals in > comparison with some of the existing tools that seem to combine > simplification and classical reasoning that I tried before (by now, for m= y > own needs, I rely on the methods provided by CS almost exclusively in a > reasonably sizeable development). > > --000000000000e3f2f305b78872f4 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Dear Lawrence Paulson,

this sounds intriguing, though intro-resol= ution and conditional rewriting will behave similarly in many cases.=C2=A0<= br>

Would it possible to suggest a refe= rence that explains this in more detail? I have a certain degree of familia= rity with the conventional theory of abstract/term rewriting, but I am not = certain how would one go about establishing analytical properties of a set = of intro+simp rules for a method like auto.

------= ------------------------------------------------------------------------

Do you have simple examples to demonstrate where intro-rewriting works bet= ter? I imagine they may involve variable instantiation (i.e. P(x) =3D=3D>= ; l=3Dr, where x is not mentioned in l).

Effectively, you have already proposed one such example. An expanded = variant stated in Isabelle/HOL can be found in Appendix A after my signatur= e.=C2=A0

Indeed, I use this type of pattern quite = frequently in my work. For example, I have introduced predicates that indic= ate that a given entity is a function from a to b. Also, similar predicates= exist for injective/surjective/bijective functions and, even more generall= y, for various specific arrows in arbitrary categories. Practically, I foun= d it unwieldy to use different predicates to distinguish the arrows with a = specified domain or codomain only, or stating their domain/codomain explici= tly in the statements of theorems, or using additional 'composability&#= 39; predicates: when using the latter two methodologies it also seems to be= difficult to establish a good set of rewriting/introduction rules for reas= ons unrelated to the choice of the method/strategy for rewriting/introducti= on. Besides, the chosen methodology leads to (what I would consider being) = a very natural textbook-like style of presentation. For example, to state t= hat the horizontal composition of (horizontally composable) natural isomorp= hisms is a natural isomorphism, I may use something similar to (=CE=B1 is a= size parameter; see https://en.wikipedia.org/wiki/Strict_2-category for the source of= the inspiration for the notation):

=C2=A0 assumes= "=F0=9D=94=90 : =F0=9D=94=89' =E2=86=A6iso =F0=9D=94=8A' : = =F0=9D=94=85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" =C2=A0 =C2=A0 and "=F0=9D=94=91 : =F0=9D=94=89 =E2=86=A6iso =F0=9D=94= =8A : =F0=9D=94=84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=85&= quot;
=C2=A0 shows "=F0=9D=94=90 =E2=88=98 =F0=9D=94=91 : =F0=9D=94= =89' =E2=88=98 =F0=9D=94=89 =E2=86=A6iso =F0=9D=94=8A' =E2=88=98 = =F0=9D=94=8A : =F0=9D=94=84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2= =84=AD"

However, given these conventions,= a natural form of the associativity law for the horizontal transformations= now looks like

=C2=A0 assumes "=F0=9D=94=8F = : =F0=9D=94=89'' =E2=86=A6 =F0=9D=94=8A'' : =E2=84=AD =E2= =86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=87"
=C2=A0 =C2= =A0 and "=F0=9D=94=90 : =F0=9D=94=89' =E2=86=A6 =F0=9D=94=8A' = : =F0=9D=94=85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD"=C2=A0 =C2=A0 and "=F0=9D=94=91 : =F0=9D=94=89 =E2=86=A6 =F0=9D=94= =8A : =F0=9D=94=84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=85&= quot;
=C2=A0 shows "(=F0=9D=94=8F =E2=88=98 =F0=9D=94=90) =E2=88=98= =F0=9D=94=91 =3D =F0=9D=94=8F =E2=88=98 (=F0=9D=94=90 =E2=88=98 =F0=9D=94= =91)"

This does cause a problem when tryi= ng to use it in conjunction with intro-resolution and conditional rewriting= . However, cs_concl copes with it reasonably well for relatively complex=C2= =A0use cases.=C2=A0=C2=A0

------------------------= ------------------------------------------------------

There is another practical aspect that may lead=C2=A0to problems w= hen using intro-resolution + simp: I am not certain whether it is a good id= ea to maintain a large collection of theorems that state how various predic= ates are related to each other in the form of a simpset. Consider the follo= wing example:

context
=C2=A0 fixes P Q R f= b
=C2=A0 assumes [intro, cs_intros]: "P x =E2=9F=B9 Q x"
= =C2=A0 =C2=A0 and [intro, cs_intros]: "Q x =E2=9F=B9 R x"
=C2= =A0 =C2=A0 and [simp, intro, cs_simps]: "R x =E2=9F=B9 f x =3D b"=
=C2=A0 =C2=A0 and Qb: "Q b"
begin

lemma
=C2=A0 = assumes "P x"
=C2=A0 shows "Q (f x)"
=C2=A0 using= assms Qb oops (*by simp, auto, force, fast, fastforce, blast*)

lemm= a
=C2=A0 assumes "P x"
=C2=A0 shows "Q (f x)"=C2=A0 using assms Qb by (cs_concl cs_simp: cs_simps cs_intro: cs_intros)<= br>
end

In this case, if=C2=A0 "P x = =E2=9F=B9 Q x" and=C2=A0"Q x =E2=9F=B9 R x" are part of the = simpset, then the example works. However, I am not certain whether one can = always replace/augment intro with simp in this way and how practical is it = in general. Is it possible to build upon this example to ensure that simp= =C2=A0rules cannot be used instead of introduction? Could=C2=A0simp elimina= te=C2=A0the side conditions that one does not want to be eliminated when pr= oving other theorems? I thought that I have observed such problems with thi= s methodology when working with simp/auto, but I cannot find a way to produ= ce a minimal example in this instance. Perhaps, there was a way around them= . However, one of the most pleasant aspects of the strategy employed in cs_= concl is that one no longer needs to think about whether a rule should be d= eclared as simp, intro, or both. Effectively, intro-resolution is used excl= usively,=C2=A0making it easier to predict how the method will behave with a= given set of rules.=C2=A0
=C2=A0
Kind Regards,
Mikhail Chekhov

Appendix A

=
named_theorems cs_simps
named_theorems cs_intros

defini= tion surj_from_to
=C2=A0 where "surj_from_to a b f =3D (f ` a =3D = b)"

context
=C2=A0 fixes f c P
=C2=A0 assumes f[intro, s= imp, cs_simps]: "surj_from_to a b f =E2=9F=B9 x =E2=88=88 a =E2=9F=B9 = f x =3D c + x"
=C2=A0 =C2=A0 and [intro, simp, cs_intros]: "P = a b x =E2=9F=B9 surj_from_to a b f"
=C2=A0 =C2=A0 and [intro, simp,= cs_intros]: "P a b x =E2=9F=B9 c + x =3D x"
begin

lemm= a
=C2=A0 assumes "P a b x" and "x =E2=88=88 a"
= =C2=A0 shows "f x =3D x"
=C2=A0 using assms oops (*by simp, au= to, force, fast, fastforce, blast*)

lemma
=C2=A0 assumes "P = a b x" and "x =E2=88=88 a"
=C2=A0 shows "f x =3D x&q= uot;
=C2=A0 using assms by (cs_concl cs_simp: cs_simps cs_intro: cs_intr= os)

end

On Mon, Dec 28, 2020 at 1:07 PM La= wrence Paulson <lp15= @cam.ac.uk> wrote:
Dear Mikhail, this sounds intriguing, though intro-resolution an= d conditional rewriting will behave similarly in many cases. Do you have si= mple examples to demonstrate where intro-rewriting works better? I imagine = they may involve variable instantiation (i.e. P(x) =3D=3D> l=3Dr, where = x is not mentioned in l).

Larry

> On 27 Dec 2020, at 15:58, Mikhail Chekhov <mikhail.chekhov.w at gmail.com>= ; wrote:
>
> From the manual of the simplifier: "conditions in conditional rew= rite rules are solved recursively before the rewrite rule is applied".= Empirically, I have established that it could be useful to be able to trea= t rewriting in the same manner as intro-resolution, allowing the side condi= tions of the rewrite rules to be resolved both using rewriting or intro-res= olution after the application of the rewrite rule to a given goal (of cours= e, this is also meant to be done recursively). I devised a prototype method= based on this algorithm (CS in https://gi= tlab.com/user9716869/Isabelle-Complement-Library). For my own needs, pr= actically, I found this type of 'coupling' of rewriting and intro-r= esolution to be exceptionally capable at solving complex goals in compariso= n with some of the existing tools that seem to combine simplification and c= lassical reasoning that I tried before (by now, for my own needs, I rely on= the methods provided by CS almost exclusively in a reasonably sizeable dev= elopment).

--000000000000e3f2f305b78872f4-- From mikhail.chekhov.w at gmail.com Tue Dec 29 12:38:14 2020 Received: from ppsw-30.csi.cam.ac.uk ([131.111.8.130]:34696) by lists-1.csi.cam.ac.uk (lists.cam.ac.uk [131.111.8.15]:25) with esmtp id 1kuEGU-0005H4-BL (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 29 Dec 2020 12:38:14 +0000 X-Cam-SpamDetails: score -0.3 from SpamAssassin-3.4.4-1884855 * -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at https://www.dnswl.org/, no * trust * [209.85.166.51 listed in list.dnswl.dnsbl.ja.net] * -0.0 RCVD_IN_MSPIKE_H2 RBL: Average reputation (+2) * [209.85.166.51 listed in wl.mailspike.net] * -0.1 BAYES_00 BODY: Bayes spam probability is 0 to 1% * [score: 0.0000] * 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider * [mikhail.chekhov.w[at]gmail.com] * 0.0 HTML_MESSAGE BODY: HTML included in message * 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily * valid * -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature * -0.1 DKIM_VALID_EF Message has a valid DKIM or DK signature from * envelope-from domain * -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from * author's domain X-Cam-ScannerInfo: http://help.uis.cam.ac.uk/email-scanner-virus Received: from mail-io1-f51.google.com ([209.85.166.51]:37714) by ppsw-30.csi.cam.ac.uk (mx.cam.ac.uk [131.111.8.146]:25) with esmtps (TLSv1.2:ECDHE-RSA-AES128-GCM-SHA256:128) id 1kuEGS-000Yyn-fk (Exim 4.92.3) for cl-isabelle-users at lists.cam.ac.uk (return-path ); Tue, 29 Dec 2020 12:38:14 +0000 Received: by mail-io1-f51.google.com with SMTP id p187so11969411iod.4 for ; Tue, 29 Dec 2020 04:38:12 -0800 (PST) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:references:in-reply-to:from:date :message-id:subject:to:cc; bh=Vk/JnFNQEcMCzyhq5+MrTUAWcFSpdga44YXDM3RhVZo=; b=RkxPYR+ICxGJrduGrd+bEq8BcBvQ7Ob2xuuqD+CdU1rMkrrNCLhMKoD3dhaG+jfC2r WETn54DT8al72Hcqcx8Fhtt39cC82P1tfuWsb73YiAYuSsII9uYBjcRVy5TFWhQQLnOI pAaJnptKA8v7gBkUHgC2wimOumBnzxX9SNRKAh0bzxK1BSu9cJbrl8M5czKk0drv2qjN QJtPhKw7loU6BZ4XdH7oYA/FcVNqw8pnn5ZRlKnvnVzd2BK+woKpnJiUrQZl+jVbQIWg 2OtlSRyX5gEafsh6/knqh8dx32HBTv0xoNvFTpUyk47V2qhsMe0bDM3oxJ8IXJh7bCro ls/w== X-Gm-Message-State: AOAM530QLhuFEZF/GeoSyYVEWx2BZmIXQsdJZRbQItyAC/LVMxSdEvxz 3eazMp9K7tGVXvnJaAimCPmjJe915bthLcTO9jdbAHTWFRY= X-Google-Smtp-Source: ABdhPJzVoXmcOV78I1q1FdiEb+XnCe6zzPeX2TPCcJGarr0kDXiSKLYuRHUWIhHfLEMxXL4WTxoTqGTvTFhiYwRmP28= X-Received: by 2002:a5d:9c91:: with SMTP id p17mr39525737iop.36.1609245491784; Tue, 29 Dec 2020 04:38:11 -0800 (PST) MIME-Version: 1.0 References: In-Reply-To: From: Mikhail Chekhov Date: Tue, 29 Dec 2020 14:38:00 +0200 Message-ID: To: cl-isabelle-users at lists.cam.ac.uk Content-Type: multipart/alternative; boundary="000000000000e4f0e005b799a961" Cc: Lawrence Paulson Subject: Re: [isabelle] Several questions about the availability of certain specific proof tools for classical reasoning/simplification in Isabelle/HOL X-BeenThere: cl-isabelle-users at lists.cam.ac.uk X-Mailman-Version: 2.1.8 Precedence: list List-Id: Isabelle Users List List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 29 Dec 2020 12:38:14 -0000 --000000000000e4f0e005b799a961 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Dear Lawrence Paulson/All, Once again, I apologize for my haste. It seems that I have developed a bad habit of trying to minimize the time spent on writing the replies for the mailing list, leading to various embarrassing misprints and mistakes. Of course, the excerpt "a natural form of the associativity law for the horizontal transformations" should read "a natural form of the associativity law for the horizontal composition of natural transformations". I noticed that there is quite a number of other minor inconsistencies and misprints in my last email. However, hopefully, they do not interfere with the meaning that I was trying to convey. Kind Regards, Mikhail Chekhov On Mon, Dec 28, 2020 at 6:05 PM Mikhail Chekhov wrote: > Dear Lawrence Paulson, > > >> this sounds intriguing, though intro-resolution and conditional rewritin= g >> will behave similarly in many cases. >> >> > Would it possible to suggest a reference that explains this in more > detail? I have a certain degree of familiarity with the conventional theo= ry > of abstract/term rewriting, but I am not certain how would one go about > establishing analytical properties of a set of intro+simp rules for a > method like auto. > > > -------------------------------------------------------------------------= ----- > > >> Do you have simple examples to demonstrate where intro-rewriting works >> better? I imagine they may involve variable instantiation (i.e. P(x) =3D= =3D> >> l=3Dr, where x is not mentioned in l). >> >> > Effectively, you have already proposed one such example. An expanded > variant stated in Isabelle/HOL can be found in Appendix A after my > signature. > > Indeed, I use this type of pattern quite frequently in my work. For > example, I have introduced predicates that indicate that a given entity i= s > a function from a to b. Also, similar predicates exist for > injective/surjective/bijective functions and, even more generally, for > various specific arrows in arbitrary categories. Practically, I found it > unwieldy to use different predicates to distinguish the arrows with a > specified domain or codomain only, or stating their domain/codomain > explicitly in the statements of theorems, or using additional > 'composability' predicates: when using the latter two methodologies it al= so > seems to be difficult to establish a good set of rewriting/introduction > rules for reasons unrelated to the choice of the method/strategy for > rewriting/introduction. Besides, the chosen methodology leads to (what I > would consider being) a very natural textbook-like style of presentation. > For example, to state that the horizontal composition of (horizontally > composable) natural isomorphisms is a natural isomorphism, I may use > something similar to (=CE=B1 is a size parameter; see > https://en.wikipedia.org/wiki/Strict_2-category for the source of the > inspiration for the notation): > > assumes "=F0=9D=94=90 : =F0=9D=94=89' =E2=86=A6iso =F0=9D=94=8A' : =F0= =9D=94=85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" > and "=F0=9D=94=91 : =F0=9D=94=89 =E2=86=A6iso =F0=9D=94=8A : =F0=9D= =94=84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=85" > shows "=F0=9D=94=90 =E2=88=98 =F0=9D=94=91 : =F0=9D=94=89' =E2=88=98 = =F0=9D=94=89 =E2=86=A6iso =F0=9D=94=8A' =E2=88=98 =F0=9D=94=8A : =F0=9D=94= =84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" > > However, given these conventions, a natural form of the associativity law > for the horizontal transformations now looks like > > assumes "=F0=9D=94=8F : =F0=9D=94=89'' =E2=86=A6 =F0=9D=94=8A'' : =E2= =84=AD =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=87" > and "=F0=9D=94=90 : =F0=9D=94=89' =E2=86=A6 =F0=9D=94=8A' : =F0=9D=94= =85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =E2=84=AD" > and "=F0=9D=94=91 : =F0=9D=94=89 =E2=86=A6 =F0=9D=94=8A : =F0=9D=94= =84 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94=85" > shows "(=F0=9D=94=8F =E2=88=98 =F0=9D=94=90) =E2=88=98 =F0=9D=94=91 =3D= =F0=9D=94=8F =E2=88=98 (=F0=9D=94=90 =E2=88=98 =F0=9D=94=91)" > > This does cause a problem when trying to use it in conjunction with > intro-resolution and conditional rewriting. However, cs_concl copes with = it > reasonably well for relatively complex use cases. > > > -------------------------------------------------------------------------= ----- > > There is another practical aspect that may lead to problems when using > intro-resolution + simp: I am not certain whether it is a good idea to > maintain a large collection of theorems that state how various predicates > are related to each other in the form of a simpset. Consider the followin= g > example: > > context > fixes P Q R f b > assumes [intro, cs_intros]: "P x =E2=9F=B9 Q x" > and [intro, cs_intros]: "Q x =E2=9F=B9 R x" > and [simp, intro, cs_simps]: "R x =E2=9F=B9 f x =3D b" > and Qb: "Q b" > begin > > lemma > assumes "P x" > shows "Q (f x)" > using assms Qb oops (*by simp, auto, force, fast, fastforce, blast*) > > lemma > assumes "P x" > shows "Q (f x)" > using assms Qb by (cs_concl cs_simp: cs_simps cs_intro: cs_intros) > > end > > In this case, if "P x =E2=9F=B9 Q x" and "Q x =E2=9F=B9 R x" are part of= the simpset, > then the example works. However, I am not certain whether one can always > replace/augment intro with simp in this way and how practical is it in > general. Is it possible to build upon this example to ensure that > simp rules cannot be used instead of introduction? Could simp eliminate t= he > side conditions that one does not want to be eliminated when proving othe= r > theorems? I thought that I have observed such problems with this > methodology when working with simp/auto, but I cannot find a way to produ= ce > a minimal example in this instance. Perhaps, there was a way around them. > However, one of the most pleasant aspects of the strategy employed in > cs_concl is that one no longer needs to think about whether a rule should > be declared as simp, intro, or both. Effectively, intro-resolution is use= d > exclusively, making it easier to predict how the method will behave with = a > given set of rules. > > Kind Regards, > Mikhail Chekhov > > Appendix A > > named_theorems cs_simps > named_theorems cs_intros > > definition surj_from_to > where "surj_from_to a b f =3D (f ` a =3D b)" > > context > fixes f c P > assumes f[intro, simp, cs_simps]: "surj_from_to a b f =E2=9F=B9 x =E2= =88=88 a =E2=9F=B9 f x =3D c > + x" > and [intro, simp, cs_intros]: "P a b x =E2=9F=B9 surj_from_to a b f" > and [intro, simp, cs_intros]: "P a b x =E2=9F=B9 c + x =3D x" > begin > > lemma > assumes "P a b x" and "x =E2=88=88 a" > shows "f x =3D x" > using assms oops (*by simp, auto, force, fast, fastforce, blast*) > > lemma > assumes "P a b x" and "x =E2=88=88 a" > shows "f x =3D x" > using assms by (cs_concl cs_simp: cs_simps cs_intro: cs_intros) > > end > > > On Mon, Dec 28, 2020 at 1:07 PM Lawrence Paulson wrote: > >> Dear Mikhail, this sounds intriguing, though intro-resolution and >> conditional rewriting will behave similarly in many cases. Do you have >> simple examples to demonstrate where intro-rewriting works better? I >> imagine they may involve variable instantiation (i.e. P(x) =3D=3D> l=3Dr= , where x >> is not mentioned in l). >> >> Larry >> >> > On 27 Dec 2020, at 15:58, Mikhail Chekhov >> wrote: >> > >> > From the manual of the simplifier: "conditions in conditional rewrite >> rules are solved recursively before the rewrite rule is applied". >> Empirically, I have established that it could be useful to be able to tr= eat >> rewriting in the same manner as intro-resolution, allowing the side >> conditions of the rewrite rules to be resolved both using rewriting or >> intro-resolution after the application of the rewrite rule to a given go= al >> (of course, this is also meant to be done recursively). I devised a >> prototype method based on this algorithm (CS in >> https://gitlab.com/user9716869/Isabelle-Complement-Library). For my own >> needs, practically, I found this type of 'coupling' of rewriting and >> intro-resolution to be exceptionally capable at solving complex goals in >> comparison with some of the existing tools that seem to combine >> simplification and classical reasoning that I tried before (by now, for = my >> own needs, I rely on the methods provided by CS almost exclusively in a >> reasonably sizeable development). >> >> --000000000000e4f0e005b799a961 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Dear Lawrence Paulson/All,

Once aga= in, I apologize for my haste. It seems that I have developed a bad habit of= trying to minimize the time spent on writing the replies for the mailing l= ist, leading to various embarrassing misprints and mistakes. Of course, the= excerpt "a natural form of the associativity law for the horizontal t= ransformations" should read "a natural form of the associativity = law for the horizontal composition of natural transformations". I noti= ced that there is quite a number of other minor inconsistencies and misprin= ts in my last=C2=A0email. However, hopefully, they do not interfere with th= e meaning that I was trying to convey.

Kind Regard= s,
Mikhail Chekhov

On Mon, Dec 28, 2020 at 6:05 PM Mikhail C= hekhov <mikhail.chekhov.w= @gmail.com> wrote:
Dear Lawrence Paulson,

this sounds intriguing, though = intro-resolution and conditional rewriting will behave similarly in many ca= ses.=C2=A0

Would it possible to sug= gest a reference that explains this in more detail? I have a certain degree= of familiarity with the conventional theory of abstract/term rewriting, bu= t I am not certain how would one go about establishing analytical propertie= s of a set of intro+simp rules for a method like auto.

=
----------------------------------------------------------------------= --------

Do you have simple examples to demonstrate where intro-rewritin= g works better? I imagine they may involve variable instantiation (i.e. P(x= ) =3D=3D> l=3Dr, where x is not mentioned in l).

Effectively, you have already proposed one such example. A= n expanded variant stated in Isabelle/HOL can be found in Appendix A after = my signature.=C2=A0

Indeed, I use this type of pat= tern quite frequently in my work. For example, I have introduced predicates= that indicate that a given entity is a function from a to b. Also, similar= predicates exist for injective/surjective/bijective functions and, even mo= re generally, for various specific arrows in arbitrary categories. Practica= lly, I found it unwieldy to use different predicates to distinguish the arr= ows with a specified domain or codomain only, or stating their domain/codom= ain explicitly in the statements of theorems, or using additional 'comp= osability' predicates: when using the latter two methodologies it also = seems to be difficult to establish a good set of rewriting/introduction rul= es for reasons unrelated to the choice of the method/strategy for rewriting= /introduction. Besides, the chosen methodology leads to (what I would consi= der being) a very natural textbook-like style of presentation. For example,= to state that the horizontal composition of (horizontally composable) natu= ral isomorphisms is a natural isomorphism, I may use something similar to (= =CE=B1 is a size parameter; see https://en.wikipedia.org/wiki/Strict_2-c= ategory for the source of the inspiration for the notation):
=
=C2=A0 assumes "=F0=9D=94=90 : =F0=9D=94=89' =E2=86= =A6iso =F0=9D=94=8A' : =F0=9D=94=85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1= =E2=87=99 =E2=84=AD"
=C2=A0 =C2=A0 and "=F0=9D=94=91 : =F0=9D= =94=89 =E2=86=A6iso =F0=9D=94=8A : =F0=9D=94=84 =E2=86=A6=E2=86=A6=E2=87=98= =CE=B1=E2=87=99 =F0=9D=94=85"
=C2=A0 shows "=F0=9D=94=90 =E2= =88=98 =F0=9D=94=91 : =F0=9D=94=89' =E2=88=98 =F0=9D=94=89 =E2=86=A6iso= =F0=9D=94=8A' =E2=88=98 =F0=9D=94=8A : =F0=9D=94=84 =E2=86=A6=E2=86=A6= =E2=87=98=CE=B1=E2=87=99 =E2=84=AD"

Howev= er, given these conventions, a natural form of the associativity law for th= e horizontal transformations now looks like

=C2=A0= assumes "=F0=9D=94=8F : =F0=9D=94=89'' =E2=86=A6 =F0=9D=94=8A= '' : =E2=84=AD =E2=86=A6=E2=86=A6=E2=87=98=CE=B1=E2=87=99 =F0=9D=94= =87"
=C2=A0 =C2=A0 and "=F0=9D=94=90 : =F0=9D=94=89' =E2= =86=A6 =F0=9D=94=8A' : =F0=9D=94=85 =E2=86=A6=E2=86=A6=E2=87=98=CE=B1= =E2=87=99 =E2=84=AD"
=C2=A0 =C2=A0 and "=F0=9D=94=91 : =F0=9D= =94=89 =E2=86=A6 =F0=9D=94=8A : =F0=9D=94=84 =E2=86=A6=E2=86=A6=E2=87=98=CE= =B1=E2=87=99 =F0=9D=94=85"
=C2=A0 shows "(=F0=9D=94=8F =E2=88= =98 =F0=9D=94=90) =E2=88=98 =F0=9D=94=91 =3D =F0=9D=94=8F =E2=88=98 (=F0=9D= =94=90 =E2=88=98 =F0=9D=94=91)"

This does= cause a problem when trying to use it in conjunction with intro-resolution= and conditional rewriting. However, cs_concl copes with it reasonably well= for relatively complex=C2=A0use cases.=C2=A0=C2=A0

-------------------------------------------------------------------------= -----

There is another practical aspect that m= ay lead=C2=A0to problems when using intro-resolution + simp: I am not certa= in whether it is a good idea to maintain a large collection of theorems tha= t state how various predicates are related to each other in the form of a s= impset. Consider the following example:

contex= t
=C2=A0 fixes P Q R f b
=C2=A0 assumes [intro, cs_intros]: "P = x =E2=9F=B9 Q x"
=C2=A0 =C2=A0 and [intro, cs_intros]: "Q x = =E2=9F=B9 R x"
=C2=A0 =C2=A0 and [simp, intro, cs_simps]: "R x= =E2=9F=B9 f x =3D b"
=C2=A0 =C2=A0 and Qb: "Q b"
begi= n

lemma
=C2=A0 assumes "P x"
=C2=A0 shows "Q (= f x)"
=C2=A0 using assms Qb oops (*by simp, auto, force, fast, fast= force, blast*)

lemma
=C2=A0 assumes "P x"
=C2=A0 sh= ows "Q (f x)"
=C2=A0 using assms Qb by (cs_concl cs_simp: cs_s= imps cs_intro: cs_intros)

end

In this c= ase, if=C2=A0 "P x =E2=9F=B9 Q x" and=C2=A0"Q x =E2=9F=B9 R = x" are part of the simpset, then the example works. However, I am not = certain whether one can always replace/augment intro with simp in this way = and how practical is it in general. Is it possible to build upon this examp= le to ensure that simp=C2=A0rules cannot be used instead of introduction? C= ould=C2=A0simp eliminate=C2=A0the side conditions that one does not want to= be eliminated when proving other theorems? I thought that I have observed = such problems with this methodology when working with simp/auto, but I cann= ot find a way to produce a minimal example in this instance. Perhaps, there= was a way around them. However, one of the most pleasant aspects of the st= rategy employed in cs_concl is that one no longer needs to think about whet= her a rule should be declared as simp, intro, or both. Effectively, intro-r= esolution is used exclusively,=C2=A0making it easier to predict how the met= hod will behave with a given set of rules.=C2=A0
=C2=A0
Kind Regards,
Mikhail Chekhov

Appendix = A

named_theorems cs_simps
named_theorems c= s_intros

definition surj_from_to
=C2=A0 where "surj_from_to= a b f =3D (f ` a =3D b)"

context
=C2=A0 fixes f c P
=C2= =A0 assumes f[intro, simp, cs_simps]: "surj_from_to a b f =E2=9F=B9 x = =E2=88=88 a =E2=9F=B9 f x =3D c + x"
=C2=A0 =C2=A0 and [intro, simp= , cs_intros]: "P a b x =E2=9F=B9 surj_from_to a b f"
=C2=A0 = =C2=A0 and [intro, simp, cs_intros]: "P a b x =E2=9F=B9 c + x =3D x&qu= ot;
begin

lemma
=C2=A0 assumes "P a b x" and "x= =E2=88=88 a"
=C2=A0 shows "f x =3D x"
=C2=A0 using as= sms oops (*by simp, auto, force, fast, fastforce, blast*)

lemma
= =C2=A0 assumes "P a b x" and "x =E2=88=88 a"
=C2=A0 = shows "f x =3D x"
=C2=A0 using assms by (cs_concl cs_simp: cs_= simps cs_intro: cs_intros)

end

<= div class=3D"gmail_quote">
On Mon, Dec= 28, 2020 at 1:07 PM Lawrence Paulson <lp15 at cam.ac.uk> wrote:
Dear Mikhail, this sounds intriguing, thou= gh intro-resolution and conditional rewriting will behave similarly in many= cases. Do you have simple examples to demonstrate where intro-rewriting wo= rks better? I imagine they may involve variable instantiation (i.e. P(x) = =3D=3D> l=3Dr, where x is not mentioned in l).

Larry

> On 27 Dec 2020, at 15:58, Mikhail Chekhov <mikhail.chekhov.w at gmail.com>= ; wrote:
>
> From the manual of the simplifier: "conditions in conditional rew= rite rules are solved recursively before the rewrite rule is applied".= Empirically, I have established that it could be useful to be able to trea= t rewriting in the same manner as intro-resolution, allowing the side condi= tions of the rewrite rules to be resolved both using rewriting or intro-res= olution after the application of the rewrite rule to a given goal (of cours= e, this is also meant to be done recursively). I devised a prototype method= based on this algorithm (CS in https://gi= tlab.com/user9716869/Isabelle-Complement-Library). For my own needs, pr= actically, I found this type of 'coupling' of rewriting and intro-r= esolution to be exceptionally capable at solving complex goals in compariso= n with some of the existing tools that seem to combine simplification and c= lassical reasoning that I tried before (by now, for my own needs, I rely on= the methods provided by CS almost exclusively in a reasonably sizeable dev= elopment).