Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Towards Generic Programming with Sized Types Termination of Generic Programs
 

Summary: Towards Generic Programming with Sized Types
Termination of Generic Programs
Andreas Abel
July 3, 2006
MPC'06, Kurressaare, Estonia
Teaser
Termination of Higher­Order Functions
. Recursive function applied to arguments:
f(x) = . . . f(a) . . . f(b) . . .
. Check that a < x, b < x.
. What about a function passed to its argument?
f(g) = . . . g(f) . . .
. How to establish termination of f??
Generic Programs and Termination
. Typical generic program: traversal
. Observation: structurally recursive
. How to substantiate this observation?
. Are all generic programs total on total input?
. Are all generic programs even primitive recursive (catamorphisms)?
Outline

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München

 

Collections: Computer Technologies and Information Sciences