Algorithms for extended alpha-equivalence and complexity

DOI10.4230/LIPICS.RTA.2013.255MaRDI QIDQ2958388zbMATH OpenOpenAlexFDO

Authors Conrad Rau, David Sabel, Manfred Schmidt-Schauß

Publication date 1 February 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.RTA.2013.255

zbMATH Keywords

alpha-equivalencedeductionhigher-order calculipi-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the complexity of alpha conversion
• Nominal Matching and Alpha-Equivalence
• Alpha equivalence equalities
• A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols
• Matching and alpha-equivalence check for nominal terms

Cited in

(6)

• Nominal unification with letrec and environment-variables
• Nominal Unification and Matching of Higher Order Expressions with Recursive Let
• Structural rewriting in the pi-calculus
• On the complexity of alpha conversion
• Foundations of Software Science and Computational Structures
• Towards Fast Nominal Anti-unification of Letrec-Expressions

This page was built for publication: Algorithms for extended alpha-equivalence and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958388)