Polymorphic typed defunctionalization and concretization

DOI10.1007/S10990-006-8611-7zbMath1105.68018OpenAlexW2129566109MaRDI QIDQ853737

Nadji Gauthier, François Pottier

Publication date: 17 November 2006

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-006-8611-7

zbMATH Keywords

PolymorphismClosure conversionConcretizationDefunctionalizationDictionary recordsPolymorphic recordsType classesType-preserving compilation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Refunctionalization at work

Uses Software

• ML
• Haskell
• SmallEiffel
• TALx86

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A semantics of multiple inheritance
• A theory of type polymorphism in programming
• Definitional interpreters revisited
• Definitional interpreters for higher-order programming languages
• Modular statically typed multimethods
• Guarded recursive datatype constructors
• Polymorphic typed defunctionalization
• From ML to Ada: Strongly-typed language interoperability via source translation
• Functional unparsing
• Stack-based typed assembly language
• Type-driven defunctionalization
• Types for Proofs and Programs
• Programming Languages and Systems

This page was built for publication: Polymorphic typed defunctionalization and concretization