A reflective functional language for hardware design and theorem proving

Journal of Functional Programming

Volumn 16, Issue 2, 2006, Pages 157-196

  Grundy, Jim ^a   Melham, Tom ^b   O'Leary, John ^a  

^a INTEL CORPORATION   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL LANGUAGES; HARDWARE DESIGN; HARDWARE DESIGN AND VERIFICATION; OPERATIONAL SEMANTICS; TYPE SYSTEMS;

FUNCTIONAL PROGRAMMING; THEOREM PROVING;

HARDWARE;

EID: 31744443032     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796805005757     Document Type: Article

References (51)

1. Aagaard, M., Jones, R. B., Kaivola, R., Kohatsu, K. R. & Seger, C. (2000) Formal verification of iterative algorithms in microprocessors. Design Automation: 37th ACM/IEEE conference DAC, pp. 201-206. ACM.
2. Aagaard, M. D., Jones, R. B. & Seger, C.-J. H. (1999) Lifted-FL: A pragmatic implementation of combined model checking and theorem proving. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (editors), Theorem Proving in Higher Order Logics: 12th international conference TPHOLs, pp. 323-340. LNCS, vol. 1690. Springer.
3. Aasa, A., Petersson, K. & Synek, D. (1988) Concrete syntax for data objects. LISP and Functional Programming: ACM Conference LFP, pp. 96-105. ACM.
4. Barras, B. (2000) Proving and computing in HOL. In: Aagaard, M. and Harrison, J. (editors), Theorem Proving in Higher Order Logics: 13th International Conference TPHOLs, pp. 17-37. LNCS, vol. 1869. Springer.
5. Benaissa, Z. El-Abidine, Moggi, E., Taha, W. & Sheard, T. (1999) Logical modalities and multi-stage programming. Intuitionsitic Modal Logics and Applications: Federated Logic Conference Satellite Workshop IMLA.
6. Berghofer, S. & Nipkow, T. (2000) Executing higher order logic. In: Callaghan, P., Luo, Z., McKinna, J. and Pollack, R. (editors), Types for Proofs and Programs: International Workshop, TYPES, pp. 24-40. LNCS, vol. 2277. Springer.
7. Bjesse, P., Claessen, K., Sheeran, M. & Singh, S. (1998) Lava: Hardware design in Haskell. Functional Programming: International Conference ICFP, pp. 174-184. ACM.
8. Cardelli, L. & Wegner, P. (1985) On understanding types, data abstraction, and polymorphism. ACM Comput. Surv. 17(4), 471-522.
9. Church, A. (1940). A formulation of the simple theory of types. J. Ssymbolic Logic, 5, 56-68.
10. Claessen, K. & Sands, D. (1999) Observable sharing for functional circuit description. Advances in Computing Science: 5th Asian Computing Science Conference ASIAN, pp. 62-73. Springer.
11. Coquand, T. (1986) An analysis of Girard's paradox. Logic in Computer Science: 1st IEEE Symposium LICS, pp. 227-236. IEEE.
12. Coquand, T. (1991) A new paradox in type theory. In: Prawitz, D., Skyrms, B. and Westerståhl, D. (editors), Logic, Methodology and Philosophy of Science: 9th International Congress, pp. 555-570. Studies in Logic and the Foundations of Mathematics, vol. 134. North-Holland.
13. de Rauglaudre, D. (2003) Camlp4: Reference manual. 3.07 edn. INRIA.
14. Dowek, G., Felty, A., Herbelin, H., Huet, G., Murthy, C., Parent, C., Paulin-Mohring, C. & Werner, B. (1993) The Coq Proof Assistant User's Guide. Rapport technique, Programme 2 154. INRIA.
15. Girard, J.-Y., Lafont, Y. & Taylor, P. (1989) Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University.
16. Gordon, M. J., Milner, A. J. & Wadsworth, C. P. (1979) Edinburgh LCF: A Mechanised Logic of Computation. LNCS, vol. 78. Springer.
17. Gordon, M. J. C. (1985) Why higher-order logic is a good formalism for specifying and verifying hardware. In: Milne, G. J. and Subrahmanyam, P. A. (editors), Formal Aspects of VLSI Design: Workshop, pp. 153-177. North-Holland.
18. Gordon, M. J. C. & Melham, T. F. (editors) (1993) Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University.
19. Greve, D., Wilding, M. & Hardin, D. (2000) High-speed, analyzable simulators. In: Kaufmann, M., Manolios, P. and Moore, J. S. (editorss), Computer-aided Reasoning: ACL2 case studies. Kluwer.
20. Grundy, J., Melham, T. & O'Leary, J. (2003) A reflective functional language for hardware design and theorem proving. Technical report PRG-RR-03-16, University of Oxford, Computing Laboratory.
21. Harper, R., MacQueen, D. & Milner, R. (1986) Standard ML. Report 86-2, University of Edinburgh, Laboratory for Foundations of Computer Science.
22. Harrison, J. (1995) Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI Cambridge.
23. Harrison, J. (2000) The HOL Light manual. 1.1 edn. University of Cambridge, Computer Laboratory.
24. Johnson, S. D. (1984) Synthesis of Digital Designs from Recursion Equations. MIT.
25. Jones, R. B., O'Leary, J. W., Seger, C.-J. H., Aagaard, M. D. & Melham, T. F. (2001) Practical formal verification in microprocessor design. IEEE Design & Test of Compute. 18(4), 16-25.
26. Kaivola, R., & Aagaard, M. (2000) Divider circuit verification with model checking and theorem proving. In: Aagaard, M. and Harrison, J. (editors), Theorem Proving in Higher Order Logics: 13th International Conference TPHOLs, pp. 338-355. LNCS, vol. 1869. Springer.
27. Kaivola, R. & Kohatsu, K. R. (2001) Proof engineering in the large: Formal verification of the Pentium® 4 floating-point divider. In: Margaria, T. and Melham, T. F. (editors), Correct Hardware Design and Verification Methods: 11th Advanced Research Working Conference CHARME, pp. 196-211. LNCS, vol. 2144. Springer.
28. Kaivola, R. & Narasimhan, N. (2001) Formal verification of the Pentium® 4 multiplier. High-level Design Validation and Test: 6th International Workshop HLDVT, pp. 115-122.
29. Kaufmann, M., Manolios, P. & Moore, J. S. (editors) (2000a) Computer-aided Reasoning: ACL2 case studies. Kluwer.
30. Kaufmann, M., Manolios, P. & Moore, J. S. (2000b) Computer-aided Reasoning: An approach. Kluwer.
31. ect language. Technical report CSE-03-014, Department of Computer Science and Engineering, OGI School of Science and Engineering at Oregon Health and Sciences University.
32. Leisenring, A. C. (1969) Mathematical Logic and Hilbert's ε-symbol. Macdonald.
33. Leroy, X. & Mauny, M. (1993) Dynamics in ML. J. Funct. Program. 3(4), 431-463.
34. Leroy, X., Doligez, D., Garrigue, J., Rémy, D. & Vouillon, J. (2003) The Objective Caml System: Documentation and user's manual. 3.07 edn. INRIA.
35. Matthews, J., Cook, B. & Launchbury, J. (1998) Microprocessor specification in Hawk. Computer Languages: International Conference, pp. 90-101. IEEE.
36. Mauny, M. & de Rauglaudre, D. (1994) A complete and realistic implementation of quotations for ML. ML and its Applications: ACM-SIGPLAN Workshop ML, pp. 70-78.
37. Melham, T. F. (1993) Higher Order Logic and Hardware Verification. Cambridge University.
38. Moore, J. S. (1998) Symbolic simulation: An ACL2 approach. In: Gopalakrishnan, G. and Windley, P. (editors), Formal Methods in Computer-aided Design: 2nd International Conference FMCAD, pp. 334-350. LNCS, vol. 1522. Springer.
39. Müller, O. & Slind, K. (1997) Treating partiality in a logic of total functions. The Comput. J. 40(10), 640-651.
40. Nipkow, T., Paulson, L. C. & Wenzel, M. (2002) Isabelle/HOL: A proof assistant for higher-order logic. LNCS, vol. 2283. Springer.
41. Paulson, L. C. (1983) A higher-order implementation of rewriting. Sci. Comput. program. 3(2), 119-149.
42. Pašalić, E., Taha, W. & Sheard, T. (2002) Tagless staged interpreters for typed languages. SIGPLAN Notices, 37(9), 218-229.
43. Sheard, T. (2001) Accomplishments and research challenges in meta-programming. In: Taha, W. (eitor), Semantics, Applications, and Implementation of Program Generation: 2nd International Workshop SAIG, pp. 2-44. LNCS, vol. 2196. Springer.
44. Sheard, T. & Peyton Jones, S. (2002) Template meta-programming for Haskell. Haskell: Workshop, pp. 1-16. ACM.
45. Sheeran, M. (1983) μFP: An algebraic VLSI design language. PhD thesis, University of Oxford.
46. Shields, M., Sheard, T. & Peyton Jones, S. (1998) Dynamic typing as staged type inference. Principles of Programming Language: 25th Annual Symposium POPL, pp. 289-302.
47. Spirakis, G. (2003) Leading-edge and future design challenges: Is the classical EDA ready? Design Automation: 40th ACM/IEEE Conference DAC, p. 416. ACM.
48. Stump, A. (1999) On Coquand's "An analysis of Girard's paradox". MTC qualifying exam, Stanford University, Department of Computer Science.
49. Suppes, P. C. (1957) Introduction to Logic. Van Nostrand Reinhold.
50. Taha, W. (1999) Multi-stage programming: Its theory and applications. PhD thesis, Oregon Graduate Institute of Science and Technology.
51. Taha, W. & Sheard, T. (2002) Multi-stage programming with explicit annotations. SIGPLAN Notices, 32(12), 203-217.