On embedding a microarchitectural design language within Haskell

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 60-69

  Launchbury, John ^a   Lewis, Jeffrey R ^a   Cook, Byron ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN LANGUAGES; EMBEDDED LANGUAGES; HASKELL; STATE MONADS; TYPE CLASS;

MODELING LANGUAGES;

EID: 17144429343     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317784     Document Type: Article

References (37)

1. Hawk website. http://www.cse.ogi.edu/PacSoft/projects/Hawk/.
2. AAGAARD, M., AND LEESER, M. Reasoning about pipelines with structural hazards. In Second International Conference on Theorem Provers in Circuit Design (Bad Herrenalb, Germany, Sept. 1994).
3. BJESSE, P., CLAESSEN, K., SHEERAN, M., AND SINGH, S. Lava: Hardware design in Haskell. In International Conference on Functional Programming (Baltimore, July 1998).
4. BRYANT, R. E. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24, 3 (1992).
5. COOK, B., LAUNCHBURY, J., AND MATTHEWS, J. Specifying superscalar microprocessors with Hawk. In Workshop on Formal Techniques for Hardware (Maarstrand, Sweden, June 1998).
6. COOK, B., LAUNCHBURY, J., MATTHEWS, J., AND KIEBURTZ, D. Formal verification of explicitly parallel microprocessors. In Conference on Correct Hardware Design and Verification Methods (1999).
7. DAY, N. A., LAUNCHBURY, J., AND LEWIS, J. R. Logical abstractions in Haskell. submitted for publication, 1999.
8. DAY, N. A., LEWIS, J. R., AND COOK, B. Symbolic simulation of microprocessor models using type classes in Haskell. Tech. Rep. CSE-99-005, Department of Computer Science and Engineering, Oregon Graduate Institute, 1999.
9. DULONG, C. The IA-64 architecture at work. IEEE Computer 31, 7 (1998).
10. ELLIOTT, C. An embedded modeling language approach to interactive 3D and multimedia animation. To appear in IEEE Transactions on Software Engineering (1999).
11. ELLIOTT, C., AND HUDAK, P. Functional reactive animation. In The International Conference on Functional Programming (Amsterdam, The Netherlands, June 1997).
12. FINNE, S., LEIJEN, D., MEIJER, E., AND JONES, S. P. H/Direct: A binary foreign language interface for Haskell. In International Conference on Functional Programming (Baltimore, July 1998).
13. GWENNAP, L. First Merced patent surfaces. Microprocessor Report 11, 3 (1997).
14. GWENNAP, L. Intel, HP make EPIC disclosure. Microprocessor Report 11, 14 (1997).
15. HAZELHURST, S., AND SEGER, C.-J. H. Symbolic trajectory evaluation. In Formal Hardware Verification. Springer-Verlog, 1997.
16. JONES, G., AND SHEERAN, M. Collecting butterflies. Tech. rep., Oxford University Computing Laboratory, 1991.
17. JONES, G., AND SHEERAN, M. Designing arithmetic circuits by refinement in ruby. In Mathematics of Program Construction (1993), vol. 669 of LNCS, Springer Verlag.
18. JONES, M. P. Qualified Types: Theory and Practice. PhD thesis, Department of Computer Science, Oxford University, 1992.
19. JONES, S. P., AND MARLOW, S. Stretching the storage manager: weak pointers and stable names in Haskell, 1999. Submitted for publication.
20. LANDIN, P. J. The Next 700 Programming Languages. Communications of the ACM 9, 3 (March 1966), 157-164.
21. LAUNCHBURY, J., AND JONES, S. P. Lazy functional state threads. In Programming Languages Design and Implementation (Orlando, Florida, 1994), ACM Press.
22. LAUNCHBURY, J., AND PATTERSON, R. Parametricity and unboxing with unpointed types. In The International Conference on Functional Programming (1996).
23. LAUNCHBURY, J., AND PEYTON JONES, S. L. State in Haskell. Lisp and Symbolic Computation 8, 4 (December 1995), 293-341.
24. MATTHEWS, J. Recursive function definition over coinductive types. In The 12th International Conference on Theorem Proving in Higher Order Logics (Sept. 1999).
25. MATTHEWS, J., AND LAUNCHBURY, J. Elementary microarchitecture algebra. In International Conference on Computer-Aided Verification (Trento, Italy, July 1999).
26. MATTHEWS, J., AND LAUNCHBURY, J. Elementary microarchitecture algebra: Top-level proof of pipelined microarchitecture. Tech. Rep. CSE-99-002, Oregon Graduate Institute, Computer Science Department, Portland, Oregon, Mar. 1999.
27. MATTHEWS, J., LAUNCHBURY, J., AND COOK, B. Specifying microprocessors in Hawk. In IEEE International Conference on Computer Languages (Aug. 1998).
28. O'DONNELL, J. From transistors to computer architecture: Teaching functional circuit specification in Hydra. In Symposium on Functional Programming Languages in Education (July 1995).
29. OKASAKI, C. Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University, September 1996.
30. PAULSON, L. Isabelle: A Generic Theorem Prover. Springer-Verlag, 1994.
31. SEGER, C.-J. Voss - a formal hardware verification system. Tech. Rep. 93-45, University of British Columbia, 1993.
32. SHARP, R., AND RASMUSSEN, O. An introduction to Ruby. Teaching Notes ID-U: 1995-80, Dept. of Computer Science, Technical University of Denmark, October 1995.
33. SHRIVER, B., AND SMITH, B. The Anatomy of a High-Performance Microprocessor: A Systems Perspective. IEEE Computer Society Press, 1998.
34. SRIVAS, M., AND BICKFORD, M. Formal verification of a pipelined microprocessor. IEEE Software 7, 5 (1990).
35. TULLSEN, D. M., EGGERS, S. J., EMER, J. S., LEVY, H. M., LO, J. L., AND STAMM, R. L. Exploiting choice: Instruction fetch and issue on an implementable simultaneous multithreading processor. In 23rd Annual International Symposium on Computer Architecture (Philadelphia, PA, May 1996).
36. WADLER, P. Views: a way for pattern matching to cohabit with data abstraction. In 14'th ACM Symposium on Principles of Programming Languages (Munich, Germany, January 1987).
37. WADLER, P., TAHA, W., AND MACQUEEN, D. B. How to add laziness to a strict language withouth even being odd. In Proceedings of the 1998 ACM Workshop on ML (Sept. 1998), pp. 24-30. Baltimore, MD.