no. 4-5
Monotone (co)inductive types and positive fixed-point types
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 309-328. 
@article{ITA_1999__33_4-5_309_0,
     author = {Matthes, Ralph},
     title = {Monotone (co)inductive types and positive fixed-point types},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {309--328},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {4-5},
     year = {1999},
     mrnumber = {1748658},
     zbl = {0940.03018},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1999__33_4-5_309_0/}
}
TY  - JOUR
AU  - Matthes, Ralph
TI  - Monotone (co)inductive types and positive fixed-point types
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
SP  - 309
EP  - 328
VL  - 33
IS  - 4-5
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1999__33_4-5_309_0/
LA  - en
ID  - ITA_1999__33_4-5_309_0
ER  - 
%0 Journal Article
%A Matthes, Ralph
%T Monotone (co)inductive types and positive fixed-point types
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 309-328
%V 33
%N 4-5
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1999__33_4-5_309_0/
%G en
%F ITA_1999__33_4-5_309_0
Matthes, Ralph. Monotone (co)inductive types and positive fixed-point types. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 309-328. http://archive.numdam.org/item/ITA_1999__33_4-5_309_0/

[1] T. Altenkirch, Logical relations and inductive/coinductive types, G. Gottlob, E. Grandjean and K. Seyr, Eds., Computer Science Logic, 12th International Workshop, Brno, Czech Republic, August 24.-28, 1998, Proceedings, Springer Verlag, Lecture Notes in Comput. Sci. 1584 (1999) 343-354. | MR | Zbl

[2] H. P. Barendregt, Lambda calculi with types, S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, Eds., Background: Computational Structures. Oxford University Press, Handb. Log. Comput. Sci. 2 (1993) 117-309. | MR

[3] H. Geuvers, Inductive and coinductive types with iteration and recursion, B. Nordström, K. Pettersson and G. Piotkin, Eds., Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden, June 1992, pages 193-217, 1992. Only published via ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.dvi.Z

[4] J.-Y. Girard, Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Thèse de Doctorat d'État, Université de Paris VII (1972).

[5] J.-Y. Girard, Y. Lafont and P. Taylor, Proofs and Types. Cambridge University Press, Cambridge Tracts Theoret Comput. Set 7 (1989). | MR | Zbl

[6] D. Leivant, Contracting proofs to programs, P. Odifreddi, Ed., Logic and Computer Science. Academic Press, APIC Studies in Data Processing 31 (1990) 279-327.

[7] R. Matthes, Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types. Doktorarbeit (PhD thesis), University of Munich (1998). Available via the homepage http://www.tcs.informatik.uni-muenchen.de/matthes/ | Zbl

[8] R. Matthes, Monotone fixed-point types and strong normalization, G. Gottlob, E. Grandjean and K. Seyr, Eds., Computer Science Logic, 12th International Workshop, Brno, Czech Republic, August 24.-28, 1998, Proceedings, Springer Verlag, Lecture Notes in Comput. Sci. 1584 (1999) 298-312. | MR | Zbl

[9] R. Matthes and F. Joachimski, Short proofs of normalization for the simply-typed lambda-calculus, permutative conversions and Gödel's T. Arch. Math. Logic, submitted. | Zbl

[10] J. C. Reynolds, Towards a theory of type structure, B. Robinet, Ed., Programming Symposium, Springer-Verlag, Lecture Notes in Comput. Sci. 19 (1974) 408-425. | MR | Zbl

[11] M. Takahashi, Parallel réduction in λ-calculus. Inform. and Comput. 118 (1995) 120-127. | MR | Zbl