Author:
Ambler Simon J.,Crole Roy L.,Momigliano Alberto
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Lect Notes Comput Sci;A. Gordon,1993
2. S. Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65–116. Addison-Wesley, 1990.
3. N. Benton and A. Kennedy. Monads, effects and transformations. In Proceedings of the 3rd International Workshop in Higher Order Operational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science. Elsevier, 1998.
4. N. de Bruijn. Lambda-calculus notation with nameless dummies: A tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381–392, 1972.
5. Lect Notes Comput Sci;J. Despeyroux,1995
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Semi-Automation of Meta-Theoretic Proofs in Beluga;Electronic Proceedings in Theoretical Computer Science;2023-11-17
2. A focused linear logical framework and its application to metatheory of object logics;Mathematical Structures in Computer Science;2021-03
3. Formalization of Metatheory of the Quipper Quantum Programming Language in a Linear Logic;Journal of Automated Reasoning;2019-06-22
4. The representational adequacy of Hybrid;Mathematical Structures in Computer Science;2011-03-30
5. Hybrid;Journal of Automated Reasoning;2010-08-07