Zobrazeno 1 - 10
of 129
pro vyhledávání: '"Polonsky, Andrew"'
Autor:
Pak, Peter Myung-Won, Ogoke, Francis, Polonsky, Andrew, Garland, Anthony, Bolintineanu, Dan S., Moser, Dan R., Heiden, Michael J., Farimani, Amir Barati
We present a deep learning approach for quantifying and localizing ex-situ porosity within Laser Powder Bed Fusion fabricated samples utilizing in-situ thermal image monitoring data. Our goal is to build the real time porosity map of parts based on t
Externí odkaz:
http://arxiv.org/abs/2404.16882
Autor:
Statman, Richard, Polonsky, Andrew
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Veneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing term $M$ a
Externí odkaz:
http://arxiv.org/abs/2105.02352
Autor:
Lamb, James, Pusch, Kira M., Polonsky, Andrew T., Forsik, Stéphane A.J., Zhou, Ning, Dicus, Austin D., Geurts, Remco, Echlin, McLean P., Pollock, Tresa M.
Publikováno v:
In Scripta Materialia 15 January 2024 239
Autor:
Polonsky, Andrew T., Madison, Jonathan D., Arnhart, Mary, Jin, Helena, Karlson, Kyle N., Skulborstad, Alyssa J., Foulk, James W., Murawski, Scott G.
Publikováno v:
In Tomography of Materials and Structures June 2023 2
Autor:
Karlson, Kyle N., Skulborstad, Alyssa J., Madison, Jonathan D., Polonsky, Andrew T., Jin, Helena, Jones, Amanda, Sanborn, Brett, Kramer, Sharlotte L.B., Antoun, Bonnie R., Lu, Wei-Yang
Publikováno v:
In Tomography of Materials and Structures June 2023 2
Autor:
Polonsky, Andrew
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 3 (July 23, 2020) lmcs:4872
Corrado B\"ohm once observed that if $Y$ is any fixed point combinator (fpc), then $Y(\lambda yx.x(yx))$ is again fpc. He thus discovered the first "fpc generating scheme" -- a generic way to build new fpcs from old. Continuing this idea, define an $
Externí odkaz:
http://arxiv.org/abs/1810.02239
Autor:
Polonsky, Andrew, Statman, Richard
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (September 21, 2022) lmcs:4849
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing term M ad
Externí odkaz:
http://arxiv.org/abs/1809.08169
Autor:
Johann, Patricia, Polonsky, Andrew
We prove that if $\mathcal{A}$ is a locally $\lambda$-presentable category and $T : \mathcal{A} \to \mathcal{A}$ is a $\lambda$-accessible functor then $T/\mathcal{A}$ is locally $\lambda$-presentable.
Externí odkaz:
http://arxiv.org/abs/1807.05263
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 1 (January 29, 2019) lmcs:4305
The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal forms, eq
Externí odkaz:
http://arxiv.org/abs/1802.07320
Autor:
Polonsky, Andrew T., Raghavan, Narendran, Echlin, McLean P., Kirka, Michael M., Dehoff, Ryan R., Pollock, Tresa M.
Publikováno v:
In Materials Characterization August 2022 190