Zobrazeno 1 - 10
of 85
pro vyhledávání: '"G. Siek"'
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-32. ⟨10.1145/3290329⟩
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-32. ⟨10.1145/3290329⟩
We define a new, more semantic interpretation of gradual types and use it to ``gradualize'' two forms of polymorphism: subtyping polymorphism and implicit parametric polymorphism. In particular, we use the new interpretation to define three gradual t
Autor:
Jeremy G. Siek, Tianyu Chen
Publikováno v:
SP Workshops
We model a security-typed language with gradual information flow labels in a proof assistant, demonstrate its potential application to parsing and securing sensitive user input data, present the semantics as a definitional interpreter, and prove type
Publikováno v:
Siek, J G, Thiemann, P & Wadler, P 2021, ' Blame and coercion: Together again for the first time ', Journal of Functional Programming, vol. 31, e20 . https://doi.org/10.1017/S0956796821000101
Siek, J, Thiemann, P & Wadler, P 2015, Blame and Coercion: Together Again for the First Time . in 36th annual ACM SIGPLAN conference on Programming Language Design and Implementation : Portland OR 13-17 June 2015 . pp. 425-435 . https://doi.org/10.1145/2737924.2737968
PLDI
Siek, J, Thiemann, P & Wadler, P 2015, Blame and Coercion: Together Again for the First Time . in 36th annual ACM SIGPLAN conference on Programming Language Design and Implementation : Portland OR 13-17 June 2015 . pp. 425-435 . https://doi.org/10.1145/2737924.2737968
PLDI
C#, Dart, Pyret, Racket, TypeScript, VB: many recent languages integrate dynamic and static types via gradual typing. We systematically develop four calculi for gradual typing and the relations between them, building on and strengthening previous wor
Autor:
Tianyu Chen, Jeremy G. Siek
Publikováno v:
Journal of Functional Programming. 31
The research on gradual typing has led to many variations on the Gradually Typed Lambda Calculus (GTLC) of Siek & Taha (2006) and its underlying cast calculus. For example, Wadler and Findler (2009) added blame tracking, Siek et al. (2009) investigat
Publikováno v:
SLE
SLE 2020-13th ACM SIGPLAN/International Conference on Software Language Engineering
SLE 2020-13th ACM SIGPLAN/International Conference on Software Language Engineering, Nov 2020, Virtual, United States
SLE 2020-13th ACM SIGPLAN/International Conference on Software Language Engineering
SLE 2020-13th ACM SIGPLAN/International Conference on Software Language Engineering, Nov 2020, Virtual, United States
International audience; We present a type system over language definitions that classifies parts of the operational semantics of a language in input, and models a common language design organization. The resulting typing discipline guarantees that th
Publikováno v:
Proceedings of the ACM on Programming Languages. 1:1-24
While gradual typing has proven itself attractive to programmers, many systems have avoided sound gradual typing due to the run time overhead of enforcement. In the context of sound gradual typing, both anecdotal and systematic evidence has suggested
Publikováno v:
IFL
31st International Symposium on Implementation and Application of Functional Languages (IFL '19)
31st International Symposium on Implementation and Application of Functional Languages (IFL '19), Sep 2019, Singapour, Singapore. ⟨10.1145/3412932.3412940⟩
31st International Symposium on Implementation and Application of Functional Languages (IFL '19), Sep 2019, Singapour, Singapore
31st International Symposium on Implementation and Application of Functional Languages (IFL '19)
31st International Symposium on Implementation and Application of Functional Languages (IFL '19), Sep 2019, Singapour, Singapore. ⟨10.1145/3412932.3412940⟩
31st International Symposium on Implementation and Application of Functional Languages (IFL '19), Sep 2019, Singapour, Singapore
International audience; We describe the design and implementation of a virtual machine for programming languages that use gradual typing with set-theoretic types focusing on practical issues such as runtime space efficiency, and efficient implementat
Publikováno v:
PLDI
Gradual typing combines static and dynamic typing in the same program. Siek et al. (2015) describe five criteria for gradually typed languages, including type soundness and the gradual guarantee. A significant number of languages have been developed
Publikováno v:
DLS
Gradual typing enables programmers to combine static and dynamic typing in the same language. However, ensuring a sound interaction between the static and dynamic parts can incur significant runtime cost. In this paper, we perform a detailed performa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2172be9d4d1c847b0f5b1a063a5ab30a
Autor:
Matteo Cimini, Jeremy G. Siek
Publikováno v:
POPL
Many languages are beginning to integrate dynamic and static typing. Siek and Taha offered gradual typing as an approach to this integration that provides a coherent and full-span migration between the two disciplines. However, the literature lacks a