Quantifier elimination and parametric polymorphism in programming languages

DOI10.1017/S0956796800000332MaRDI QIDQ4763983zbMATH OpenOpenAlexFDO

Authors Harry G. Mairson

Publication date 1 May 1995

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796800000332

zbMATH Keywords

lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Quantifier elimination, model completeness, and related topics (03C10) Theory of programming languages (68N15)

Recommendations

• Polymorphism, subtyping, and type inference in MLsub
• Parametric polymorphism and operational equivalence
• Formal parametric polymorphism
• scientific article; zbMATH DE number 18625

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A theory of type polymorphism in programming
• Basic polymorphic typechecking
• Denotational semantics of a para-functional programming language
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• Intensional interpretations of functionals of finite type I
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(4)

• scientific article; zbMATH DE number 1088035 (Why is no real title available?)
• Parametric polymorphism and operational equivalence
• An analysis of the Core-ML language: Expressive power and type reconstruction
• The complexity of type inference for higher-order typed lambda calculi

Describes a project that uses

Uses Software

• Miranda
• Haskell

This page was built for publication: Quantifier elimination and parametric polymorphism in programming languages

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