scientific article; zbMATH DE number 814613

zbMATH Open0843.03004MaRDI QIDQ4855295

Silvio Valentini

Publication date: 14 December 1995

Title of this publication is not available (Why is that?)

zbMATH Keywords

decidabilitytyped lambda calculus\(\lambda\beta \eta\)-calculus

Mathematics Subject Classification ID

Could not fetch data.

Related Items (2)

Decidability of the restriction equational theory in the partial lambda calculus ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus 👍 👎
• A completeness result for the simply typed \(\lambda \mu \)-calculus 👍 👎
• Decidability of the restriction equational theory in the partial lambda calculus 👍 👎
• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus 👍 👎
• Computer Science Logic 👍 👎
• A quantitative model for simply typed λ-calculus 👍 👎

This page was built for publication:

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