|
81
|
Inductive Types and Type Constraints in the Second-Order Lambda Calculus. Annals of pure and Applied logic 51
– N P Mendler
- 1991
|
|
31
|
Contracting proofs to programs
– D Leivant
- 1990
|
|
21
|
Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types
– R Matthes
- 1998
|
|
38
|
Mechanizing Coinduction and Corecursion in Higher-order Logic
– Lawrence C. Paulson
- 1997
|
|
101
|
Data Structures and Program Transformation
– G Malcolm
- 1990
|
|
28
|
Generalised Folds for Nested Datatypes
– Richard Bird, Ross Paterson
- 1999
|
|
6
|
A Cube of Proof Systems for the Intuitionistic Predicate mu-,nu-Logic
– Tarmo Uustalu, Varmo Vene
- 1997
|
|
48
|
Hauptsatz for the intuitionistic theory of iterated inductive definitions
– P Martin-Löf
- 1971
|
|
395
|
The formulae-as-types notion of construction
– W A Howard
- 1980
|
|
13
|
Programming with streams in Coq. A case study : the Sieve of Eratosthenes
– F Leclerc, C Paulin-Mohring
- 1993
|
|
63
|
Codifying guarded definitions with recursion schemes
– E Giménez
- 1994
|
|
92
|
Law and Order in Algorithmics
– M M Fokkinga
- 1992
|
|
14
|
Fixed Points and Extensionality in Typed Functional Programming Languages
– Brian T. Howard
- 1992
|
|
62
|
De Bruijn notation as a nested datatype
– Richard S. Bird, Ross Paterson, Sir Arthur, Conan Doyle
- 1999
|
|
221
|
Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII
– Jean-Yves Girard
- 1972
|
|
68
|
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
– Thorsten Altenkirch, Bernhard Reus
- 1999
|
|
45
|
A typed lambda calculus with categorical type constructors
– Tatsuya Hagino
- 1987
|
|
12
|
Codifying guarded de with recursive schemes
– Eduardo Gimenez
- 1994
|
|
30
|
Type-Based Termination of Recursive Definitions
– G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu
- 2002
|
