Decomposing typed lambda calculus into a couple of categorical programming languages-Reference-Cited by-同舟云学术

Decomposing typed lambda calculus into a couple of categorical programming languages

Published:1995 Issue: Volume: Page:200-219
ISSN:0302-9743
Container-title:Category Theory and Computer Science
language:
Short-container-title:

Author:

Hasegawa Masahito

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60164-3_28.pdf

Reference18 articles.

1. M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Levy, Explicit substitutions. Journal of Functional Programming 1 (4), pages 375–416, 1991.

2. J. R. B. Cockett and T. Fukushima, About Charity. Technical Report 92/480/18, University of Calgary, 1992.

3. J. R. B. Cockett and D. Spencer, Strong categorical datatypes I. In Canadian Mathematical Society Proceedings, Category Theory 1991, Montreal, 1991.

4. G. Cousineau, P.-L. Curien and M. Mauny, The categorical abstract machine. Science of Computer Programming 8, pages 173–202, 1987.

5. P.-L. Curien, α-conversion,conditions on variables and categorical logic. Studia Logica XLVIII (3), pages 55–91, 1990.

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

1. The Relational Machine Calculus;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Hypergraph-based type theory for software development in a Cyber-Physical context;Advances in Ubiquitous Computing;2020

3. Verifying Equivalence of Spark Programs;Computer Aided Verification;2017

4. Hardware Design with Generalized Arrows;Implementation and Application of Functional Languages;2012

5. Models for the computational λ-calculus;Electronic Notes in Theoretical Computer Science;2001-03