Index of /~lloyd/tildeFP/LML/Examples

[ICO]NameLast modifiedSizeDescription

[PARENTDIR]Parent Directory  -  
[DIR]EditDistance/2017-02-21 14:02 -  
[   ]cont.gen.m2017-02-21 14:02 1.6K 
[   ]curry.m2017-02-21 14:02 365  
[TXT]curry.t2017-02-21 14:02 382  
[   ]eg.IO.m2017-02-21 14:02 178  
[   ]eg.cont.m2017-02-21 14:02 745  
[   ]eg.throw.m2017-02-21 14:02 36  
[   ]fact.m2017-02-21 14:02 112  
[   ]hello.m2017-02-21 14:02 41  
[   ]lcs.m2017-02-21 14:02 836  
[   ]lcs.slow.m2017-02-21 14:02 288  
[   ]mappam.m2017-02-21 14:02 670  
[TXT]mappam.t2017-02-21 14:02 665  
[   ]ones.m2017-02-21 14:02 31  
[   ]parentheses.m2017-02-21 14:02 384  
[   ]split.m2017-02-21 14:02 185  
[   ]stableMarriage.m2017-02-21 14:02 36  
[   ]y.m2017-02-21 14:02 274  


Lazy ML examples.

 *.m   -- Lazy ML program source code
 *.t   -- type information from lmlc
cont.gen.m
Continuation-style generator, illustrated by a solution to the N-Queens problem:
L. Allison, Continuations Implement Generators and Streams,
[The Computer Journal, V33, No5, pp460-465, 1990],
[Pascal].

Copyright © L. Allison / 1994