博士论文摘要

IF 1.1 3区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Journal of Functional Programming Pub Date : 2022-12-23 DOI:10.1017/S0956796822000144

G. Hutton

{"title":"博士论文摘要","authors":"G. Hutton","doi":"10.1017/S0956796822000144","DOIUrl":null,"url":null,"abstract":"The λ -calculus is considered the paradigmatic model for functional programming languages, and it is based on a rewriting mechanism. It comes with a beautiful mathematical theory, which has been studied and improved for more than 80 years. Rewriting expressions is common in computer science, but it is not the way in which programs are executed by the hardware. While the semantics of programs remains unaltered during compilation, the use of resources, in particular time and space, is more difﬁcult to track. Slot and van Emde Boas Invariance Thesis states some requirements for a computational model to be reasonable . The rationale is that under the Invariance Thesis, complexity classes such as LOGSPACE and PTIME, become robust, i.e","PeriodicalId":15874,"journal":{"name":"Journal of Functional Programming","volume":" ","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PhD Abstracts\",\"authors\":\"G. Hutton\",\"doi\":\"10.1017/S0956796822000144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The λ -calculus is considered the paradigmatic model for functional programming languages, and it is based on a rewriting mechanism. It comes with a beautiful mathematical theory, which has been studied and improved for more than 80 years. Rewriting expressions is common in computer science, but it is not the way in which programs are executed by the hardware. While the semantics of programs remains unaltered during compilation, the use of resources, in particular time and space, is more difﬁcult to track. Slot and van Emde Boas Invariance Thesis states some requirements for a computational model to be reasonable . The rationale is that under the Invariance Thesis, complexity classes such as LOGSPACE and PTIME, become robust, i.e\",\"PeriodicalId\":15874,\"journal\":{\"name\":\"Journal of Functional Programming\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2022-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Functional Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1017/S0956796822000144\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Functional Programming","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/S0956796822000144","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 0

摘要

λ-演算被认为是函数式编程语言的典范模型，它基于重写机制。它带来了一个美丽的数学理论，经过80多年的研究和改进。重写表达式在计算机科学中很常见，但它不是硬件执行程序的方式。虽然程序的语义在编译过程中保持不变，但资源的使用，特别是时间和空间，更难跟踪。Slot和van-Emde-Boas不变性命题提出了计算模型合理的一些要求。其原理是，在不变命题下，复杂度类（如LOGSPACE和PTIME）变得稳健，即

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

查看原文本刊更多论文

PhD Abstracts

The λ -calculus is considered the paradigmatic model for functional programming languages, and it is based on a rewriting mechanism. It comes with a beautiful mathematical theory, which has been studied and improved for more than 80 years. Rewriting expressions is common in computer science, but it is not the way in which programs are executed by the hardware. While the semantics of programs remains unaltered during compilation, the use of resources, in particular time and space, is more difﬁcult to track. Slot and van Emde Boas Invariance Thesis states some requirements for a computational model to be reasonable . The rationale is that under the Invariance Thesis, complexity classes such as LOGSPACE and PTIME, become robust, i.e

求助全文

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

来源期刊

Journal of Functional Programming 工程技术-计算机：软件工程

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. The journal is of interest to computer scientists, software engineers, programming language researchers and mathematicians interested in the logical foundations of programming.