Correctness of compiling polymorphism to dynamic typing
From MaRDI portal
Publication:5371998
DOI10.1017/S0956796816000265zbMath1420.68056MaRDI QIDQ5371998
Robert Harper, Kuen-Bang Hou (Favonia), Nick Benton
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Logic in computer science (03B70)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- 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.
- LCF considered as a programming language
- A theory of type polymorphism in programming
- Relational properties of domains
- Combinatory logic. Vol. II
- Syntactic Logical Relations for Polymorphic and Recursive Types
- Embedding an interpreted language using higher-order functions and types
- Contracts for higher-order functions
- Embedded interpreters
- Data Types as Lattices
- A kripke logical relation between ML and assembly
- Blame for all
This page was built for publication: Correctness of compiling polymorphism to dynamic typing