Typing dynamic typing
From MaRDI portal
Publication:2949202
DOI10.1145/581478.581494zbMath1322.68035OpenAlexW1967061556MaRDI QIDQ2949202
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
Haskellcoercionsstatic typingquantified typesdynamic typingLeibniz' ruletype equalitytyped interpreters
Related Items
A Reflection on Types ⋮ Ambivalent Types for Principal Type Inference with GADTs ⋮ Deep embedding with class ⋮ A lean specification for gadts: System F with first-class equality proofs ⋮ Parametricity, type equality, and higher-order polymorphism ⋮ Transformation of structure-shy programs with application to XPath queries and strategic functions ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ Strongly Typed Rewriting For Coupled Software Transformation ⋮ Meta-programming With Built-in Type Equality
Uses Software
