Correctness of compiling polymorphism to dynamic typing
From MaRDI portal
Publication:5371998
Recommendations
Cites work
- scientific article; zbMATH DE number 3902021 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 1333617 (Why is no real title available?)
- A Kripke logical relation between ML and assembly
- A theory of type polymorphism in programming
- Blame for all
- Combinatory logic. Vol. II
- Contracts for higher-order functions
- Data Types as Lattices
- Embedded interpreters
- Embedding an interpreted language using higher-order functions and types
- LCF considered as a programming language
- 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.
- Relational properties of domains
- Syntactic logical relations for polymorphic and recursive types
Cited in
(4)
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)