The third homomorphism theorem on trees
From MaRDI portal
Publication:5261516
DOI10.1145/1480881.1480905zbMath1315.68067OpenAlexW2040345331MaRDI QIDQ5261516
Zhenjiang Hu, Kiminori Matsuzaki, Masato Takeichi, Akimasa Morihata
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1480881.1480905
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Data structures (68P05)
Related Items
Counterexample-guided partial bounding for recursive function synthesis ⋮ Filter-embedding semiring fusion for programming with MapReduce ⋮ Incremental Computing with Abstract Data Structures ⋮ Lambda calculus with algebraic simplification for reduction parallelisation: Extended study