A Predicative Strong Normalisation Proof for a λCalculus with Interleaving Inductive Types-Reference-Cited by-同舟云学术

A Predicative Strong Normalisation Proof for a λCalculus with Interleaving Inductive Types

Published:2000 Issue: Volume: Page:21-40
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abel Andreas,Altenkirch Thorsten

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44557-9_2

Reference24 articles.

1. Andreas Abel and Thorsten Altenkirch. A predicative analysis of structural recursion. Submitted to the Journal of Functional Programming, December 1999.

2. Andreas Abel. A semantic analysis of structural recursion. Master’s thesis, Ludwig-Maximilians-University Munich, 1999. http://www.informatik.uni-muenchen.de/~abel/publications/ .

3. Peter Aczel. Notes on constructive set theory. Available from the WWW, 1997.

4. Thorsten Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, November 1993.

5. Thorsten Altenkirch. Logical relations and inductive/coinductive types. 1998.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bindings as bounded natural functors;Proceedings of the ACM on Programming Languages;2019-01-02

2. Witnessing (Co)datatypes;Programming Languages and Systems;2015

3. Strong functors and interleaving fixpoints in game semantics;RAIRO - Theoretical Informatics and Applications;2013-01

4. Least and Greatest Fixpoints in Game Semantics;Foundations of Software Science and Computational Structures;2009

5. Representing Nested Inductive Types Using W-Types;Automata, Languages and Programming;2004