Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Union type"'
Autor:
Pedersen, Willy, Blekesaune, Morten
Publikováno v:
Acta Sociologica, 2003 Sep 01. 46(3), 179-193.
Externí odkaz:
https://www.jstor.org/stable/4194982
Autor:
Xuejing Huang, Bruno C. d. S. Oliveira
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-24
Subtyping with intersection and union types is nowadays common in many programming languages. From the perspective of logic, the subtyping problem is essentially the problem of determining logical entailment : does a logical statement follow from ano
Publikováno v:
LANMR
Dynamic typed languages are characterized by their expressiveness and flexibility to develop prototypes, while static typed languages allow early detection of errors and the optimization of source code. Gradual typing languages allow programmers to m
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2022, 49th ACM SIGPLAN Symposium on Principles of Programming Languages, 6 (POPL), pp.75. ⟨10.1145/3498674⟩
Proceedings of the ACM on Programming Languages, 2022, 49th ACM SIGPLAN Symposium on Principles of Programming Languages, 6 (POPL), pp.75. ⟨10.1145/3498674⟩
Proceedings of the ACM on Programming Languages, ACM, 2022, 49th ACM SIGPLAN Symposium on Principles of Programming Languages, 6 (POPL), pp.75. ⟨10.1145/3498674⟩
Proceedings of the ACM on Programming Languages, 2022, 49th ACM SIGPLAN Symposium on Principles of Programming Languages, 6 (POPL), pp.75. ⟨10.1145/3498674⟩
We extend classic union and intersection type systems with a type-case construction and show that the combination of the union elimination rule of the former and the typing rules for type-cases of our extension encompasses occurrence typing . To appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d6d0123aac00b349d32fabd39fb9442
https://hal.archives-ouvertes.fr/hal-03426711/file/main.pdf
https://hal.archives-ouvertes.fr/hal-03426711/file/main.pdf
Autor:
Anastasia Veneti
Eρευνούμε τη λογική θεμελίωση του συστήματος τύπων τομής και ένωσης IUT υπό το πρίσμα του ισομορφισμού Curry-Howard. Πιο συγκεκριμένα, αναζητού
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0aeb3e749f17cdced76b9af254862ce0
https://doi.org/10.12681/eadd/36745
https://doi.org/10.12681/eadd/36745
Publikováno v:
Fundamenta Informaticae. 170:39-92
Autor:
Gunnard Engebreth
Publikováno v:
PHP 8 Revealed ISBN: 9781484268179
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69cd21b8f1a3c4847e32642fc43dea1c
https://doi.org/10.1007/978-1-4842-6818-6_2
https://doi.org/10.1007/978-1-4842-6818-6_2
Autor:
Delia Kesner, Pierre Vial
Publikováno v:
LICS
We prove that type systems are able to capture exact measures related to dynamic properties of functional programs with control operators, which allow implementing intricate continuations and backtracking. Our type systems give the number of evaluati
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