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 3
Control effects as a modality
-
- Published online by Cambridge University Press:
- 01 January 2009, pp. 17-26
-
- Article
-
- You have access
- Export citation
- Cited by 3
Haskell in Space: An interactive game as a functional programming exercise
-
- Published online by Cambridge University Press:
- 29 October 2003, pp. 1077-1085
-
- Article
-
- You have access
- Export citation
- Cited by 3
Escape from Zurg: an exercise in logic programming
-
- Published online by Cambridge University Press:
- 14 April 2004, pp. 253-261
-
- Article
-
- You have access
- Export citation
- Cited by 3
StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities
- Part of:
-
- Published online by Cambridge University Press:
- 15 April 2021, e9
-
- Article
-
- You have access
- Export citation
- Cited by 3
A domain-specific language for experimental game theory
-
- Published online by Cambridge University Press:
- 07 September 2009, pp. 645-661
-
- Article
-
- You have access
- Export citation
- Cited by 3
A domain-theoretic approach to functional and logic programming
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 273-321
-
- Article
-
- You have access
- Export citation
- Cited by 3
Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997).
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 347-354
-
- Article
-
- You have access
- Export citation
- Cited by 3
Functional programming in education – Introduction
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 3-4
-
- Article
-
- You have access
- Export citation
- Cited by 3
Runtime verification and validation of functional reactive systems
- Part of:
-
- Published online by Cambridge University Press:
- 26 August 2020, e28
-
- Article
-
- You have access
- Export citation
- Cited by 2
Representing demand by partial projections
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 563-585
-
- Article
-
- You have access
- Export citation
- Cited by 2
Purely Functional 1-2 Brother Trees
-
- Published online by Cambridge University Press:
- 26 May 2009, pp. 633-644
-
- Article
-
- You have access
- Export citation
- Cited by 2
Functional Pearls Two greedy algorithms
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 237-244
-
- Article
-
- You have access
- Export citation
- Cited by 2
Non-determinism analyses in a parallel-functional language
-
- Published online by Cambridge University Press:
- 08 December 2004, pp. 67-100
-
- Article
-
- You have access
- Export citation
- Cited by 2
Note on Algol and conservatively extending functional programming
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 171-180
-
- Article
-
- You have access
- Export citation
- Cited by 2
Formal polytypic programs and proofs
- Part of:
-
- Published online by Cambridge University Press:
- 23 September 2010, pp. 213-270
-
- Article
-
- You have access
- Export citation
- Cited by 2
Inductive benchmarking for purely functional data structures
-
- Published online by Cambridge University Press:
- 29 August 2001, pp. 525-556
-
- Article
-
- You have access
- Export citation
- Cited by 2
Countdown: A case study in origami programming
-
- Published online by Cambridge University Press:
- 18 August 2005, pp. 679-702
-
- Article
-
- You have access
- Export citation
- Cited by 2
Introduction to HOL: a theorem proving environment for higher order logic by Mike Gordon and Tom Melham (eds.), Cambridge University Press, 1993, ISBN 0-521-44189-7
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 557-559
-
- Article
-
- You have access
- Export citation
- Cited by 2
Short note: Strict unwraps make worker/wrapper fusion totally correct
- Part of:
-
- Published online by Cambridge University Press:
- 08 April 2010, pp. 209-213
-
- Article
-
- You have access
- Export citation
- Cited by 2
Type checking dependent (record) types and subtyping
-
- Published online by Cambridge University Press:
- 01 March 2000, pp. 137-166
-
- Article
-
- You have access
- Export citation