Résultats de complétude pour des classes de types du système $\mathcal {AF}2$

DOI10.1051/ita/1997310605131zbMath0898.68045arXiv0905.0575OpenAlexW1845742793MaRDI QIDQ4389762

Samir Farkh, Karim Nour

Publication date: 24 May 1998

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.0575

zbMATH Keywords

\({\mathcal A} {\mathcal F}2\) type system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

A completeness result for a realisability semantics for an intersection type system, A completeness result for the simply typed \(\lambda \mu \)-calculus, Unnamed Item, Complete Types in an Extension of the System AF2

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Opérateurs de mise en mémoire et traduction de Gödel. (Storage operators and Gödel translation)
• Classical logic, storage operators and second-order lambda-calculus
• A semantical storage operator theorem for all types
• Opérateurs de mise en mémoire et types $\forall $-positifs
• Unnamed Item
• Unnamed Item