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 6
Integrating region memory management and tag-free generational garbage collection
-
- Published online by Cambridge University Press:
- 22 February 2021, e4
-
- Article
-
- You have access
- Export citation
- Cited by 6
Syntactic accidents in program analysis: on the impact of the CPS transformation
-
- Published online by Cambridge University Press:
- 27 August 2003, pp. 867-904
-
- Article
-
- You have access
- Export citation
- Cited by 6
The countdown problem
-
- Published online by Cambridge University Press:
- 06 November 2002, pp. 609-616
-
- Article
-
- You have access
- Export citation
- Cited by 6
A run-time algorithm for managing the granularity of parallel functional programs1
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 387-405
-
- Article
-
- You have access
- Export citation
- Cited by 6
Encapsulating non-determinacy in an abstract data type with determinate semantics
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 3-20
-
- Article
-
- You have access
- Export citation
- Cited by 6
Web programming in Scheme with LAML
-
- Published online by Cambridge University Press:
- 08 December 2004, pp. 53-65
-
- Article
-
- You have access
- Export citation
- Cited by 6
Big-step normalisation
- Part of:
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 311-333
-
- Article
-
- You have access
- Export citation
- Cited by 6
Computing with lattices: An application of type classes
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 475-503
-
- Article
-
- You have access
- Export citation
- Cited by 6
Worst case scheduling for parallel functional programs1
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 65-75
-
- Article
-
- You have access
- Export citation
- Cited by 6
Gabriel–Ulmer duality and Lawvere theories enriched over a general base
- Part of:
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 265-286
-
- Article
-
- You have access
- Export citation
- Cited by 6
Modular verification of preemptive OS kernels
- Part of:
-
- Published online by Cambridge University Press:
- 29 October 2013, pp. 452-514
-
- Article
-
- You have access
- Export citation
- Cited by 6
Fair enumeration combinators
- Part of:
-
- Published online by Cambridge University Press:
- 30 August 2017, e19
-
- Article
-
- You have access
- Export citation
- Cited by 6
An incremental, exploratory and transformational environment for lazy functional programming
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 93-115
-
- Article
-
- You have access
- Export citation
- Cited by 6
1ML – Core and modules united
-
- Published online by Cambridge University Press:
- 27 December 2018, e22
-
- Article
-
- You have access
- Export citation
- Cited by 6
EQUALS – a fast parallel implementation of a lazy language
-
- Published online by Cambridge University Press:
- 01 March 1997, pp. 183-217
-
- Article
-
- You have access
- Export citation
- Cited by 6
Gradual session types
- Part of:
-
- Published online by Cambridge University Press:
- 18 November 2019, e17
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 6
THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
-
- Published online by Cambridge University Press:
- 25 October 2016, pp. 269-280
-
- Article
-
- You have access
- Export citation
- Cited by 6
A categorical understanding of environment machines
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 23-59
-
- Article
-
- You have access
- Export citation
- Cited by 6
Higher order symbolic execution for contract verification and refutation*
- Part of:
-
- Published online by Cambridge University Press:
- 21 December 2016, e3
-
- Article
-
- You have access
- Export citation
- Cited by 6
Functional Pearls: Deriving tidy drawings of trees
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 535-562
-
- Article
-
- You have access
- Export citation