Polymorphic typed defunctionalization

DOI10.1145/964001.964009zbMATH Open1325.68049OpenAlexW2056292566MaRDI QIDQ3452252

François Pottier, N. Gauthier

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964009

zbMATH Keywords

polymorphismdefunctionalizationclosure conversiontype preservation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

Polymorphic typed defunctionalization and concretization ⋮ Polymorphic type inference and containment ⋮ Title not available (Why is that?) ⋮ Corrigendum: Polymorphic type assignment and CPS conversion ⋮ Bunched polymorphism ⋮ Filter models with polymorphic types ⋮ Polytypic values possess polykinded types ⋮ Basic polymorphic typechecking ⋮ Transposing G to \(\text{C}^{\sharp}\): expressivity of generalized algebraic data types in an object-oriented language ⋮ Title not available (Why is that?) ⋮ Polymorphic success types for Erlang ⋮ Typed cross-module compilation ⋮ Intensional polymorphism in type-erasure semantics

This page was built for publication: Polymorphic typed defunctionalization

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