Quantifier elimination and parametric polymorphism in programming languages

DOI10.1017/S0956796800000332zbMath0816.68027OpenAlexW2009058469MaRDI QIDQ4763983

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

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

Related Items (2)

An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ The complexity of type inference for higher-order typed lambda calculi

Uses Software

• Haskell
• Miranda

Cites Work

• Unnamed Item
• Basic polymorphic typechecking
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Denotational semantics of a para-functional programming language
• A theory of type polymorphism in programming
• A Machine-Oriented Logic Based on the Resolution Principle
• Intensional interpretations of functionals of finite type I

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