Geoffrey L. Burn The Abstract interpretation of Higher-Order Functional Languages: From Properties to Absract Domains (Technical Summary). [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:56-72 [Conf]
Kei Davis A Note on the Choice of Domains for Projection-Based Program Analysis. [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:73-81 [Conf]
Alain Deutsch An Operational Model of Strictness Properties and Its Abstractions (Extended Abstract). [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:82-99 [Conf]
Lars Rossen From Primitive Recursive Functions to Silicon through Relations. [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:253-264 [Conf]
Nick Rothwell Functional Compilation from the Standard ML Core Language to Lambda Calculus. [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:265-277 [Conf]
Colin Runciman TIP in Haskell - another Exercise in Functional Programming. [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:278-292 [Conf]
Paul Sanders Experiments in Haskell - A Network Simulation Algorithm. [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:293-297 [Conf]
David Sands Operational Theories of Improvement in Functional Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:298-311 [Conf]
Patrick M. Sansom Combining Single-Space and Two-Space Compacting Garbage Collectors. [Citation Graph (0, 0)][DBLP] Functional Programming, 1991, pp:312-323 [Conf]