Eta-conversion for the languages of explicit substitutions

DOI10.1007/BF01188746zbMATH Open0810.03010OpenAlexW4235981359MaRDI QIDQ1335136FDOQ1335136

Authors: Thérèse Hardin 

Publication date: 27 September 1994

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01188746

Recommendations

• Erratum: Eta-conversion for the languages of explicit substitutions
• Comparing and implementing calculi of explicit substitutions with eta-reduction
• Comparing calculi of explicit substitutions with eta-reduction
• Publication:4941993
• scientific article; zbMATH DE number 1500649
• Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
• Languages of k -interval exchange transformations
• Unification via the \(\lambda s_e\)-style of explicit substitutions
• Explicit substitutions calculi with one step eta-reduction decided explicitly
• scientific article; zbMATH DE number 1088029

zbMATH Keywords

confluence\(\lambda\)-calculus with explicit substitutionseta-conversion

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL

Cited In (9)

• Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
• Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
• Title not available (Why is that?)
• Explicit substitutions calculi with one step eta-reduction decided explicitly
• Comparing and implementing calculi of explicit substitutions with eta-reduction
• Comparing calculi of explicit substitutions with eta-reduction
• Erratum: Eta-conversion for the languages of explicit substitutions
• Foundations of Software Science and Computational Structures
• Formalization of a λ-calculus with explicit substitutions in Coq

This page was built for publication: Eta-conversion for the languages of explicit substitutions

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