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 17
Perfect trees and bit-reversal permutations
-
- Published online by Cambridge University Press:
- 01 May 2000, pp. 305-317
-
- Article
-
- You have access
- Export citation
- Cited by 16
What is a purely functional language?
-
- Published online by Cambridge University Press:
- 01 January 1998, pp. 1-22
-
- Article
-
- You have access
- Export citation
- Cited by 16
Short cut fusion is correct
-
- Published online by Cambridge University Press:
- 25 June 2003, pp. 797-814
-
- Article
-
- You have access
- Export citation
- Cited by 16
Proof-directed debugging
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 463-469
-
- Article
-
- You have access
- Export citation
- Cited by 16
Transactional events1
- Part of:
-
- Published online by Cambridge University Press:
- 30 October 2008, pp. 649-706
-
- Article
-
- You have access
- Export citation
- Cited by 16
Generating constrained random data with uniform distribution
- Part of:
-
- Published online by Cambridge University Press:
- 13 July 2015, e8
-
- Article
-
- You have access
- Export citation
- Cited by 16
Quick specifications for the busy programmer
- Part of:
-
- Published online by Cambridge University Press:
- 10 July 2017, e18
-
- Article
-
- You have access
- Export citation
- Cited by 16
POPLMark reloaded: Mechanizing proofs by logical relations
-
- Published online by Cambridge University Press:
- 10 December 2019, e19
-
- Article
-
- You have access
- Export citation
- Cited by 16
Extended natural semantics
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 123-152
-
- Article
-
- You have access
- Export citation
- Cited by 16
Semantic subtyping with an SMT solver
- Part of:
-
- Published online by Cambridge University Press:
- 06 March 2012, pp. 31-105
-
- Article
-
- You have access
- Export citation
- Cited by 16
Baby Modula-3 and a theory of objects
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 249-283
-
- Article
-
- You have access
- Export citation
- Cited by 16
Static analysis for path correctness of XML queries
-
- Published online by Cambridge University Press:
- 10 August 2006, pp. 621-661
-
- Article
-
- You have access
- Export citation
- Cited by 16
Termination of rewriting in the Calculus of Constructions
-
- Published online by Cambridge University Press:
- 20 March 2003, pp. 339-414
-
- Article
-
- You have access
- Export citation
- Cited by 16
Deciding validity in a spatial logic for trees
-
- Published online by Cambridge University Press:
- 05 January 2005, pp. 543-572
-
- Article
-
- You have access
- Export citation
- Cited by 15
Notions of computation as monoids*
- Part of:
-
- Published online by Cambridge University Press:
- 05 October 2017, e21
-
- Article
-
- You have access
- Export citation
- Cited by 15
Control reduction theories: the benefit of structural substitution
- Part of:
-
- Published online by Cambridge University Press:
- 01 May 2008, pp. 373-419
-
- Article
-
- You have access
- Export citation
- Cited by 15
1 Introduction
-
- Published online by Cambridge University Press:
- 28 January 2003, pp. i-6
-
- Article
-
- You have access
- Export citation
- Cited by 15
MultiMLton: A multicore-aware runtime for standard ML
- Part of:
-
- Published online by Cambridge University Press:
- 18 June 2014, pp. 613-674
-
- Article
-
- You have access
- Export citation
- Cited by 15
Phantom types and subtyping
-
- Published online by Cambridge University Press:
- 09 June 2006, pp. 751-791
-
- Article
-
- You have access
- Export citation
- Cited by 15
Optimal purely functional priority queues
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 839-857
-
- Article
-
- You have access
- Export citation