Functional programs as compressed data

DOI10.1007/s10990-013-9093-zzbMath1360.68332OpenAlexW2133567912MaRDI QIDQ526441

Kazutaka Matsuda, Naoki Kobayashi, Ayumi Shinohara, Kazuya Yaguchi

Publication date: 15 May 2017

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-013-9093-z

zbMATH Keywords

data compressionprogram transformationhigher-order model checkingfunctional programssemantics-based program manipulation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Grammar-Based Tree Compression ⋮ Tree compression using string grammars ⋮ Compaction of Church numerals ⋮ Lambda calculus with algebraic simplification for reduction parallelisation: Extended study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• High level tree transducers and iterated pushdown tree transducers
• Tree transducers, L systems, and two-way machines
• The IO- and OI-hierarchies
• Complete restrictions of the intersection type discipline
• The typed lambda-calculus is not elementary recursive
• Intersection type assignment systems
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Collage system: A unifying framework for compressed pattern matching.
• A fully linear-time approximation algorithm for grammar-based compression
• A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
• A filter lambda model and the completeness of type assignment
• Decidability of higher-order matching
• XML Type Checking Using High-Level Tree Transducer
• The Smallest Grammar Problem
• Untyped Recursion Schemes and Infinite Intersection Types
• Bottom-up and top-down tree transformations— a comparison
• Jewels of Stringology
• Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
• Functional pearl
• Types and higher-order recursion schemes for verification of higher-order programs
• Foundations of Software Science and Computation Structures
• Model Checking Higher-Order Programs
• Automata, Languages and Programming
• Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

This page was built for publication: Functional programs as compressed data