Alpha-conversion for lambda terms with explicit weakenings
Logic in Computer Science
2018-12-27 v1 Logic
Authors:
George Cherevichenko
Abstract
Using explicit weakenings, we can define alpha-conversion by simple equations without any mention of free variables.
Cite
@article{arxiv.1812.10008,
title = {Alpha-conversion for lambda terms with explicit weakenings},
author = {George Cherevichenko},
journal= {arXiv preprint arXiv:1812.10008},
year = {2018}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Is alpha-conversion easy?
George Cherevichenko
2014-04-03
Logic in Computer Science · Computer Science
Lambda Congruences and Extensionality
Michele Basaldella
2019-03-21
Logic · Mathematics
Explicit renaming of bound variables
George Cherevichenko
2012-05-02
Logic in Computer Science · Computer Science
Abstract clones for abstract syntax
Nathanael Arkor, Dylan McDermott
2024-04-03
Logic in Computer Science · Computer Science
On the Formal Metatheory of the Pure Type Systems using One-sorted Variable Names and Multiple Substitutions
Sebastián Urciuoli
2025-10-15
General Mathematics · Mathematics
A Note on Laplace Transforms of Some Particular Function Types
Henrik Stenlund
2014-02-13
Logic in Computer Science · Computer Science
A simple formalization of alpha-equivalence
Kalmer Apinis, Danel Ahman
2026-01-16
Logic in Computer Science · Computer Science
Higher-Order Pattern Complement and the Strict Lambda-Calculus
Alberto Momigliano, Frank Pfenning
2008-10-22
Classical Analysis and ODEs · Mathematics
On the Asymptotic Integration of a System of Linear Differential Equations with Oscillatory Decreasing Coefficients
V. Sh. Burd, V. A. Karakulin
2015-11-03
Programming Languages · Computer Science
Call-By-Name Is Just Call-By-Value with Delimited Control
Mateusz Pyzik
2023-06-22
Programming Languages · Computer Science
Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
Beniamino Accattoli, Dan Ghica, Giulio Guerrieri, Cláudio Belo Lourenço +1
2025-07-22
Logic in Computer Science · Computer Science
Crumbling Abstract Machines
Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, Claudio Sacerdoti Coen
2019-07-16
Logic in Computer Science · Computer Science
Implementing Open Call-by-Value (Extended Version)
Beniamino Accattoli, Giulio Guerrieri
2017-02-02
General Mathematics · Mathematics
Inversion Formula
Henrik Stenlund
2017-12-07
Programming Languages · Computer Science
On Constructor Rewrite Systems and the Lambda Calculus
Ugo Dal Lago, Simone Martini
2019-03-14
Logic in Computer Science · Computer Science
An Unconventional View on Beta-Reduction in Namefree Lambda-Calculus
Rob Nederpelt, Ferruccio Guidi
2026-03-05
Classical Analysis and ODEs · Mathematics
Analytic Implicit Functions
Kyung Soo Rim
2022-07-12
Programming Languages · Computer Science
Reduction Strategies in the Lambda Calculus and Their Implementation through Derivable Abstract Machines: Introduction
Tomasz Drab
2024-05-22
Logic in Computer Science · Computer Science
Implicit complexity via structure transformation
Daniel Leivant, Jean-Yves Marion
2018-02-12
Programming Languages · Computer Science
The lambda mechanism in lambda calculus and in other calculi
M. H. van Emden
2015-06-01
Complex Variables · Mathematics
On the Laplace transform
Alexander G. Ramm
2024-11-21
Programming Languages · Computer Science
Automatic Modular Abstractions for Linear Constraints
David Monniaux
2008-11-04
Programming Languages · Computer Science
A Theory of Changes for Higher-Order Languages - Incrementalizing {\lambda}-Calculi by Static Differentiation
Yufei Cai, Paolo G. Giarrusso, Tillmann Rendel, Klaus Ostermann
2013-12-04
Programming Languages · Computer Science
Automatic modular abstractions for template numerical constraints
David Monniaux
2010-07-28
Logic in Computer Science · Computer Science
On the Elementary Affine Lambda-Calculus with and Without Fixed Points
Lê Thành Dũng Nguyen
2019-08-15