|
101
|
Data Structures and Program Transformation
– G Malcolm
- 1990
|
|
292
|
Theorems for free!
– Philip Wadler
- 1989
|
|
46
|
Deriving Structural Hylomorphisms From Recursive Definitions
– Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi
- 1996
|
|
107
|
A Fold for All Seasons
– Tim Sheard , Leonidas Fegaras
- 1993
|
|
70
|
Warm Fusion: Deriving Build-Catas from Recursive Definitions
– John Launchbury, Tim Sheard
- 1995
|
|
92
|
Law and Order in Algorithmics
– M M Fokkinga
- 1992
|
|
173
|
A Short Cut to Deforestation
– Andrew Gill, John Launchbury, Simon L Peyton Jones
- 1993
|
|
2
|
A Calculational Fusion System
– Y Onoue, Z Hu, H Iwasaki, M Takeichi
- 1997
|
|
12
|
R.: Functional Programming with Bananas
– E Meijer, M Fokkinga, Paterson
- 1991
|
|
49
|
Heap Profiling of Lazy Functional Programs
– Colin Runciman, David Wakeling
- 1993
|
|
9
|
Structural recursive de in type theory
– E Gimenez
- 1998
|
|
3
|
Tarski's theorem and lambda calculi with monotone inductive types
– R Matthes
- 1999
|
|
6
|
A Cube of Proof Systems for the Intuitionistic Predicate mu-,nu-Logic
– Tarmo Uustalu, Varmo Vene
- 1997
|
|
2
|
Least and greatest in intuitionistic natural deduction
– T Uustalu, V Vene
- 2000
|
|
25
|
Improving Programs which Recurse over Multiple Inductive Structures
– Leonidas Fegaras, Tim Sheard, Tong Zhou
- 1994
|
|
1
|
lawski. Proof-Theoretic Approach to Inductive De in ML-Like Programming Languages versus Second-Order Lambda Calculus
– Z Sp
- 1993
|
|
1
|
lawski and P Urzyczyn. Type Iteration vs. recursion
– Z Sp
- 1999
|
|
12
|
Primitive (co)recursion and course-of-values (co)iteration, categorically
– Tarmo Uustalu, Varmo Vene
- 1999
|
|
31
|
Contracting proofs to programs
– D Leivant
- 1990
|