Monotone Fixed-Point Types and Strong Normalization
暂无分享,去创建一个
[1] Daniel Leivant,et al. Contracting proofs to programs , 1989 .
[2] Paula Severi,et al. On normalisation , 1995 .
[3] N. P. Mendler,et al. Recursive Types and Type Constraints in Second-Order Lambda Calculus , 1987, LICS.
[4] Varmo Veney. A Cube of Proof Systems for the Intuitionistic Predicate ,-logic , 1997 .
[5] J. Girard,et al. Proofs and types , 1989 .
[6] Thorsten Altenkirch. A Formalization of the Strong Normalization Proof for System F in LEGO , 1993, TLCA.
[7] Masako Takahashi. Parallel Reductions in lambda-Calculus , 1995, Inf. Comput..
[8] Takahashi. Parallel Reduction in calculus , 1989 .
[9] Carl A. Gunter. Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.
[10] Ralph Matthes,et al. Extensions of system F by iteration and primitive recursion on monotone inductive types , 1998 .
[11] J. H. Geuvers,et al. Inductive and Coinductive Types with Iteration and Recursion , 1992 .
[12] Martín Abadi,et al. Syntactic considerations on recursive types , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.