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 27
On the generation of specializers1
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 499-514
-
- Article
-
- You have access
- Export citation
- Cited by 27
A coherence theorem for Martin-Löf's type theory
-
- Published online by Cambridge University Press:
- 01 July 1998, pp. 413-436
-
- Article
-
- You have access
- Export citation
- Cited by 27
Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms
-
- Published online by Cambridge University Press:
- 01 July 1997, pp. 395-420
-
- Article
-
- You have access
- Export citation
- Cited by 27
Counting and generating lambda terms
- Part of:
-
- Published online by Cambridge University Press:
- 30 October 2013, pp. 594-628
-
- Article
-
- You have access
- Export citation
- Cited by 27
NixOS: A purely functional Linux distribution
- Part of:
-
- Published online by Cambridge University Press:
- 15 October 2010, pp. 577-615
-
- Article
-
- You have access
- Export citation
- Cited by 27
A Debugger for Standard ML1
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 155-200
-
- Article
-
- You have access
- Export citation
- Cited by 27
A typed representation for HTML and XML documents in Haskell
-
- Published online by Cambridge University Press:
- 08 July 2003, pp. 435-468
-
- Article
-
- You have access
- Export citation
- Cited by 26
On characterizations of the basic feasible functionals, Part I
-
- Published online by Cambridge University Press:
- 26 March 2001, pp. 117-153
-
- Article
-
- You have access
- Export citation
- Cited by 26
A parallel SML compiler based on algorithmic skeletons
-
- Published online by Cambridge University Press:
- 12 July 2005, pp. 615-650
-
- Article
-
- You have access
- Export citation
- Cited by 26
Monadic constraint programming
- Part of:
-
- Published online by Cambridge University Press:
- 14 August 2009, pp. 663-697
-
- Article
-
- You have access
- Export citation
- Cited by 26
Correctness of binding-time analysis
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 347-363
-
- Article
-
- You have access
- Export citation
- Cited by 26
From Polyvariant flow information to intersection and union types
-
- Published online by Cambridge University Press:
- 31 May 2001, pp. 263-317
-
- Article
-
- You have access
- Export citation
- Cited by 25
The risks and benefits of teaching purely functional programming in first year
-
- Published online by Cambridge University Press:
- 14 January 2004, pp. 113-123
-
- Article
-
- You have access
- Export citation
- Cited by 25
Empirical and analytic study of stack versus heap cost for languages with closures
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 47-74
-
- Article
-
- You have access
- Export citation
- Cited by 25
Efficient execution in an automated reasoning environment
- Part of:
-
- Published online by Cambridge University Press:
- 01 January 2008, pp. 15-46
-
- Article
-
- You have access
- Export citation
- Cited by 25
Well-founded recursion with copatterns and sized types
- Part of:
-
- Published online by Cambridge University Press:
- 03 March 2016, e2
-
- Article
-
- You have access
- Export citation
- Cited by 25
Macros that Work Together: Compile-time bindings, partial expansion, and definition contexts
- Part of:
-
- Published online by Cambridge University Press:
- 09 May 2012, pp. 181-216
-
- Article
-
- You have access
- Export citation
- Cited by 25
Doo bee doo bee doo
- Part of:
-
- Published online by Cambridge University Press:
- 31 March 2020, e9
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 25
The bologna optimal higher-order machine
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 763-810
-
- Article
-
- You have access
- Export citation
- Cited by 24
The Genuine Sieve of Eratosthenes
- Part of:
-
- Published online by Cambridge University Press:
- 01 January 2009, pp. 95-106
-
- Article
-
- You have access
- Export citation