[Hol-info] CPP 2018 2nd call for papers

2017-08-04 Thread Amy Felty

  2ND CALL FOR PAPERS

   The 7th ACM SIGPLAN International Conference
on Certified Programs and Proofs (CPP 2018)

co-located with POPL 2018
  in cooperation with ACM SIGLOG

   http://conf.researchr.org/track/CPP-2018/CPP-2018

 8-9 January, 2018, Los Angeles, USA


NEW
---
 - Format for submitted papers has changed.
 - Invited speakers announced.

Certified Programs and Proofs (CPP) is an international forum on
theoretical and practical topics in all areas, including computer
science, mathematics, and education, that consider certification as an
essential paradigm for their work. Certification here means formal,
mechanized verification of some sort, preferably with production of
independently checkable certificates.


Important dates
---
 - Abstract submission deadline:   Fri 6 Oct 2017
 - Full paper submission deadline: Wed 11 Oct 2017
 - Notification:   Tue 14 Nov 2017
 - Camera-ready deadline:  Sun 26 Nov 2017
 - Conference dates:   Mon 8 - Tue 9 Jan 2018


Topics of interest
--
We welcome submissions in research areas related to formal
certification of programs and proofs. The following is a suggested
list of topics of interests to CPP. This is a non-exhaustive list and
should be read as a guideline rather than a requirement.

 - certified or certifying programming, compilation, linking, OS
   kernels, runtime systems, and security monitors;
 - program logics, type systems, and semantics for certified code;
 - certified decision procedures, mathematical libraries, and
   mathematical theorems;
 - proof assistants and proof theory;
 - new languages and tools for certified programming;
 - program analysis, program verification, and proof-carrying code;
 - certified secure protocols and transactions;
 - certificates for decision procedures, including linear algebra,
   polynomial systems, SAT, SMT, and unification in algebras of
   interest;
 - certificates for semi-decision procedures, including equality,
   first-order logic, and higher-order unification;
 - certificates for program termination;
 - logics for certifying concurrent and distributed programs;
 - higher-order logics, logical systems, separation logics, and logics
   for security;
 - teaching mathematics and computer science with proof assistants.


Submission Guidelines
-

Papers should be submitted in PDF format through the EasyChair
submission page at

  https://easychair.org/conferences/?conf=cpp2018

Submitted papers must be formatted following the ACM SIGPLAN
Proceedings format using the acmart format with the sigplan option,
using 10 point font for the main text.

  http://www.sigplan.org/Resources/Author/

Submitted papers should not exceed 12 pages, including tables and
figures, but excluding bibliography. Shorter papers are welcome and
will be given equal consideration.

Abstracts must be submitted by October 6, 2017 (AOE). The deadline for
full papers is October 11, 2017 (AOE), and authors have the option to
withdraw their papers during the window between the two.

Submissions must be written in English and provide sufficient detail
to allow the program committee to assess the merits of the paper. They
should begin with a succinct statement of the issues, a summary of the
main results, and a brief explanation of their significance and
relevance to the conference, all phrased for the
non-specialist. Technical and formal developments directed to the
specialist should follow. References and comparisons with related work
should be included. Papers not conforming to the above requirements
concerning format and length may be rejected without further
consideration.

Whenever appropriate, the submission should come along with a formal
development, using whatever prover, e.g., Agda, Coq, Dafny, Elf, HOL,
HOL-Light, Isabelle, Lean, Matita, Mizar, NQTHM, PVS, Vampire,
etc. Such formal developments must be submitted together with the
paper as auxiliary material, and will be taken into account during the
reviewing process.

The results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other published conferences or
workshops. The PC chairs should be informed of closely related work
submitted to a conference or journal in advance of
submission. Original formal proofs of known results in mathematics or
computer science are welcome. One author of each accepted paper is
expected to present it at the conference.

For any questions about the formatting or submission of papers, please
consult the PC chairs.


Invited Speakers

 Brigitte Pientka (McGill University, Canada)
 René Thiemann (University of Innsbruck, Austria)

CPP’18 invited speakers are generously funded in part by Galois.


Program Committee
-
 Reynald Affeldt (AIST, Japan)
 June Andronick (Data61, CSIRO and UNSW, Australia), co-chair
 Lennart Beringer (Princeton University, USA)
 

Re: [Hol-info] How to reduce these lambda equations to F?

2017-08-04 Thread Thomas Tuerk
Hi Chun,

via a subgoal, you can introduce an assumption for a concrete argument.
This should be what you need. I'm thinking of something like

First show that a CCS q exists with "q <> p"

`?q. q <> p` by ...

Then use this new q as an argument)

`(\t. t) q = (\t. p) q` by PROVE_TAC[]

Now you are done by BETA reduction and contradicting assumptions.

Best

Thomas



On 04.08.2017 20:22, Chun Tian (binghe) wrote:
> Hi,
>
> This is the first time I met the following goal, in which one of the 
> assumptions should be able to reduce to F (then the goal is resolved):
>
> R (λt. t)
> 
>   4.  (λt. t) = (λt. prefix (label l) t)
>
> The lambda function has the type of ``CCS -> CCS``, which CCS is my datatype 
> defined by HOL’s Define command.  “prefix” is an constructor of CCS datatype. 
>I *know* the equation doesn’t hold, because the whatever input arguments, 
> the resulting CCS on both side must have different “size”, simply because one 
> is the sub-expression of the other.   But how can I actually reduce it to F?
>
> The other case is a little different:
>
> R (λt. t)
> 
>   4.  (λt. t) = (λt. p)
>
> The assumption "(λt. t) = (λt. p)” hold for only one case: when input of 
> lambda function is exactly “p”.  For all other cases the left side doesn’t 
> equal to the right side.  But from the view of two functions, they’re 
> obviously not identical. But how can I actually reduce it to F?
>
> Regards,
>
> Chun Tian
>
>
>
> --
> Check out the vibrant tech community on one of the world's most
> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
>
>
> ___
> hol-info mailing list
> hol-info@lists.sourceforge.net
> https://lists.sourceforge.net/lists/listinfo/hol-info

--
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot___
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info


[Hol-info] How to reduce these lambda equations to F?

2017-08-04 Thread Chun Tian (binghe)
Hi,

This is the first time I met the following goal, in which one of the 
assumptions should be able to reduce to F (then the goal is resolved):

R (λt. t)

  4.  (λt. t) = (λt. prefix (label l) t)

The lambda function has the type of ``CCS -> CCS``, which CCS is my datatype 
defined by HOL’s Define command.  “prefix” is an constructor of CCS datatype.   
 I *know* the equation doesn’t hold, because the whatever input arguments, the 
resulting CCS on both side must have different “size”, simply because one is 
the sub-expression of the other.   But how can I actually reduce it to F?

The other case is a little different:

R (λt. t)

  4.  (λt. t) = (λt. p)

The assumption "(λt. t) = (λt. p)” hold for only one case: when input of lambda 
function is exactly “p”.  For all other cases the left side doesn’t equal to 
the right side.  But from the view of two functions, they’re obviously not 
identical. But how can I actually reduce it to F?

Regards,

Chun Tian



signature.asc
Description: Message signed with OpenPGP using GPGMail
--
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot___
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info