Some lambda calculi with categorical sums and products-Reference-Cited by-同舟云学术

Some lambda calculi with categorical sums and products

Published:1993 Issue: Volume: Page:137-151
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Dougherty Daniel J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56868-9_12.pdf

Reference20 articles.

1. Y. Akama. On Mint's Reduction for ccc-Calculus. Proc. Typed Lambda Calculus and Applications 1993.

2. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Volume 103 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1981. Revised edition, 1984.

3. P-L Curien, R. Di Cosmo. A confluent reduction system for the λ-calculus with surjective pairing and terminal object, in Leach et. al. (eds.), Int'l. Conf. on Automata, Languages, and Programming, LNCS 510, 291–302, Springer Verlag 1991.

4. D. Cubric. Embedding of a free cartesian closed category into the category of Sets. Manuscript, McGill University 1992.

5. R. Di Cosmo, D. Kesner. Simulating expansions without expansions. Tech Rep, INRIA 1993.

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

1. Logic and Computation in a Lambda Calculus with Intersection and Union Types;Logic for Programming, Artificial Intelligence, and Reasoning;2010

2. Strong Normalization of the Dual Classical Sequent Calculus;Logic for Programming, Artificial Intelligence, and Reasoning;2005

3. Confluence of extensional and non-extensional λ-calculi with explicit substitutions;Theoretical Computer Science;2000-05

4. A type-based semantics for user-defined marshalling in polymorphic languages;Lecture Notes in Computer Science;1998

5. Eta-expansions in F ω;Computer Science Logic;1997