POPLMark reloaded: Mechanizing proofs by logical relations

Author:

ABEL ANDREAS,ALLAIS GUILLAUMEORCID,HAMEER ALIYA,PIENTKA BRIGITTE,MOMIGLIANO ALBERTOORCID,SCHÄFER STEVEN,STARK KATHRIN

Abstract

Abstract We propose a new collection of benchmark problems in mechanizing the metatheory of programming languages, in order to compare and push the state of the art of proof assistants. In particular, we focus on proofs using logical relations (LRs) and propose establishing strong normalization of a simply typed calculus with a proof by Kripke-style LRs as a benchmark. We give a modern view of this well-understood problem by formulating our LR on well-typed terms. Using this case study, we share some of the lessons learned tackling this problem in different dependently typed proof environments. In particular, we consider the mechanization in Beluga, a proof environment that supports higher-order abstract syntax encodings and contrast it to the development and strategies used in general-purpose proof assistants such as Coq and Agda. The goal of this paper is to engage the community in discussions on what support in proof environments is needed to truly bring mechanized metatheory to the masses and engage said community in the crafting of future benchmarks.

Publisher

Cambridge University Press (CUP)

Subject

Software

Reference118 articles.

1. Applied Type System

2. Werner, B. (1992) A normalization proof for an impredicative type system with large elimination over integers. In International Workshop on Types for Proofs and Programs (TYPES), pp. 341–357.

3. Binders unbound

4. A Concurrent Logical Framework I: Judgments and Properties

5. Reasoning about higher-order relational specifications

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq;ACM Transactions on Programming Languages and Systems;2023-07-20

2. Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version;Journal of Automated Reasoning;2023-07-05

3. A Formal Proof of the Strong Normalization Theorem for System T in Agda;Electronic Proceedings in Theoretical Computer Science;2023-03-23

4. From Fine- to Coarse-Grained Dynamic Information Flow Control and Back;Foundations and Trends® in Programming Languages;2023

5. Formal Reasoning Using Distributed Assertions;Frontiers of Combining Systems;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3