The Fourth International Workshop on Coq for Programming LanguagesCoqPL 2018
The series of CoqPL workshops provide an opportunity for programming languages researchers to meet and interact with one another and members from the core Coq development team. At the meeting, we will discuss upcoming new features, see talks and demonstrations of exciting current projects, solicit feedback for potential future changes, and generally work to strengthen the vibrant community around our favorite proof assistant.
- General purpose libraries and tactic language extensions
- Domain-specific libraries for programming language formalization and verification
- IDEs, profilers, tracers, debuggers, and testing tools
- Reports on ongoing proof efforts conducted via (or in the context of) the Coq proof assistant
- Experience reports from Coq usage in educational or industrial contexts
The workshop format will be driven by you, members of the community. We will solicit abstracts for talks and proposals for demonstrations and flesh out format details based on responses. We expect the final program to include experiment reports, panel discussions, and invited talks (details TBA). Talks will be selected according to relevance to the workshop, based on the submission of an extended abstract.
To foster open discussion of cutting edge research which can later be published in full conference proceedings, we will not publish papers from the workshop. However, presentations will be recorded and the videos made publicly available.
Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length (excluding the bibliography). We suggest formatting the text using the two-column ACM SIGPLAN latex style (9pt font). Templates are available from the ACM SIGPLAN page: http://www.sigplan.org/Resources/Author.
For any queries, please contact :
coqpl2018 at easychair.org.
Sat 13 Jan Times are displayed in time zone: Tijuana, Baja California change
09:00 - 10:00
|CoqHammer: Strong Automation for Program Verification|
10:30 - 12:10
|A “destruct” Tactic for Mtac2|
|Typed Template Coq|
Simon Boulier, Matthieu SozeauInria, Nicolas TabareauInria, France, Abhishek AnandCornell UniversityFile Attached
|Elpi: an extension language for Coq|
Enrico TassiINRIAFile Attached
|Coqatoo: Generating Natural Language Versions of Coq Proofs|
Andrew BedfordLaval UniversityFile Attached
14:00 - 14:50
|Locally Nameless at Scale|
Stephanie WeirichUniversity of Pennsylvania, USA, Antoine VoizardUniversity of Pennsylvannia, Anastasiya Kravchuk-Kirilyuk University of PennsylvaniaFile Attached
|A Coq Formalisation of a Core of R|
Martin BodinCMMFile Attached
14:50 - 15:30
|Session with the Coq Development Team|
16:00 - 18:05
|Phantom Types for Quantum Programs|
Robert RandUniversity of Pennsylvania, Jennifer PaykinUniversity of Pennsylvania, Steve ZdancewicUniversity of PennsylvaniaFile Attached
|Revisiting Parametricity: Inductives and Uniformity of Propositions|
|Towards Context-Aware Data Refinement|
|Mechanizing the Construction and Rewriting of Proper Functions in Coq|
Edwin WestbrookGalois, Inc.File Attached
|A calculus for logical refinements in separation logic|