On the complexity of equivalence of specifications of infinite objects

DOI10.1145/2364527.2364551zbMath1291.68142arXiv1207.0158OpenAlexW2100631280MaRDI QIDQ5168890

Dimitri Hendriks, Rena Bakhshi, Jörg Endrullis

Publication date: 21 July 2014

Published in: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.0158

zbMATH Keywords

complexitysemanticslambda termsequalityinfinite objectsequational specifications

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Transducer degrees: atoms, infima and suprema ⋮ Behavioral Rewrite Systems and Behavioral Productivity

This page was built for publication: On the complexity of equivalence of specifications of infinite objects