Un résultat de complétude pour les types ∀+ du système F

DOI10.1016/S0764-4442(97)82979-5zbMath0908.03032arXiv0905.0592MaRDI QIDQ4219570

Samir Farkh, Karim Nour

Publication date: 24 January 1999

Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

completenesstype system \({\mathcal F}\)types with positive quantifiers

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A completeness result for a realisability semantics for an intersection type system ⋮ Les types de données syntaxiques du système ${\cal F}$ ⋮ A completeness result for the simply typed \(\lambda \mu \)-calculus

This page was built for publication: Un résultat de complétude pour les types ∀+ du système F