The Extended Theory of Trees and Algebraic (Co)datatypes

Zaiser, Fabian; Ong, C.-H. Luke

doi:10.4204/eptcs.320.14

Search citation statements

Order By: Relevance

Paper Sections

Select...

Maher's Theory Of Trees1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Questions of expressivity and complexity of the Maher theory are explored in [8]. Recent work by Zaiser and Ong has improved the performance of Djelloul et al's solver and adapted the theory to algebraic (co)datatypes [34].…”

Section: Maher's Theory Of Treesmentioning

confidence: 99%

Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

Jochems¹

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Higher-order constrained Horn clauses (HoCHC) are a semantically-invariant system of higher-order logic modulo theories. With semi-decidable unsolvability over a semi-decidable background theory, HoCHC is suitable for safety verification. Less is known about its relation to larger classes of higherorder verification problems. Motivated by program equivalence, we introduce a coinductive version of HoCHC that enjoys a greatest model property. We define an encoding of higher-order recursion schemes (HoRS) into HoCHC logic programs. Correctness of this encoding reduces decidability of the open HoRS equivalence problem -and, thus, the λ Y-calculus Böhm tree equivalence problemto semi-decidability of coinductive HoCHC over a complete and decidable theory of trees.

show abstract

Section: Maher's Theory Of Treesmentioning

confidence: 99%

Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

Jochems¹

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

The Extended Theory of Trees and Algebraic (Co)datatypes

Cited by 1 publication

References 12 publications

Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

Contact Info

Product

Resources

About