Correctness of compiling polymorphism to dynamic typing
From MaRDI portal
Publication:5371998
DOI10.1017/S0956796816000265zbMATH Open1420.68056MaRDI QIDQ5371998FDOQ5371998
Authors: Kuen-Bang Hou (Favonia), Nick Benton, Robert Harper
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Recommendations
Theory of compilers and interpreters (68N20) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)
Cites Work
- A theory of type polymorphism in programming
- LCF considered as a programming language
- Notions of computation and monads
- Data Types as Lattices
- Relational properties of domains
- Combinatory logic. Vol. II
- Title not available (Why is that?)
- A kripke logical relation between ML and assembly
- Contracts for higher-order functions
- Blame for all
- Syntactic logical relations for polymorphic and recursive types
- Programming languages and systems. 15th European symposium on programming, ESOP 2006, held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Vienna, Austria, March 27--28, 2006. Proceedings.
- Title not available (Why is that?)
- Embedded interpreters
- Embedding an interpreted language using higher-order functions and types
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Correctness of compiling polymorphism to dynamic typing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371998)