Typing dynamic typing

DOI10.1145/581478.581494MaRDI QIDQ2949202zbMATH OpenOpenAlexFDO

Authors Arthur I. Baars, S. Doaitse Swierstra

Publication date 7 October 2015

Published in Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

coercionsstatic typingHaskellquantified typesdynamic typingLeibniz' ruletype equalitytyped interpreters

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Recommendations

• Dynamic typing: Syntax and proof theory
• Dynamic typing in polymorphic languages
• A Compilation Method for Dynamic Typing in ML
• A reflection on types
• A library for polymorphic dynamic typing

Cited in

(16)

• Transformation of structure-shy programs with application to XPath queries and strategic functions
• Preemptive type checking
• Ambivalent types for principal type inference with GADTs
• A reflection on types
• Meta-programming with built-in type equality
• Implementation of Functional Languages
• Strongly typed rewriting for coupled software transformation
• Static type checking without downcast operator
• Typing unmarshalling without marshalling types
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• A Compilation Method for Dynamic Typing in ML
• A lean specification for gadts: System F with first-class equality proofs
• A library for polymorphic dynamic typing
• Deep embedding with class
• Parametricity, type equality, and higher-order polymorphism
• Dynamic typing: Syntax and proof theory

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Typing dynamic typing

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