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 7
Contributions to a computational theory of policy advice and avoidability*
- Part of:
-
- Published online by Cambridge University Press:
- 24 October 2017, e23
-
- Article
-
- You have access
- Export citation
- Cited by 7
An operational semantics for Scheme1
- Part of:
-
- Published online by Cambridge University Press:
- 01 January 2008, pp. 47-86
-
- Article
-
- You have access
- Export citation
- Cited by 7
Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory
-
- Published online by Cambridge University Press:
- 10 May 2018, e12
-
- Article
-
- You have access
- Export citation
- Cited by 7
Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
-
- Published online by Cambridge University Press:
- 01 March 1998, pp. 97-129
-
- Article
-
- You have access
- Export citation
- Cited by 7
Parallelization of divide-and-conquer by translation to nested loops
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 279-310
-
- Article
-
- You have access
- Export citation
- Cited by 7
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
- Part of:
-
- Published online by Cambridge University Press:
- 19 October 2021, e22
-
- Article
-
- You have access
- Export citation
- Cited by 7
Higher-order functional languages and intensional logic
-
- Published online by Cambridge University Press:
- 01 September 1999, pp. 527-564
-
- Article
-
- You have access
- Export citation
- Cited by 7
Efficiency of lambda-encodings in total type theory
- Part of:
-
- Published online by Cambridge University Press:
- 10 March 2016, e3
-
- Article
-
- You have access
- Export citation
- Cited by 7
A unified treatment of syntax with binders
- Part of:
-
- Published online by Cambridge University Press:
- 15 August 2012, pp. 614-704
-
- Article
-
- You have access
- Export citation
- Cited by 7
FUNCTIONAL PEARL Derivation of a logarithmic time carry lookahead addition circuit
-
- Published online by Cambridge University Press:
- 27 October 2004, pp. 697-713
-
- Article
-
- You have access
- Export citation
- Cited by 7
Build systems à la carte: Theory and practice
-
- Published online by Cambridge University Press:
- 21 April 2020, e11
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 7
A confluent reduction for the λ-calculus with surjective pairing and terminal object
- Part of:
-
- Published online by Cambridge University Press:
- 07 November 2008, pp. 299-327
-
- Article
-
- You have access
- Export citation
- Cited by 7
Expansion postponement for normalising pure type systems
-
- Published online by Cambridge University Press:
- 01 January 1998, pp. 89-96
-
- Article
-
- You have access
- Export citation
- Cited by 7
A type system with usage aspects
- Part of:
-
- Published online by Cambridge University Press:
- 01 March 2008, pp. 141-178
-
- Article
-
- You have access
- Export citation
- Cited by 7
Parallel functional programming on recursively defined data via data-parallel recursion
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 427-462
-
- Article
-
- You have access
- Export citation
- Cited by 7
Monadic augment and generalised short cut fusion
-
- Published online by Cambridge University Press:
- 01 November 2007, pp. 731-776
-
- Article
-
- You have access
- Export citation
- Cited by 7
A relational logic for higher-order programs
- Part of:
-
- Published online by Cambridge University Press:
- 21 October 2019, e16
-
- Article
-
- You have access
- Export citation
- Cited by 6
Producing all ideals of a forest, functionally
-
- Published online by Cambridge University Press:
- 27 August 2003, pp. 945-956
-
- Article
-
- You have access
- Export citation
- Cited by 6
A theory of RPC calculi for client–server model
- Part of:
-
- Published online by Cambridge University Press:
- 22 March 2019, e5
-
- Article
-
- You have access
- Export citation
- Cited by 6
Explaining binomial heaps
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 93-104
-
- Article
-
- You have access
- Export citation