Flow analysis of lazy higher-order functional programs

DOI10.1016/J.TCS.2006.12.030MaRDI QIDQ879358zbMATHOpenAlexFDO

Authors N. E. Zubov

Publication date 11 May 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.12.030

zbMATH Keywords

lazy evaluationterm rewriting systemcollecting semanticshigher-order programprogram flow analysisReynolds analysis of applicative LISP programstree grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cites work

• scientific article; zbMATH DE number 3907750 (Why is no real title available?)
• scientific article; zbMATH DE number 3938547 (Why is no real title available?)
• scientific article; zbMATH DE number 3960961 (Why is no real title available?)
• scientific article; zbMATH DE number 3967886 (Why is no real title available?)
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 3755850 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 1332637 (Why is no real title available?)
• scientific article; zbMATH DE number 3303661 (Why is no real title available?)
• Flow analysis of lazy higher-order functional programs
• Frontiers of Combining Systems
• Programs as data objects. Proceedings of a Workshop, Copenhagen, Denmark, October 17--19, 1985
• Rewriting Techniques and Applications
• Termination checking with types
• Tree generating regular systems

Cited in

(23)

• Modular, higher order cardinality analysis in theory and practice
• Analysing the complexity of functional programs: higher-order meets first-order
• scientific article; zbMATH DE number 177794 (Why is no real title available?)
• Termination criteria for tree automata completion
• Controlled term rewriting
• Infinitary combinatory reduction systems
• scientific article; zbMATH DE number 1954101 (Why is no real title available?)
• scientific article; zbMATH DE number 4011905 (Why is no real title available?)
• scientific article; zbMATH DE number 4106261 (Why is no real title available?)
• Equational approximations for tree automata completion
• Verification of tree-processing programs via higher-order model checking
• scientific article; zbMATH DE number 3947616 (Why is no real title available?)
• Flow analysis of lazy higher-order functional programs
• Possibilities and limitations of call-by-need space improvement
• Improved functional flow and reachability analyses using indexed linear tree grammars
• Term rewriting with prefix context constraints and bottom-up strategies
• Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
• Order-of-demand analysis for lazy languages
• Systematic abstraction of abstract machines
• Constructed product result analysis for Haskell
• Reachability analysis of innermost rewriting
• Modular, higher-order cardinality analysis in theory and practice
• scientific article; zbMATH DE number 1130261 (Why is no real title available?)

Describes a project that uses

Uses Software

• Haskell
• Refal

This page was built for publication: Flow analysis of lazy higher-order functional programs

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