On the computability of relations on -terms and Rice's theorem -- the case of the expansion problem for explicit substitutions

DOI10.1007/978-3-642-54423-1_18zbMATH Open1406.03040DBLPconf/latin/HaeuslerA14OpenAlexW216691121WikidataQ58001392 ScholiaQ58001392MaRDI QIDQ5405040FDOQ5405040

Authors: Edward Hermann Haeusler, Mauricio Ayala-Rincón 

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_18

Recommendations

• The Expansion Problem in Lambda Calculi with Explicit Substitution
• Explicit substitutions calculi with one step eta-reduction decided explicitly
• scientific article; zbMATH DE number 4182831
• Comparing calculi of explicit substitutions with eta-reduction
• Explicit substitutions

zbMATH Keywords

\(\lambda\)-calculusRice's theoremexplicit substitutionScott's theorem

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (1)

• The Expansion Problem in Lambda Calculi with Explicit Substitution

This page was built for publication: On the computability of relations on \(\lambda \)-terms and Rice's theorem -- the case of the expansion problem for explicit substitutions

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