Moggi计算元语言的强规范化证明的形式化:Isabelle/HOL-nominal案例研究

International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice Pub Date : 2009-08-02 DOI:10.1145/1577824.1577834

C. Doczkal, Jan Schwinghammer

{"title":"Moggi计算元语言的强规范化证明的形式化:Isabelle/HOL-nominal案例研究","authors":"C. Doczkal, Jan Schwinghammer","doi":"10.1145/1577824.1577834","DOIUrl":null,"url":null,"abstract":"Lindley and Stark have given an elegant proof of strong normalization for various lambda calculi whose type systems preclude a direct inductive definition of Girard-Tait style logical relations, such as the simply typed lambda calculus with sum types or Moggi's calculus with monadic computation types. The key construction in their proof is a notion of relational TT-lifting, which is expressed with the help of stacks of evaluation contexts. We describe a formalization of Lindley and Stark's strong normalization proof for Moggi's computational metalanguage in Isabelle/HOL, using the nominal package.","PeriodicalId":262518,"journal":{"name":"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Formalizing a strong normalization proof for Moggi's computational metalanguage: a case study in Isabelle/HOL-nominal\",\"authors\":\"C. Doczkal, Jan Schwinghammer\",\"doi\":\"10.1145/1577824.1577834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Lindley and Stark have given an elegant proof of strong normalization for various lambda calculi whose type systems preclude a direct inductive definition of Girard-Tait style logical relations, such as the simply typed lambda calculus with sum types or Moggi's calculus with monadic computation types. The key construction in their proof is a notion of relational TT-lifting, which is expressed with the help of stacks of evaluation contexts. We describe a formalization of Lindley and Stark's strong normalization proof for Moggi's computational metalanguage in Isabelle/HOL, using the nominal package.\",\"PeriodicalId\":262518,\"journal\":{\"name\":\"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1577824.1577834\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1577824.1577834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

Lindley和Stark给出了各种λ演算的强规范化的优雅证明，这些λ演算的类型系统排除了对Girard-Tait风格逻辑关系的直接归纳定义，例如具有和类型的简单类型λ演算或具有一元计算类型的Moggi演算。他们证明中的关键结构是关系tt提升的概念，这是通过评估上下文堆栈来表达的。我们使用名义包描述了Lindley和Stark在Isabelle/HOL中对Moggi的计算元语言的强规范化证明的形式化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Formalizing a strong normalization proof for Moggi's computational metalanguage: a case study in Isabelle/HOL-nominal

Lindley and Stark have given an elegant proof of strong normalization for various lambda calculi whose type systems preclude a direct inductive definition of Girard-Tait style logical relations, such as the simply typed lambda calculus with sum types or Moggi's calculus with monadic computation types. The key construction in their proof is a notion of relational TT-lifting, which is expressed with the help of stacks of evaluation contexts. We describe a formalization of Lindley and Stark's strong normalization proof for Moggi's computational metalanguage in Isabelle/HOL, using the nominal package.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

自引率

0.00%

发文量