Fabien Renaud (at LIX & INRIA) conducted a simple experiment on compiling
several simple but long lambda Prolog files. Attached you can find a python
script that generated the sample programs as well as a small .mod and .sig
file. Fabien collected the following data on his desktop machine (most recent
version of tjcc as of today).
Number of clauses Time
1000 0m0.238s
2000 0m1.478s
4000 0m10.181s
8000 1m3.939s
16000 7m45.037s
From the graph plotted in the attached .pdf file, you can see that this limited
data suggests an exponential growth.
Original issue reported on code.google.com by dale.a.m...@gmail.com on 12 Nov 2012 at 4:09
Original issue reported on code.google.com by
dale.a.m...@gmail.comon 12 Nov 2012 at 4:09Attachments: