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 2
Functional Pearls: Unravelling greedy algorithms
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 375-385
-
- Article
-
- You have access
- Export citation
- Cited by 2
Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Part of:
-
- Published online by Cambridge University Press:
- 11 November 2021, e30
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 2
Composable scheduler activations for Haskell
- Part of:
-
- Published online by Cambridge University Press:
- 27 June 2016, e9
-
- Article
-
- You have access
- Export citation
- Cited by 2
On the complexity of stream equality
- Part of:
-
- Published online by Cambridge University Press:
- 20 January 2014, pp. 166-217
-
- Article
-
- You have access
- Export citation
- Cited by 2
The dynamic compilation of lazy functional programs
-
- Published online by Cambridge University Press:
- 01 January 1998, pp. 61-81
-
- Article
-
- You have access
- Export citation
- Cited by 2
A calculus for hardware description*
- Part of:
-
- Published online by Cambridge University Press:
- 19 November 2010, pp. 21-58
-
- Article
-
- You have access
- Export citation
- Cited by 2
Constructive Galois Connections
- Part of:
-
- Published online by Cambridge University Press:
- 08 July 2019, e11
-
- Article
-
- You have access
- Export citation
- Cited by 2
Gradual type theory
- Part of:
-
- Published online by Cambridge University Press:
- 14 October 2021, e21
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 2
Implementing theorem provers in a purely functional style
-
- Published online by Cambridge University Press:
- 01 March 1999, pp. 147-166
-
- Article
-
- You have access
- Export citation
- Cited by 2
Iterating on multiple collections in synchrony
-
- Published online by Cambridge University Press:
- 05 July 2022, e9
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 2
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant
- Part of:
-
- Published online by Cambridge University Press:
- 29 September 2022, e13
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 2
FUNCTIONAL PEARL Composing fractals
-
- Published online by Cambridge University Press:
- 27 October 2004, pp. 715-725
-
- Article
-
- You have access
- Export citation
- Cited by 2
An extended account of contract monitoring strategies as patterns of communication
- Part of:
-
- Published online by Cambridge University Press:
- 07 March 2018, e4
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 2
EditorArrow: An arrow-based model for editor-based programming
- Part of:
-
- Published online by Cambridge University Press:
- 22 November 2012, pp. 185-224
-
- Article
-
- You have access
- Export citation
- Cited by 2
Metamorph – a formal methods toolkit with application to the design of digital hardware
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 437-473
-
- Article
-
- You have access
- Export citation
- Cited by 1
Pragmatic aspects of reusable program generators
-
- Published online by Cambridge University Press:
- 13 May 2003, pp. 601-646
-
- Article
-
- You have access
- Export citation
- Cited by 1
Untyped strictness analysis
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 37-49
-
- Article
-
- You have access
- Export citation
- Cited by 1
CPS transformation of flow information, Part II: administrative reductions
-
- Published online by Cambridge University Press:
- 27 August 2003, pp. 925-933
-
- Article
-
- You have access
- Export citation
- Cited by 1
Programming language semantics: It’s easy as 1,2,3
- Part of:
-
- Published online by Cambridge University Press:
- 26 October 2023, e9
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
ANF preserves dependent types up to extensional equality
-
- Published online by Cambridge University Press:
- 16 September 2022, e12
-
- Article
-
- You have access
- Open access
- HTML
- Export citation