Reducibility

DOI10.1016/S1571-0661(04)80493-6zbMath1270.03031OpenAlexW1567648932MaRDI QIDQ2842839

Silvia Likavec, Silvia Ghilezan

Publication date: 16 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80493-6

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• An extension of basic functionality theory for \(\lambda\)-calculus
• Typing untyped \(\lambda\)-terms, or reducibility strikes again!
• Strong normalization and typability with intersection types
• A new type assignment for λ-terms
• A filter lambda model and the completeness of type assignment
• Church-Rosser theorem for typed functional systems
• Logical relations and the typed λ-calculus
• Intensional interpretations of functionals of finite type I

This page was built for publication: Reducibility