Functional programs as compressed data

Kobayashi, Naoki; Matsuda, Kazutaka; Shinohara, Ayumi; Yaguchi, Kazuya

doi:10.1007/s10990-013-9093-z

Cited by 22 publications

(18 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We, therefore, use intersection types (a la Kobayashi and Ong's intersection types for HORS model checking [21]) to represent summary information on how each function traverses states of the automaton, and replicate each function and its arguments for each type. We thus formalize the translation as an intersection-type-based program transformation; related transformation techniques are found in [8,11,12,20,38]. …”

Section: Example 10 Consider the Automatonmentioning

confidence: 99%

Higher-Order Program Verification via HFL Model Checking

Kobayashi

Tsukada

Watanabe

2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those program properties. Compared with the previous approaches based on HORS model checking, our approach provides a more uniform, streamlined method for higher-order program verification.

show abstract

Section: Example 10 Consider the Automatonmentioning

confidence: 99%

Higher-Order Program Verification via HFL Model Checking

Kobayashi

Tsukada

Watanabe

2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is interesting to note, that a similar emphasis is apparent in recent work on mutual interpretability of Peano Arithmetic and finite ZF Set Theory's axiom systems [5] and on connecting heterogeneous data types through bijective mappings [6], [7], [8].…”

Section: Introductionmentioning

confidence: 87%

Computing with Free Algebras

Tarau

2012

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

View full text Add to dashboard Cite

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers.Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. Implementations using GHC's view construct are discussed, based on the free algebra of rooted ordered binary trees.Keywords-arithmetic computations with free algebras; generalized constructors; declarative modeling of computational phenomena; bijective Gödel numberings and algebraic datatypes.

show abstract

“…The approaches [6], [19] and [20] follow different approaches on how to compute updates on grammar-compressed XML data. A generalization of grammar-based compression to functional programs representing the compressed tree data was presented in [21].…”

Section: Related Workmentioning

confidence: 99%

ECST – Extended Context-Free Straight-Line Tree Grammars

et al. 2015

View full text Add to dashboard Cite

Abstract. Grammar-based compressors like e.g. CluX [1], BPLEX [2], TreeRePAIR [3] transform an XML tree X into a context-free straight-line linear tree (CSLT) grammar G and yield strong compression ratios compared to other classes of XML-specific compressors. However, CSLT grammars have the disadvantage that simulating on G update operations like inserting, deleting, or re-labeling a node V of X requires to isolate the path from X's root to V from all the paths represented by G. Usually, this leads to an increased redundancy within G, as grammar rules are copied and modified, but the original and the modified grammar rules often differ only slightly. In this paper, we propose extended context-free straight-line tree (ECST) grammars that allow reducing the redundancy created by path isolation. Furthermore, we show how to query and how to update ECST compressed grammars.

show abstract

Functional programs as compressed data

Cited by 22 publications

References 31 publications

Higher-Order Program Verification via HFL Model Checking

Higher-Order Program Verification via HFL Model Checking

Computing with Free Algebras

ECST – Extended Context-Free Straight-Line Tree Grammars

Contact Info

Product

Resources

About