Skip to main content
Conference Proceedings

Compiling Joy into silicon: An exercise in applied structural operational semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 666 LNCS 639-659
DOI: 10.1007/3-540-56596-5_50
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present the highlights of an algorithm and correctness proof for compiling programs written in Joy, a simple parallel language, into delay-insensitive circuits. The proof relies heavily on techniques of structural operational semantics, many of which should generalize to similar settings.

Cite

CITATION STYLE

APA

Weber, S., Bloom, B., & Brown, G. (1993). Compiling Joy into silicon: An exercise in applied structural operational semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 666 LNCS, pp. 639–659). Springer Verlag. https://doi.org/10.1007/3-540-56596-5_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free