Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 12
Shifting the stage: Staging with delimited control
- Part of:
-
- Published online by Cambridge University Press:
- 23 November 2011, pp. 617-662
-
- Article
-
- You have access
- Export citation
- Cited by 12
Combinators for breadth-first search
-
- Published online by Cambridge University Press:
- 03 November 2000, pp. 397-408
-
- Article
-
- You have access
- Export citation
- Cited by 12
The logic of demand in Haskell
-
- Published online by Cambridge University Press:
- 21 July 2005, pp. 837-891
-
- Article
-
- You have access
- Export citation
- Cited by 12
Fortifying macros
- Part of:
-
- Published online by Cambridge University Press:
- 15 August 2012, pp. 439-476
-
- Article
-
- You have access
- Export citation
- Cited by 12
Building reliable, high-performance networks with the Nuprl proof development system
-
- Published online by Cambridge University Press:
- 14 January 2004, pp. 21-68
-
- Article
-
- You have access
- Export citation
- Cited by 12
Counting and generating terms in the binary lambda calculus*
- Part of:
-
- Published online by Cambridge University Press:
- 29 December 2015, e24
-
- Article
-
- You have access
- Export citation
- Cited by 12
Oracle-guided scheduling for controlling granularity in implicitly parallel languages*
- Part of:
-
- Published online by Cambridge University Press:
- 10 November 2016, e23
-
- Article
-
- You have access
- Export citation
- Cited by 12
Small-step and big-step semantics for call-by-need
- Part of:
-
- Published online by Cambridge University Press:
- 07 September 2009, pp. 699-722
-
- Article
-
- You have access
- Export citation
- Cited by 12
Gradual type-and-effect systems
- Part of:
-
- Published online by Cambridge University Press:
- 22 September 2016, e19
-
- Article
-
- You have access
- Export citation
- Cited by 12
EDUCATIONAL PEARL: Automata via macros
-
- Published online by Cambridge University Press:
- 25 October 2016, pp. 253-267
-
- Article
-
- You have access
- Export citation
- Cited by 11
Testing noninterference, quickly
- Part of:
-
- Published online by Cambridge University Press:
- 05 April 2016, e4
-
- Article
-
- You have access
- Export citation
- Cited by 11
Algebras for combinatorial search
- Part of:
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 469-487
-
- Article
-
- You have access
- Export citation
- Cited by 11
On the specialization of online program specializers1
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 251-281
-
- Article
-
- You have access
- Export citation
- Cited by 11
From natural semantics to C: A formal derivation of two STG machines
- Part of:
-
- Published online by Cambridge University Press:
- 01 January 2009, pp. 47-94
-
- Article
-
- You have access
- Export citation
- Cited by 11
THEORETICAL PEARL Church numerals, twice!
-
- Published online by Cambridge University Press:
- 08 December 2004, pp. 1-13
-
- Article
-
- You have access
- Export citation
- Cited by 11
An overview of the Flagship system
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 19-45
-
- Article
-
- You have access
- Export citation
- Cited by 11
A critique of Standard ML
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 391-429
-
- Article
-
- You have access
- Export citation
- Cited by 11
Implicit self-adjusting computation for purely functional programs
- Part of:
-
- Published online by Cambridge University Press:
- 31 March 2014, pp. 56-112
-
- Article
-
- You have access
- Export citation
- Cited by 11
Program equivalence in a linear functional language
-
- Published online by Cambridge University Press:
- 01 March 2000, pp. 167-190
-
- Article
-
- You have access
- Export citation
- Cited by 11
Three algorithms on Braun trees
-
- Published online by Cambridge University Press:
- 01 November 1997, pp. 661-666
-
- Article
-
- You have access
- Export citation