ICFP 2007 - PDF Preprint Papers

ICFP 2007 International Conference on Functional Programming

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICFP-2007 Paper

click to vote

ICFP
2007
ACM

171views Programming Languages» more ICFP 2007»

Termination analysis and call graph construction for higher-order functional programs

14 years 4 months ago

Download metacomp.comlab.ox.ac.uk

The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...

Damien Sereni

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	171	Termination analysis and call graph construction for higher-order functional programs	claim
2	154	Experience report: scheme in commercial web application development	claim
3	149	Compiling with continuations, continued	claim
4	148	Lazy call-by-value evaluation	claim
5	141	Adding delimited and composable control to a production programming environment	claim
6	141	Feedback directed implicit parallelism	claim
7	128	Stream fusion: from lists to streams to nothing at all	claim
8	126	Type-safe higher-order channels in ML-like languages	claim
9	123	Bidirectionalization transformation based on automatic derivation of view complement functions	claim
10	115	iTasks: executable specifications of interactive work flow systems for the web	claim
11	114	Experience report: building an eclipse-based IDE for Haskell	claim
12	113	Relating complexity and precision in control flow analysis	claim
13	112	Functional pearl: the great escape or, how to jump the border without getting caught	claim
14	110	On Barron and Strachey's cartesian product function	claim
15	110	McErlang: a model checker for a distributed functional programming language	claim
16	109	Ott: effective tool support for the working semanticist	claim
17	102	A type system for recursive modules	claim
18	99	Tangible functional programming	claim
19	99	Call-pattern specialisation for haskell programs	claim
20	96	A type directed translation of MLF to system F	claim
21	95	User-friendly functional programming for web mashups	claim
22	95	Extensible pattern matching via a lightweight language extension	claim
23	94	Faster laziness using dynamic pointer tagging	claim
24	91	Inductive reasoning about effectful data types	claim
25	91	Subtyping and intersection types revisited	claim
26	88	Implicit phasing for R6RS libraries	claim
27	88	A generic usage analysis with subeffect qualifiers	claim
28	84	Experience report: the reactis validation tool	claim
29	84	Evaluating high-level distributed language constructs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers