Termination analysis for offline partial evaluation of a higher order functional language

DOI10.1007/3-540-61739-6_34zbMath1483.68080OpenAlexW1563764837MaRDI QIDQ5030188

Peter Holst Andersen, Carsten Kehler Holst

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_34

zbMATH Keywords

partial evaluationterminationabstract interpretationsize analysis

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Some Theorems on Classes of Recursively Enumerable Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination analysis for offline partial evaluation of a higher order functional language