Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Eremondi Joseph"'
Publikováno v:
Open Computer Science, Vol 9, Iss 1, Pp 1-32 (2019)
Dependently-typed programming languages provide a powerful tool for establishing code correctness. However, it can be hard for newcomers to learn how to employ the advanced type system of such languages effectively. For simply-typed languages, severa
Externí odkaz:
https://doaj.org/article/b0582fd9b43043fea4d56567b3c570da
Autor:
Eremondi, Joseph
Ordinals can help prove termination for dependently typed programs. Brouwer trees are a particular ordinal notation that make it very easy to assign sizes to higher order data structures. They extend natural numbers with a limit constructor, so a fun
Externí odkaz:
http://arxiv.org/abs/2312.06962
Gradual dependent types can help with the incremental adoption of dependently typed code by providing a principled semantics for imprecise types and proofs, where some parts have been omitted. Current theories of gradual dependent types, though, lack
Externí odkaz:
http://arxiv.org/abs/2205.01241
Harnessing the power of dependently typed languages can be difficult. Programmers must manually construct proofs to produce well-typed programs, which is not an easy task. In particular, migrating code to these languages is challenging. Gradual typin
Externí odkaz:
http://arxiv.org/abs/2107.04859
Publikováno v:
Proc. ACM Program. Lang. 3, ICFP, Article 88 (July 2019), 30 pages
Dependent types help programmers write highly reliable code. However, this reliability comes at a cost: it can be challenging to write new prototypes in (or migrate old code to) dependently-typed programming languages. Gradual typing makes static typ
Externí odkaz:
http://arxiv.org/abs/1906.06469
Autor:
Eremondi, Joseph
Set constraints provide a highly general way to formulate program analyses. However, solving arbitrary boolean combinations of set constraints is NEXPTIME-hard. Moreover, while theoretical algorithms to solve arbitrary set constraints exist, they are
Externí odkaz:
http://arxiv.org/abs/1905.09423
Autor:
Eremondi, Joseph S.
Dependently typed programming languages provide a way to write programs, specifications, and correctness proofs using a single language. If a dependent type checker accepts a program, the programmer can be assured that it behaves according to the spe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47873e2e421db6669ec626621c26a18a
Publikováno v:
Ecological Genomics; Jan2019, Vol. 9 Issue 1, p1-32, 32p
Publikováno v:
Proceedings of the 4th International Symposium on Pervasive Displays; 6/20/2016, p87-105, 19p