## 抄録

We consider the problem of how to compactly encode simply-Typed λ-Terms into bit strings. The work has been motivated by Kobayashi et al.'s recent work on higher-order data compression, where data are encoded as functional programs (or, λ-Terms) that generate them. To exploit its good compression power, the compression scheme has to come with a method for compactly encoding the λ-Terms into bit strings. To this end, we propose two type-based bit-encoding schemes; the first one encodes a λ-Term into a sequence of symbols by using type information, and then applies arithmetic coding to convert the sequence to a bit string. The second one is more sophisticated; we prepare a context-free grammar (CFG) that describes only well-Typed terms, and then use a variation of arithmetic coding specialized for the CFG. We have implemented both schemes and confirmed that they often output more compact codes than previous bit encoding schemes for λ-Terms.

本文言語 | English |
---|---|

ページ（範囲） | 146-157 |

ページ数 | 12 |

ジャーナル | ACM SIGPLAN Notices |

巻 | 51 |

号 | 9 |

DOI | |

出版ステータス | Published - 2016 9月 4 |

## ASJC Scopus subject areas

- コンピュータ サイエンス（全般）