Automatically generating the dynamic semantics of gradually typed languages

DOI10.1145/3009837.3009863zbMath1380.68082OpenAlexW2566906701MaRDI QIDQ5370913

Jeremy G. Siek, Matteo Cimini

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

operational semanticsmethodologytype systemsgradual typing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Migrating gradual types ⋮ Unnamed Item ⋮ Type Inference for Rank 2 Gradual Intersection Types ⋮ Call-by-name Gradual Type Theory ⋮ System description: lang-n-change -- a tool for transforming languages ⋮ Gradual type theory

Uses Software

• Abella
• Agda
• TypeScript
• gradualizerDynamicSemantics

This page was built for publication: Automatically generating the dynamic semantics of gradually typed languages