Decidability of the restriction equational theory in the partial lambda calculus
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 814613
- Computer Science Logic
- scientific article; zbMATH DE number 1095799
- Decidability of the restricted theories of a class of partial orders
- A finite equational axiomatization of the functional algebras for the lambda calculus
- Decidability of equational theories for subsignatures of relation algebra
- Restriction of term complexity in derivations and decidable fragments of predicate calculus
- Reducibility Proofs in the λ-Calculus
- scientific article; zbMATH DE number 4041328
- Typed Lambda Calculi and Applications
Cites work
Cited in
(6)- Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic
- scientific article; zbMATH DE number 814613 (Why is no real title available?)
- Toward a reduction system commuting with beta reduction in the partial lambda calculus
- The basis decision problem in λ‐calculus
- European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '93
- Cyclic Involutive Distributive Full Lambek Calculus is Decidable
This page was built for publication: Decidability of the restriction equational theory in the partial lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120561)