Eta-conversion for the languages of explicit substitutions
From MaRDI portal
(Redirected from Publication:1335136)
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
Cites work
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3609632 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- The lambda calculus. Its syntax and semantics. Rev. ed.
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)
- scientific article; zbMATH DE number 2185655 (Why is no real title available?)
- 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)