Automatically generating the dynamic semantics of gradually typed languages

DOI10.1145/3009837.3009863zbMATH Open1380.68082OpenAlexW2566906701MaRDI QIDQ5370913FDOQ5370913

Authors: Matteo Cimini, Jeremy G. Siek 

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

Recommendations

• The Gradualizer: a methodology and algorithm for generating gradual type systems
• Abstracting gradual typing
• Principal type schemes for gradual programs
• Gradual type theory
• Space-efficient gradual typing

zbMATH Keywords

type systemsmethodologyoperational semanticsgradual typing

Mathematics Subject Classification ID

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

Cited In (8)

• Gradual type theory
• Type Inference for Rank 2 Gradual Intersection Types
• Language transformations in the classroom
• Call-by-name gradual type theory
• The Gradualizer: a methodology and algorithm for generating gradual type systems
• Migrating gradual types
• Call-by-name gradual type theory
• System description: lang-n-change -- a tool for transforming languages

Uses Software

• Abella
• Agda
• TypeScript
• gradualizerDynamicSemantics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370913)