Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

APLAS
2005
ACM

favoriteEmaildiscussreport

91views Programming Languages» more APLAS 2005»

Termination Analysis of Higher-Order Functional Programs

14 years 4 months ago

Termination Analysis of Higher-Order Functional Programs

Download metacomp.comlab.ox.ac.uk

Damien Sereni, Neil D. Jones

Real-time Traffic

APLAS 2005 |

claim paper

Related Content

» Adapting functional programs to higher order logic

» Higher Order Deforestation

» Positive supercompilation for a higher order callbyvalue language

» Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

» Termination in HigherOrder Concurrent Calculi

» HigherOrder Lazy Functional Slicing

» Inferring Cost Equations for Recursive Polymorphic and HigherOrder Functional Programs

» HigherOrder Narrowing

» Recursive Functions with Higher Order Domains

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	APLAS
Authors	Damien Sereni, Neil D. Jones

Comments (0)