Functional pearl: every bit counts

DOI10.1145/1863543.1863548MaRDI QIDQ5176924zbMATH OpenOpenAlexFDO

Authors Dimitrios Vytiniotis, Andrew Kennedy

Publication date 5 March 2015

Published in Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1863543.1863548

zbMATH Keywords

decodersencodersgames

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications of game theory (91A80)

Recommendations

• Every bit counts: the binary representation of typed data and programs
• Compact bit encoding schemes for simply-typed lambda-terms
• Functional programs as compressed data
• Efficiency of lambda-encodings in total type theory
• Encoding types in ML-like languages

Cited in

(4)

• Functional pearl
• Compact bit encoding schemes for simply-typed lambda-terms
• Every bit counts: the binary representation of typed data and programs
• Functional programs as compressed data

This page was built for publication: Functional pearl: every bit counts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176924)