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

DOI10.1007/3-540-61739-6_34zbMATH Open1483.68080OpenAlexW1563764837MaRDI QIDQ5030188FDOQ5030188

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1438809
• scientific article; zbMATH DE number 1948415
• Programming Languages and Systems
• Termination analysis for partial functions
• scientific article; zbMATH DE number 756052

zbMATH Keywords

abstract interpretationpartial evaluationterminationsize analysis

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Theorems on Classes of Recursively Enumerable Sets
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Control-flow refinement by partial evaluation, and its application to termination and cost analysis
• A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Termination analysis for functional programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030188)