Characterization of the principal type of normal forms in an intersection type system

DOI10.1007/3-540-62034-6_61zbMATH Open1541.68064MaRDI QIDQ6567783FDOQ6567783

Michel Mauny, Emilie Sayag

Publication date: 5 July 2024

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Cites Work

• A theory of type polymorphism in programming
• An extension of basic functionality theory for \(\lambda\)-calculus
• A filter lambda model and the completeness of type assignment
• Principal type scheme and unification for intersection type discipline
• Complete restrictions of the intersection type discipline
• Functional Characters of Solvable Terms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Typing and computational properties of lambda expressions
• Principal type schemes for an extended type theory
• Principal Type Schemes for the Strict Type Assignment System
• Title not available (Why is that?)
• Principal Typing in a ∀Λ-Discipline

This page was built for publication: Characterization of the principal type of normal forms in an intersection type system

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