Functional programs as compressed data

DOI10.1007/S10990-013-9093-ZzbMATH Open1360.68332OpenAlexW2133567912MaRDI QIDQ526441FDOQ526441

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

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

Cites Work

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

Cited In (5)

• Grammar-Based Tree Compression
• Compaction of Church numerals
• Lambda calculus with algebraic simplification for reduction parallelisation: Extended study
• Tree compression using string grammars
• Title not available (Why is that?)

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

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