Decidability of the restriction equational theory in the partial lambda calculus

DOI10.1016/0304-3975(89)90029-7zbMath0673.03011OpenAlexW2033325992WikidataQ126377493 ScholiaQ126377493MaRDI QIDQ1120561

Ramón Pino Pérez

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90029-7

zbMATH Keywords

equational theorypartial \(\lambda \) -calculus

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Related Items (1)

European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '93

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• The hereditary partial effective functionals and recursion theory in higher types
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of the restriction equational theory in the partial lambda calculus