Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version
Work
Year: 2023
Type: article
Abstract: We introduce renaming-enriched sets ( rensets for short), which are algebraic structures axiomatizing fundamental properties of renaming (also known as variable-for-variable substitution) on syntax w... more
Source: Journal of Automated Reasoning
Author Andrei Popescu
Institution University of Sheffield
Cites: 61
Cited by: 1
Related to: 10
FWCI: 0.285
Citation percentile (by year/subfield): 49.75
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890