Our aim is to show that techniques from higherorder strictness analysis may be used as a general algorithmic principle in a functional programming language. Certain problems may be expressed as the search for the least solution that satisfy certain given properties. This is often done using some kind of fixpoint iteration.
We will present a fixpoint operation that can be used for secondorder functions and extend this to higherorder functions.
The technique is based on using partial function graphs to
represent higherorder objects. The main problem in finding
fixpoints for higherorder functions is to establish a
notion of {\em neededness} so as to restrict the iteration
to those parts of the function that may influence the result.
This is here done through a uniform extension of the domain of values with need information. The result is an iteration
strategy which will terminate if base domains are finite.
Originalsprog  Engelsk 

Udgivelses sted  Roskilde 

Udgiver  Roskilde Universitet 

Antal sider  15 

Status  Udgivet  2005 

Citer dette

APA

Author

BIBTEX

Harvard

Standard

RIS

Vancouver
@techreport{144a293052be11dba4bc000ea68e967b,
title = "DemandDriven HigherOrder Fixpoint Iteration",
abstract = "Our aim is to show that techniques from higherorder strictness analysis may be used as a general algorithmic principle in a functional programming language. Certain problems may be expressed as the search for the least solution that satisfy certain given properties. This is often done using some kind of fixpoint iteration. We will present a fixpoint operation that can be used for secondorder functions and extend this to higherorder functions. The technique is based on using partial function graphs to represent higherorder objects. The main problem in finding fixpoints for higherorder functions is to establish a notion of {\em neededness} so as to restrict the iteration to those parts of the function that may influence the result. This is here done through a uniform extension of the domain of values with need information. The result is an iteration strategy which will terminate if base domains are finite.",
author = "Mads Rosendahl",
year = "2005",
language = "English",
publisher = "Roskilde Universitet",
type = "WorkingPaper",
institution = "Roskilde Universitet",
}
TY  UNPB
T1  DemandDriven HigherOrder Fixpoint Iteration
AU  Rosendahl, Mads
PY  2005
Y1  2005
N2  Our aim is to show that techniques from higherorder strictness analysis may be used as a general algorithmic principle in a functional programming language. Certain problems may be expressed as the search for the least solution that satisfy certain given properties. This is often done using some kind of fixpoint iteration.
We will present a fixpoint operation that can be used for secondorder functions and extend this to higherorder functions.
The technique is based on using partial function graphs to
represent higherorder objects. The main problem in finding
fixpoints for higherorder functions is to establish a
notion of {\em neededness} so as to restrict the iteration
to those parts of the function that may influence the result.
This is here done through a uniform extension of the domain of values with need information. The result is an iteration
strategy which will terminate if base domains are finite.
AB  Our aim is to show that techniques from higherorder strictness analysis may be used as a general algorithmic principle in a functional programming language. Certain problems may be expressed as the search for the least solution that satisfy certain given properties. This is often done using some kind of fixpoint iteration.
We will present a fixpoint operation that can be used for secondorder functions and extend this to higherorder functions.
The technique is based on using partial function graphs to
represent higherorder objects. The main problem in finding
fixpoints for higherorder functions is to establish a
notion of {\em neededness} so as to restrict the iteration
to those parts of the function that may influence the result.
This is here done through a uniform extension of the domain of values with need information. The result is an iteration
strategy which will terminate if base domains are finite.
M3  Working paper
BT  DemandDriven HigherOrder Fixpoint Iteration
PB  Roskilde Universitet
CY  Roskilde
ER 