Polymorphic typed defunctionalization
DOI10.1145/964001.964009zbMATH Open1325.68049OpenAlexW2056292566MaRDI QIDQ3452252FDOQ3452252
Authors: 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
Recommendations
Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)
Cited In (16)
- Title not available (Why is that?)
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
- Filter models with polymorphic types
- Polytypic values possess polykinded types
- Polymorphic typed defunctionalization and concretization
- Type soundness for path polymorphism
- Transposing G to \(\text{C}^{\sharp}\): expressivity of generalized algebraic data types in an object-oriented language
- Basic polymorphic typechecking
- Refunctionalization at work
- Polymorphic type inference and containment
- Title not available (Why is that?)
- Polymorphic success types for Erlang
- Intensional polymorphism in type-erasure semantics
- Typed cross-module compilation
- Corrigendum: Polymorphic type assignment and CPS conversion
- Bunched polymorphism
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)
