A formalised first-order confluence proof for the λ-calculus using one-sorted variable names-Reference-Cited by-同舟云学术

A formalised first-order confluence proof for the λ-calculus using one-sorted variable names

Published:2003-06 Issue:2 Volume:183 Page:212-244
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Vestergaard René,Brotherston James

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference45 articles.

1. H. Barendregt, The Lambda Calculus—Its Syntax and Semantics (Revised Edition), North-Holland, Amsterdam, 1984

2. J. Brotherston, Formalizing proofs in Isabelle/HOL of equational properties for the λ-calculus using one-sorted variable names, Honours Dissertation, University of Edinburgh; available from the author’s homepage, 2001

3. Proving properties of programs by structural induction;Burstall;Comput. J.,1967

4. Some properties of conversion;Church;Trans. Am. Math. Soc.,1936

5. Combinatory Logic;Curry,1958

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

1. Ground Confluence and Strong Commutation Modulo Alpha-Equivalence in Nominal Rewriting;Lecture Notes in Computer Science;2022

2. Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention;Mathematical Structures in Computer Science;2021-03

3. Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution;Electronic Proceedings in Theoretical Computer Science;2018-07-03

4. Formal metatheory of the Lambda calculus using Stoughton's substitution;Theoretical Computer Science;2017-07

5. Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems;Frontiers of Combining Systems;2017