Monotone fixed-point types and strong normalization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1584, Issue , 1999, Pages 298-312

  Matthes, Ralph ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BETA-REDUCTION; FIXED POINTS; MONOTONICITY; POSITIVE FIXED POINT; RECURSIVE TYPES; STRONG NORMALIZATION; SYSTEM F;

COMPUTER CIRCUITS;

EID: 84956967710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_20     Document Type: Conference Paper

References (13)

1. Martín Abadi and Marcelo Fiore. Syntactic Considerations on Recursive Types. In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, pp. 242-252. IEEE Computer Society, July 1996.
2. Thorsten Altenkirch. Strong Normalization for T+. Unpublished note, 1993.
3. Henk Barendregt. Lambda Calculi with Types. In S. Abramsky, D. Gabbay and T. Maibaum, editors. Volume 2 of Handbook of Logic in Computer Science, pp. 117-309. Oxford Univ. Press, 1993.
4. Herman Geuvers. Inductive and Coinductive Types with Iteration and Recursion. In B. Nordstrom, K. Pettersson and G. Plotkin, editors. Preliminary Proceedings of the Workshop on Types for Proofs and Programs, Båstad, June 1992, pp. 193-217 (ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.dvi.Z).
5. Jean-Yves Girard, Yves Lafont and Paul Taylor. Proofs and Types. Cambridge Univ. Press, 1989.
6. Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series. The MIT Press, Cambridge, Massachusetts, 1992.
7. Daniel Leivant. Contracting Proofs to Programs. In P. Odifreddi, editor. Logic in Computer Science, Vol. 31 APIC Studies in Data Processing, Academic Press, pp. 279-327, 1990.
8. Ralph Loader. Normalisation by Translation. Unpublished note announced on the "types" mailing list on April 6, 1995.
9. Ralph Matthes. Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types. PhD thesis, University of Munich, 1998, to appear (available via http://www.tcs.informatik.uni-muenchen.de/~matthes/).
10. Nax P. Mendler. Recursive Types and Type Constraints in Second-Order Lambda Calculus. In Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, pp. 30-36. IEEE Computer Society, June 1987.
11. Femke van Raamsdonk and Paula Severi. On Normalisation. Technical Report CS-R9545, CWI, June 1995.
12. Masako Takahashi. Parallel Reduction in λ-Calculus, Information and Computation 118, pp. 120-127, 1995.
13. Tarmo Uustalu and Varmo Vene. A Cube of Proof Systems for the Intuitionistic Predicate μ-, v-Logic. In M. Haveraaen and O. Owe, editors, Selected Papers of the 8th Nordic Workshop on Programming Theory (NWPT '96), Oslo, Norway, December 1996, volume 248 of Research Reports, Department of Informatics, University of Oslo, pp. 237-246, May 1997.