Flow analysis of lazy higher-order functional programs
DOI10.1016/J.TCS.2006.12.030zbMATH Open1111.68017OpenAlexW2006990447MaRDI QIDQ879358FDOQ879358
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
Recommendations
lazy evaluationterm rewriting systemcollecting semanticshigher-order programprogram flow analysisReynolds analysis of applicative LISP programstree grammar
Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Frontiers of Combining Systems
- Rewriting Techniques and Applications
- Tree generating regular systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Flow analysis of lazy higher-order functional programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programs as data objects. Proceedings of a Workshop, Copenhagen, Denmark, October 17--19, 1985
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination checking with types
Cited In (23)
- Infinitary combinatory reduction systems
- Title not available (Why is that?)
- Constructed product result analysis for Haskell
- Flow analysis of lazy higher-order functional programs
- Systematic abstraction of abstract machines
- Modular, higher-order cardinality analysis in theory and practice
- Term rewriting with prefix context constraints and bottom-up strategies
- Verification of tree-processing programs via higher-order model checking
- Title not available (Why is that?)
- Equational approximations for tree automata completion
- Controlled term rewriting
- Reachability analysis of innermost rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved functional flow and reachability analyses using indexed linear tree grammars
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- Possibilities and limitations of call-by-need space improvement
- Analysing the complexity of functional programs: higher-order meets first-order
- Order-of-demand analysis for lazy languages
- Termination criteria for tree automata completion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular, higher order cardinality analysis in theory and practice
Uses Software
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)
