经过认证的总序列化器，应用于哈夫曼编码

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

Journal of Functional Programming Pub Date : 2023-12-12 DOI:10.1017/s095679682200017x

RALF HINZE

{"title":"经过认证的总序列化器，应用于哈夫曼编码","authors":"RALF HINZE","doi":"10.1017/s095679682200017x","DOIUrl":null,"url":null,"abstract":"<p>The other day, I was assembling lecture material for a course on Agda. Pursuing an application-driven approach, I was looking for correctness proofs of popular algorithms. One of my all-time favourites is Huffman data compression (Huffman, 1952). Even though it is probably safe to assume that you are familiar with this algorithmic gem, a brief reminder of the essential idea may not be amiss.</p>","PeriodicalId":15874,"journal":{"name":"Journal of Functional Programming","volume":"140 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Certified, total serialisers with an application to Huffman encoding\",\"authors\":\"RALF HINZE\",\"doi\":\"10.1017/s095679682200017x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The other day, I was assembling lecture material for a course on Agda. Pursuing an application-driven approach, I was looking for correctness proofs of popular algorithms. One of my all-time favourites is Huffman data compression (Huffman, 1952). Even though it is probably safe to assume that you are familiar with this algorithmic gem, a brief reminder of the essential idea may not be amiss.</p>\",\"PeriodicalId\":15874,\"journal\":{\"name\":\"Journal of Functional Programming\",\"volume\":\"140 1\",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-12-12\",\"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/s095679682200017x\",\"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/s095679682200017x","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 0

摘要

前几天，我正在为一门关于 Agda 的课程准备授课材料。我采用应用驱动的方法，寻找流行算法的正确性证明。我最喜欢的算法之一是哈夫曼数据压缩法（Huffman，1952 年）。尽管可以肯定的是，你对这一算法瑰宝并不陌生，但简单提醒一下其基本思想也未尝不可。

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

查看原文本刊更多论文

Certified, total serialisers with an application to Huffman encoding

The other day, I was assembling lecture material for a course on Agda. Pursuing an application-driven approach, I was looking for correctness proofs of popular algorithms. One of my all-time favourites is Huffman data compression (Huffman, 1952). Even though it is probably safe to assume that you are familiar with this algorithmic gem, a brief reminder of the essential idea may not be amiss.

求助全文

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

来源期刊

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.