Ackermann’s Function: A Study in the Efficiency of Calling Procedures (1976)

Cached

Download Links

by B. A. Wichmann
Venue:BIT
Citations:6 - 2 self

Active Bibliography

6 Computing Science – Ph Thesis, Patrick M. Sansom, Patrick M. Sansom - 1994
Execution Profiling for . . . – Patrick M. Sansom - 1994
4 How To Call Procedures, or Second Thoughts on Ackermann’s Function. Software Practice and Experience 7 – B. A. Wichmann - 1977
88 A Synthetic Benchmark – H J Curnow, B A Wichmann, Tij Si - 1976
13 Reducing The Impact Of Register Pressure On Software Pipelined Loops – Josep Llosa, Margarita Espuny - 1996
54 Bandit Problems – Daniel M. Berry - 1985
OzFun: A Functional Language for Mixed Eager and Lazy Programming – Kai Ibach
10 Pattern-Based Languages for Prototyping of Compiler Optimizers – Charles Donald Farnum - 1990
1 Interpreting functions as π-calculus processes: a tutorial – Davide Sangiorgi - 1999
MSc in Logic – Karel Van Oudheusden, Alias Edgar G. Daylight - 2009
5 Reflections on Reflections – Gilles Barthe, John Hatcliff, Morten Heine Sørensen - 1997
5 On the call-by-value CPS transform and its semantics – Carsten Führmann , Hayo Thielecke - 2004
8 Thunks (continued) – Olivier Danvy, John Hatcliff - 1992
21 Thunks and the λ-calculus – John Hatcliff, Olivier Danvy - 1997
2 Termination of Lazy Rewriting Revisited – Felix Schernhammer, Bernhard Gramlich - 2007
26 CPS Transformation after Strictness Analysis – Olivier Danvy, John Hatcliff, Cv Ffi S - 1993
23 Lazy rewriting on eager machinery – Wan Fokkink, Pum Walters, Jasper Kamperman - 2000
6 Environments, Continuation Semantics and Indexed Categories – John Power, Hayo Thielecke - 1997
Dijkstra’s Rallying Cry for Generalization: The Advent of the Recursive Procedure, late 1950s — early 1960s – Edgar G. Daylight - 2010