Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mark Tullsen"'
Autor:
Bradford Larsen, EW Davis, Evan A. Sultanik, Carson Harmon, Walter Woods, Nichole Schimanski, Sam Cowger, Trent Brunson, William R. Harris, Mark Tullsen, Yerim Lee, Richard Jones
Publikováno v:
SP Workshops
When $a$ data format achieves a significant level of adoption, the presence of multiple format implementations expands the original specification in often-unforeseen ways. This results in an implicitly defined, de facto format, which can create vulne
Publikováno v:
Computer Aided Verification ISBN: 9783319961415
CAV (2)
CAV (2)
Vehicle-to-Vehicle (V2V) communications is a “connected vehicles” standard that will likely be mandated in the U.S. within the coming decade. V2V, in which automobiles broadcast to one another, promises improved safety by providing collision warn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b705a8833c80b494356566d356e963a
https://doi.org/10.1007/978-3-319-96142-2_25
https://doi.org/10.1007/978-3-319-96142-2_25
Autor:
Mark Tullsen, Matthew J. Sottile
Publikováno v:
IPDPS Workshops
Graphs are frequently represented and manipulated in the form of arrays encoding their adjacency matrices. Programs that operate on these arrays, for example, using linear algebra operations to encode graph algorithm primitives, can benefit from opti
Publikováno v:
IEEE Software. :1-1
Autor:
Mark Tullsen
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540677277
MPC
MPC
Many have recognized the need for genericity in programming and program transformation. Genericity over data types has been achieved with polymorphism. Genericity over type constructors, often called polytypism, is an area of active research. This pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::977dfe35647df63e466c282703d3d464
https://doi.org/10.1007/10722010_3
https://doi.org/10.1007/10722010_3
Autor:
Mark Tullsen
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783540669920
PADL
PADL
Pattern matching is a great convenience in programming. However, pattern matching has its problems: it conflicts with data abstraction; it is complex (at least in Haskell, which has pattern guards, irrefutable patterns, n+k patterns, as patterns, etc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a4878c30e0820462f4e780f25cb4052
https://doi.org/10.1007/3-540-46584-7_1
https://doi.org/10.1007/3-540-46584-7_1