On the semantics of polymorphism

DOI10.1007/BF00289413zbMath0504.03007OpenAlexW2008297923MaRDI QIDQ1835664

Mario Coppo

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289413

zbMATH Keywords

typescorrectnesscompleteconsistent typesCurry's functionality theorysoundness theorem

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

A characterization of F-complete type assignments ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Type inference with simple subtypes

Uses Software

• ML

Cites Work

• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• \(\mathbb{T}^\omega\) as a universal domain
• The lambda calculus, its syntax and semantics
• LCF considered as a programming language
• A theory of type polymorphism in programming
• Edinburgh LCF. A mechanized logic of computation
• The completeness theorem for typing lambda-terms
• A filter lambda model and the completeness of type assignment
• On the Semantics of “Data Type”
• The Principal Type-Scheme of an Object in Combinatory Logic
• Modified basic functionality in combinatory logic

This page was built for publication: On the semantics of polymorphism