Flow analysis of lazy higher-order functional programs
From MaRDI portal
Publication:879358
DOI10.1016/j.tcs.2006.12.030zbMath1111.68017OpenAlexW2006990447MaRDI QIDQ879358
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
lazy evaluationterm rewriting systemcollecting semanticshigher-order programprogram flow analysisReynolds analysis of applicative LISP programstree grammar
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)
Related Items (9)
Unnamed Item ⋮ Systematic abstraction of abstract machines ⋮ Controlled Term Rewriting ⋮ Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies ⋮ Flow analysis of lazy higher-order functional programs ⋮ Equational approximations for tree automata completion ⋮ Verification of tree-processing programs via higher-order mode checking ⋮ Infinitary combinatory reduction systems ⋮ Termination criteria for tree automata completion
Uses Software
Cites Work
- Flow analysis of lazy higher-order functional programs
- Programs as data objects. Proceedings of a Workshop, Copenhagen, Denmark, October 17--19, 1985
- Termination checking with types
- Frontiers of Combining Systems
- Tree generating regular systems
- Rewriting Techniques and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Flow analysis of lazy higher-order functional programs