Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Garrin Kimmell"'
Autor:
Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump, Stephanie Weirich
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 76, Iss Proc. MSFP 2012, Pp 112-162 (2012)
We present a full-spectrum dependently typed core language which includes both nontermination and computational irrelevance (a.k.a. erasure), a combination which has not been studied before. The two features interact: to protect type safety we must b
Externí odkaz:
https://doaj.org/article/377d50b72b4a4b8fa419a7776956326a
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 1 (2013)
This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective. We show how standard meta-theoret
Externí odkaz:
https://doaj.org/article/d40f4a87ee974ec49b33523587023d48
Autor:
Dennis Abts, John Kim, Garrin Kimmell, Matthew Boyd, Kris Kang, Sahil Parmar, Andrew Ling, Andrew Bitar, Ibrahim Ahmed, Jonathan Ross
Publikováno v:
2022 IEEE Hot Chips 34 Symposium (HCS).
Publikováno v:
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks - Supplemental Volume (DSN-S).
Autor:
Dinesh Maheshwari, Purushotham Kamath, Dennis Abts, Jonathan Ross, Garrin Kimmell, Andrew Bell, Adrian Macias, Jennifer Hwang, Geert Rosseel, Jon Purdy, Richard Czekalski, Jonathan Sparling, Jeff Werner, Michael Beidler, Max Baker, Evan Laforge, Matt Boyd, Rebekah Leslie-Hurd, Brian Kurtz, Jim Sproch, E. R. Creswick, Temesghen Kahsai, Mahitha Venigalla, Gleb Gagarin, Michael Bye, John F. Thompson, Omar Ahmad, Tom Hawkins, Ashay Rane, Mark Wong-VanHaren, Sahil Parmar
Publikováno v:
ISCA
In this paper, we introduce the Tensor Streaming Processor (TSP) architecture, a functionally-sliced microarchitecture with memory units interleaved with vector and matrix deep learning functional units in order to take advantage of dataflow locality
Publikováno v:
Higher-Order and Symbolic Computation. 25:255-274
In this article we overview the design and implementation of the second generation of Kansas Lava. Driven by the needs and experiences of implementing telemetry decoders and other circuits, we have made a number of improvements to both the external A
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642229404
Trends in Functional Programming
Trends in Functional Programming
In this paper, we overview the design and implementation of our latest version of Kansas Lava. Driven by needs and experiences of implementing telemetry circuits, we have made a number of recent improvements to both the external API and the internal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bcb4de03a5206fda9fb0a7ed4c3cb58
https://doi.org/10.1007/978-3-642-22941-1_8
https://doi.org/10.1007/978-3-642-22941-1_8
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642229404
Trends in Functional Programming
Trends in Functional Programming
Kansas Lava is a functional hardware description language implemented in Haskell. In the course of attempting to generate ever larger circuits, we have found the need to effectively test and debug the internals of Kansas Lava. This includes confirmin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc29a7f41fde575b130db57bab7d9134
https://doi.org/10.1007/978-3-642-22941-1_7
https://doi.org/10.1007/978-3-642-22941-1_7
Publikováno v:
Implementation and Application of Functional Languages ISBN: 9783642164774
IFL
IFL
Kansas Lava is a domain specific language for hardware description. Though there have been a number of previous implementations of Lava, we have found the design space rich, with unexplored choices. We use a direct (Chalmers style) specification of c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db13d9a7040f6b8cea37151aeebb9d84
https://doi.org/10.1007/978-3-642-16478-1_2
https://doi.org/10.1007/978-3-642-16478-1_2
Publikováno v:
Domain-Specific Languages ISBN: 9783642030338
DSL
DSL
Recent research has shown how the formal modeling of concurrent systems can benefit from monadic structuring. With this approach, a formal system model is really a program in a domain specific language defined by a monad for shared-state concurrency.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8edb4900db7a7e3e9350974160a95a59
https://doi.org/10.1007/978-3-642-03034-5_2
https://doi.org/10.1007/978-3-642-03034-5_2