Author:
Momigliano Alberto,Ambler Simon J.,Crole Roy L.
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. A. Gordon. A mechanisation of name-carrying syntax up to alpha-conversion. In J.J. Joyce and C.-J.H. Seger, editors, International Workshop on Higher Order Logic Theorem Proving and its Applications, volume 780 of Lecture Notes in Computer Science, pages 414–427, Vancouver, Canada, Aug. 1993. University of British Columbia, Springer-Verlag, published 1994.
2. The lazy lambda calculus;Abramsky,1990
3. Full abstraction in the lazy lambda calculus;Abramsky;Information and Computation,1992
4. S. Ambler, R. Crole, and A. Momigliano. Combining higher order abstract syntax with tactical theorem proving and (co)induction. In In V. A. Carreño editor Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, Hampton, VA, 1–3 August 2002, pages 327–343, volume 2342 Lecture Notes in Computer Science, Springer Verlag, Berlin, 2002.
5. S. J. Ambler and R. L. Crole. Mechanised Operational Semantics via (Co)Induction. In Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, volume 1690 of Lecture Notes in Computer Science, pages 221–238. Springer-Verlag, 1999.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A case study in programming coinductive proofs: Howe’s method;Mathematical Structures in Computer Science;2018-10-31
2. Triangulating context lemmas;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs;2018-01-08
3. Triangulating context lemmas;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018;2018
4. Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions;Mathematical Structures in Computer Science;2017-05-05
5. The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations;Journal of Automated Reasoning;2015-07-05