Finiteness analysis in polynomial time

DOI10.1007/3-540-45789-5_34MaRDI QIDQ4411980zbMATH OpenFDO

Authors Chin Soon Lee

Publication date 13 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2477/24770493.htm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Termination analysis for offline partial evaluation of a higher order functional language
• scientific article; zbMATH DE number 1438809
• Fast offline partial evaluation of logic programs
• scientific article; zbMATH DE number 2084340
• Sonic partial deduction

Cited in

(5)

• Fast offline partial evaluation of logic programs
• Maximally-polyvariant partial evaluation in polynomial time
• Fixed-Point Definability and Polynomial Time
• scientific article; zbMATH DE number 1438809 (Why is no real title available?)
• Termination analysis for offline partial evaluation of a higher order functional language

This page was built for publication: Finiteness analysis in polynomial time

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