Monadic Presentations of Lambda Terms Using Generalized Inductive Types-Reference-Cited by-同舟云学术

Monadic Presentations of Lambda Terms Using Generalized Inductive Types

Published:1999 Issue: Volume: Page:453-468
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Altenkirch Thorsten,Reus Bernhard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48168-0_32

Reference25 articles.

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

2. Lect Notes Comput Sci;T. Altenkirch,1993

3. Lect Notes Comput Sci;T. Altenkirch,1998

4. T. Altenkirch. Extensional equality in intensional type theory. In Proceedings of LICS 99, pages 412–420, 1999.

5. M. Abadi and G. Plotkin. A logic for parametric polymorphism. In Typed Lambda Calculi and Applications-TLCA’ 93, pages 361–375, 1993.

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

1. Intrinsically Typed Syntax, a Logical Relation, and the Scourge of the Transfer Lemma;Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development;2024-08-28

2. Scoped and Typed Staging by Evaluation;Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11

3. Nominal Recursors as Epi-Recursors;Proceedings of the ACM on Programming Languages;2024-01-05

4. Language-parameterized Proofs for Functional Languages with Subtyping;Lecture Notes in Computer Science;2024

5. Syntax Monads for the Working Formal Metatheorist;Electronic Proceedings in Theoretical Computer Science;2023-12-14