scientific article; zbMATH DE number 177794

MaRDI QIDQ4038672zbMATH OpenFDO

Authors David Sands

Publication date 18 May 1993

zbMATH Keywords

cost-closuresfunctional parametersfunctional programmingnecessary-time equationssufficient-time equationstime-analysis of functional programs

Mathematics Subject Classification ID

Theory of programming languages (68N15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Type-based cost analysis for lazy functional languages
• Analysing the complexity of functional programs: higher-order meets first-order
• Denotational cost semantics for functional languages with inductive types
• Flow analysis of lazy higher-order functional programs
• Implementation of Functional Languages

Cited in

(16)

• Order-of-demand analysis for lazy languages
• Automated higher-order complexity analysis
• Game semantics approach to higher-order complexity
• Type-based cost analysis for lazy functional languages
• Linear dependent types in a call-by-value scenario
• Automated complexity analysis of Nuprl extracted programs
• The geometry of types
• Lightweight semiformal time complexity analysis for purely functional data structures
• scientific article; zbMATH DE number 1508929 (Why is no real title available?)
• Verified Root-Balanced Trees
• Strictness and totality analysis with conjunction
• Denotational semantics as a foundation for cost recurrence extraction for functional languages
• Implementation of Functional Languages
• Implicit computation complexity in higher-order programming languages
• Amortized complexity verified
• Flow analysis of lazy higher-order functional programs

This page was built for publication:

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