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
Extensional equality preservation and verified generic programming
-
- Published online by Cambridge University Press:
- 21 October 2021, e24
-
- Article
-
- You have access
- Open 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
Normal-order reduction grammars*
- Part of:
-
- Published online by Cambridge University Press:
- 17 January 2017, e6
-
- Article
-
- You have access
- Export citation
- Cited by 2
A characterization of lambda-terms transforming numerals
- Part of:
-
- Published online by Cambridge University Press:
- 22 July 2016, e12
-
- Article
-
- You have access
- Export citation
- Cited by 2
Communication lifting: fixed point computation for parallelism
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 549-581
-
- Article
-
- You have access
- Export citation
- Cited by 2
Romeo: A system for more flexible binding-safe programming*
- Part of:
-
- Published online by Cambridge University Press:
- 22 July 2016, e13
-
- Article
-
- You have access
- Export citation
- Cited by 2
Calculating PSSM probabilities with lazy dynamic programming
-
- Published online by Cambridge University Press:
- 13 September 2005, pp. 75-81
-
- Article
-
- You have access
- Export citation
- Cited by 2
10 Specification of Derived Instances
-
- Published online by Cambridge University Press:
- 28 January 2003, pp. 139-144
-
- Article
-
- You have access
- Export citation
- Cited by 2
Lessons from the design of a Standard ML library
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 527-552
-
- Article
-
- You have access
- Export citation
- Cited by 2
PAEAN: Portable and scalable runtime support for parallel Haskell dialects
- Part of:
-
- Published online by Cambridge University Press:
- 13 July 2016, e10
-
- Article
-
- You have access
- Export citation
- Cited by 2
The Functional “C” experience
-
- Published online by Cambridge University Press:
- 22 January 2004, pp. 129-135
-
- Article
-
- You have access
- Export citation
- Cited by 2
Reasoning about multi-stage programs*
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2016, e22
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 2
Principal signatures for higher-order program modules
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 285-335
-
- Article
-
- You have access
- Export citation
- Cited by 2
Sparcl: A language for partially invertible computation
- Part of:
-
- Published online by Cambridge University Press:
- 26 January 2024, e2
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 2
Compiling a 50-year journey*
-
- Published online by Cambridge University Press:
- 20 September 2017, e20
-
- Article
-
- You have access
- Export citation
- Cited by 2
Translation of tree-processing programs into stream-processing programs based on ordered linear type1
- Part of:
-
- Published online by Cambridge University Press:
- 01 May 2008, pp. 333-371
-
- Article
-
- You have access
- Export citation
- Cited by 2
Finiteness and rational sequences, constructively*
- Part of:
-
- Published online by Cambridge University Press:
- 05 April 2017, e13
-
- Article
-
- You have access
- Export citation
- Cited by 2
An adequate and efficient left-associated binary numeral system in the λ-calculus
-
- Published online by Cambridge University Press:
- 01 March 2001, pp. 607-623
-
- Article
-
- You have access
- Export citation
- Cited by 2
Size-based termination of higher-order rewriting
-
- Published online by Cambridge University Press:
- 19 April 2018, e11
-
- Article
-
- You have access
- Export citation
- 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