Induction Is Not Derivable in Second Order Dependent Type Theory-Reference-Cited by-同舟云学术

Induction Is Not Derivable in Second Order Dependent Type Theory

Published:2001 Issue: Volume: Page:166-181
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Geuvers Herman

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45413-6_16

Reference12 articles.

1. H.P. Barendregt, Combinatory Logic and the Axiom of Choice, in Indagationes Mathematicae, vol. 35,nr. 3, pp. 203–221.

2. H.P. Barendregt, Typed lambda calculi. In Handbook of Logic in Computer Science, eds. Abramski et al., Oxford Univ. Press.

3. S. Berardi, Encoding of data types in Pure Construction Calculus: a semantic justification, in Logical Environments, eds. G. Huet and G. Plotkin, Cambridge University Press, pp 30–60.

4. Th. Coquand, Metamathematical investigations of a calculus of constructions. In Logic and Computer Science, ed. P.G. Odifreddi, APIC series, vol. 31, Academic Press, pp 91–122.

5. Th. Coquand and G. Huet, The calculus of constructions, Information and Computation, 76, pp 95–120.

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

1. Some Remarks About Dependent Type Theory;The French School of Programming;2023-10-11

2. An intuitionistic set-theoretical model of fully dependent CC;Mathematical Structures in Computer Science;2023-01

3. Impredicative Encodings of Inductive-Inductive Data in Cedille;Lecture Notes in Computer Science;2023

4. Monotone recursive types and recursive data representations in Cedille;Mathematical Structures in Computer Science;2021-06

5. Efficient lambda encodings for Mendler-style coinductive types in Cedille;Electronic Proceedings in Theoretical Computer Science;2020-05-01