Skip to Navigation
Skip to Content
 
Home> Journal of Functional Programming> Top 10 Most-Cited Articles

 

Log In

Browse Journals

Special Sales

CJO Now Includes:

567,269 articles from 321 leading journals.

Customize Your Search Toolbar

Top 10 Most-Cited Articles


These are the top 10 most-cited articles for this title for the previous two years. Most-cited rankings are updated on a monthly basis and provided by CrossRef.

  • Subscription Access
  • Free Access
  • Trial Access
  • Full Text HTML as well as PDF Articles Available
  • Note: Abstract, PDF and HTML open in a new window
  Article Description Save / Export / View citation Add to Basket
  Select all
 

Classical logic, continuation semantics and abstract machines

Th. STREICHER and B. REUS

Journal of Functional Programming, Volume 8, Issue 06, Nov 1998, pp 543-572
doi: 10.1017/S0956796898003141 (About doi),
 

Grammatical Framework

AARNE RANTA

Journal of Functional Programming, Volume 14, Issue 02, Mar 2004, pp 145-189
doi: 10.1017/S0956796803004738 (About doi), Published online by Cambridge University Press 22 Jan 2004
 

Deriving a lazy abstract machine

PETER SESTOFT

Journal of Functional Programming, Volume 7, Issue 03, May 1997, pp 231-264
doi: 10.1017/S0956796897002712 (About doi),
 

Composition of functions with accumulating parameters

JANIS VOIGTLÄNDER and ARMIN KÜHNEMANN

Journal of Functional Programming, Volume 14, Issue 03, May 2004, pp 317-363
doi: 10.1017/S0956796803004933 (About doi), Published online by Cambridge University Press 14 Apr 2004
 

The Zipper

GÉRARD HUET

Journal of Functional Programming, Volume 7, Issue 05, Sep 1997, pp 549-554
doi: 10.1017/S0956796897002864 (About doi),
 

The view from the left

CONOR MCBRIDE and JAMES MCKINNA

Journal of Functional Programming, Volume 14, Issue 01, Jan 2004, pp 69-111
doi: 10.1017/S0956796803004829 (About doi), Published online by Cambridge University Press 14 Jan 2004
 

Higher-order narrowing with definitional trees

MICHAEL HANUS and CHRISTIAN PREHOFER

Journal of Functional Programming, Volume 9, Issue 01, Jan 1999, pp 33-75
doi: 10.1017/S0956796899003330 (About doi),
 

Verification of non-functional programs using interpretations in type theory

JEAN-CHRISTOPHE FILLIÂTRE

Journal of Functional Programming, Volume 13, Issue 04, Jul 2003, pp 709-745
doi: 10.1017/S095679680200446X (About doi), Published online by Cambridge University Press 25 Jun 2003
 

The call-by-need lambda calculus

ZENA M. ARIOLA and MATTHIAS FELLEISEN

Journal of Functional Programming, Volume 7, Issue 03, May 1997, pp 265-301
doi: 10.1017/S0956796897002724 (About doi),
 

Secrets of the Glasgow Haskell Compiler inliner

SIMON PEYTON JONES and SIMON MARLOW

Journal of Functional Programming, Volume 12, Issue 4-5, Jul 2002, pp 393-434
doi: 10.1017/S0956796802004331 (About doi), Published online by Cambridge University Press 08 Jul 2003
  Select all
  Article Description Save / Export / View citation Add to Basket

Back to Journal Homepage
Cambridge University Press