Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory-Reference-Cited by-同舟云学术

Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory

Published:2016-07 Issue: Volume:323 Page:109-124
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Copello Ernesto,Tasistro Álvaro,Szasz Nora,Bove Ana,Fernández Maribel

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Nominal reasoning techniques in Coq;Aydemir;Electron. Notes Theor. Comput. Sci.,2007

2. Engineering formal metatheory;Aydemir,2008

3. The locally nameless representation;Charguéraud;J. Autom. Reasoning,2012

4. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with applications to the church-rosser theorem;de Bruijn;Indagationes Mathematicae (Koninglijke Nederlandse Akademie van Wetenschappen),1972

5. A New Approach to Abstract Syntax with Variable Binding;Gabbay;Formal Aspects of Computing,2001

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

1. Nominal Sets in Agda - A Fresh and Immature Mechanization;Electronic Proceedings in Theoretical Computer Science;2023-03-23

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. Strong Normalization for the Simply-Typed Lambda Calculus in Constructive Type Theory Using Agda;Electronic Notes in Theoretical Computer Science;2020-09

4. A formalisation of nominal α-equivalence with A, C, and AC function symbols;Theoretical Computer Science;2019-08

5. Machine-checked Proof of the Church-Rosser Theorem for the Lambda Calculus Using the Barendregt Variable Convention in Constructive Type Theory;Electronic Notes in Theoretical Computer Science;2018-10