Termination analysis and call graph construction for higher-order functional programs

DOI10.1145/1291151.1291165zbMath1291.68267OpenAlexW1972318755MaRDI QIDQ5168926

Damien Sereni

Publication date: 21 July 2014

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

Full work available at URL: https://doi.org/10.1145/1291151.1291165

zbMATH Keywords

semanticsprogram analysisterminationfunctional programs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs

Uses Software

• AProVE

This page was built for publication: Termination analysis and call graph construction for higher-order functional programs