Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Termination of Mutually Recursive Functions with Several Arguments
 

Summary: Slide 1
Termination of Mutually Recursive Functions
with Several Arguments
by Lexicographic Orderings
Andreas Abel
April 6, 2000
Slide 2
Example
fun flat [] = []
| flat (l::ls) = aux l ls
and aux [] ls = flat ls
| aux (x::xs) ls = x :: aux xs ls;
flat( < ) 77
<
<
!!
aux
< ?
? gg
( ? )

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences