|
7
|
The Dual of Substitution is Redecoration
– Tarmo Uustalu, Varmo Vene
- 2002
|
|
5
|
Monad Translating Inductive and Coinductive Types
– Tarmo Uustalu
- 2003
|
|
2
|
Co)monads from inductive and coinductive types
– T Uustalu
- 2001
|
|
2
|
Generalizing substitution (extended abstract
– T Uustalu
- 2002
|
|
2
|
Least and greatest fixedpoints in intuitionistic natural deduction
– T Uustalu, V Vene
- 2002
|
|
20
|
Recursion Schemes from Comonads
– Tarmo Uustalu, Varmo Vene, Alberto Pardo
- 2001
|
|
30
|
Type-Based Termination of Recursive Definitions
– G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu
- 2002
|
|
5
|
Type Iteration vs. recursion
– Sp lawski, Z, P Urzyczyn
- 1999
|
|
3
|
A third-order representation of the -calculus
– A Abel
- 2001
|
|
8
|
Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)
– Gilles Barthe, John Hatcliff, Peter Thiemann
- 1997
|
|
6
|
A third-order representation of the λµ-Calculus
– Andreas Abel
- 2001
|
|
8
|
T.: About Charity. Yellow Series Report 92/480/18
– R Cockett, Fukushima
- 1992
|
|
31
|
Contracting proofs to programs
– D Leivant
- 1990
|
|
13
|
Type fixpoints: Iteration vs. recursion
– Z Sp̷lawski, P Urzyczyn
- 1999
|
|
51
|
Computational Types from a Logical Perspective I
– P.N. Benton, G.M. Bierman, V.C.V. de Paiva
- 1995
|
|
9
|
CPS Translations and Applications: The Cube and Beyond
– Gilles Barthe, John Hatcliff, Morten Heine B. Srensen
- 1996
|
|
81
|
Inductive Types and Type Constraints in the Second-Order Lambda Calculus. Annals of pure and Applied logic 51
– N P Mendler
- 1991
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
53
|
Propositional Lax Logic
– Matt Fairtlough, Michael Mendler
- 1997
|
