Semantics-directed Machine Architecture in ReWire. Procter, A., Harrison, W. L., Graves, I., Becchi, M., & Allwein, G. In Proceedings of the 2013 International Conference on Field Programmable Technology, pages 446-449, Dec, 2013. Paper abstract bibtex The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.
@inproceedings{icfpt13,
title = "Semantics-directed Machine Architecture in ReWire",
booktitle = "Proceedings of the 2013 International Conference on Field Programmable Technology",
author = "Adam Procter and William L. Harrison and Ian Graves and Michela Becchi and Gerard Allwein",
year = 2013,
month={Dec},
pages={446-449},
abstract={The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.},
keywords={electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics},
url_Paper = "https://harrisonwl.github.io/assets/papers/icfpt13.pdf",
}
Downloads: 0
{"_id":"ww6xmvQjKB8aAT5ea","bibbaseid":"procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-2013","downloads":0,"creationDate":"2016-07-28T19:31:33.103Z","title":"Semantics-directed Machine Architecture in ReWire","author_short":["Procter, A.","Harrison, W. L.","Graves, I.","Becchi, M.","Allwein, G."],"year":2013,"bibtype":"inproceedings","biburl":"https://harrisonwl.github.io/assets/bibliography/harrison.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Semantics-directed Machine Architecture in ReWire","booktitle":"Proceedings of the 2013 International Conference on Field Programmable Technology","author":[{"firstnames":["Adam"],"propositions":[],"lastnames":["Procter"],"suffixes":[]},{"firstnames":["William","L."],"propositions":[],"lastnames":["Harrison"],"suffixes":[]},{"firstnames":["Ian"],"propositions":[],"lastnames":["Graves"],"suffixes":[]},{"firstnames":["Michela"],"propositions":[],"lastnames":["Becchi"],"suffixes":[]},{"firstnames":["Gerard"],"propositions":[],"lastnames":["Allwein"],"suffixes":[]}],"year":"2013","month":"Dec","pages":"446-449","abstract":"The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.","keywords":"electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics","url_paper":"https://harrisonwl.github.io/assets/papers/icfpt13.pdf","bibtex":"@inproceedings{icfpt13,\n title = \"Semantics-directed Machine Architecture in ReWire\",\n booktitle = \"Proceedings of the 2013 International Conference on Field Programmable Technology\",\n author = \"Adam Procter and William L. Harrison and Ian Graves and Michela Becchi and Gerard Allwein\",\n year = 2013,\nmonth={Dec}, \npages={446-449}, \nabstract={The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.}, \nkeywords={electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics}, \n url_Paper = \"https://harrisonwl.github.io/assets/papers/icfpt13.pdf\",\n}\n\n","author_short":["Procter, A.","Harrison, W. L.","Graves, I.","Becchi, M.","Allwein, G."],"key":"icfpt13","id":"icfpt13","bibbaseid":"procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-2013","role":"author","urls":{" paper":"https://harrisonwl.github.io/assets/papers/icfpt13.pdf"},"keyword":["electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics"],"metadata":{"authorlinks":{"harrison, w":"https://harrisonwl.github.io/etc/publications.html"}}},"search_terms":["semantics","directed","machine","architecture","rewire","procter","harrison","graves","becchi","allwein"],"keywords":["electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;fpga;mms;rewire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;field programmable gate arrays;hardware;microcontrollers;ports (computers);random access memory;registers;semantics"],"authorIDs":["5dc475579b60c2df010000fb","5dee581feaaee4df01000254","5df9dbe338a7afde010000b8","5e03c9676d2066de01000013","5e2b8df4f92538df01000009","5e55f36cc2c8a2df010000f1","5e64fd0d5fc0b7de010000d4","BPp6pLGb3wvE8tPNi","GrcodozaBpTrw2nXH","NmXf49aeDyLF3AL8F","a66s2jJ42S97qQxnX","iCiuqX2A39oLpzRv9","njB2ZmsnMejPsL7oC","uBWQddfiBuSzTqKrJ","xkL56M792TvXx8Hef"],"dataSources":["wAeScLDKnpPTHdYwg","uCveoExKMHQNZnZCp"]}