메뉴 건너뛰기




Volumn 19, Issue 2-3, 2006, Pages 197-230

Formal compiler construction in a logical framework

Author keywords

Formal compiler; Higher order abstract syntax; Logical programming environment

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; CODES (SYMBOLS); ERROR ANALYSIS; FORMAL LOGIC; GENERAL PURPOSE COMPUTERS; METADATA; PROGRAM DEBUGGING; SET THEORY; SYNTACTICS;

EID: 33747239540     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-006-8746-6     Document Type: Conference Paper
Times cited : (13)

References (34)
  • 2
    • 0030640719 scopus 로고    scopus 로고
    • Do you trust your compiler? Applying formal methods to constructing high-assurance compilers
    • Washington, DC
    • Boyle, J., Resler, R., Winter, K.: Do you trust your compiler? Applying formal methods to constructing high-assurance compilers. In: High-Assurance Systems Engineering Workshop. Washington, DC (1997)
    • (1997) High-assurance Systems Engineering Workshop
    • Boyle, J.1    Resler, R.2    Winter, K.3
  • 12
    • 33747226679 scopus 로고    scopus 로고
    • Extensible hierarchical tactic construction in a logical framework
    • Slind, K., Bunker, A., Gopalakrishnan, G., (eds.), Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004), Springer-Verlag
    • Hickey, J., Nogin, A.: Extensible hierarchical tactic construction in a logical framework. In: Slind, K., Bunker, A., Gopalakrishnan, G., (eds.), Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004), vol. 3223 of Lecture Notes in Computer Science, Springer-Verlag, pp. 136-151 (2004)
    • (2004) Lecture Notes in Computer Science , vol.3223 , pp. 136-151
    • Hickey, J.1    Nogin, A.2
  • 14
    • 33747322035 scopus 로고    scopus 로고
    • Programming language experimentation using proof assistants. Compiler development as a case study
    • To be submitted to (in preparation)
    • Hickey, J., Nogin, A., Gray, N.: Programming language experimentation using proof assistants. Compiler development as a case study. To be submitted to Journal of Functional Programming (in preparation) (2005)
    • (2005) Journal of Functional Programming
    • Hickey, J.1    Nogin, A.2    Gray, N.3
  • 18
    • 0003792407 scopus 로고
    • Yacc - Yet another compiler compiler
    • AT&T Bell Laboratories
    • Johnson, S.C.: Yacc - yet another compiler compiler. Computer Science Technical Report 32, AT&T Bell Laboratories (1975)
    • (1975) Computer Science Technical Report , vol.32
    • Johnson, S.C.1
  • 21
    • 33747285735 scopus 로고    scopus 로고
    • Compiler construction in higher order logic programming
    • Practical Aspects of Declarative Languages
    • Liang, C.C.: Compiler construction in higher order logic programming. In: Practical Aspects of Declarative Languages, vol. 2257 of Lecture Notes in Computer Science, pp. 47-63 (2002)
    • (2002) Lecture Notes in Computer Science , vol.2257 , pp. 47-63
    • Liang, C.C.1
  • 23
    • 17144377157 scopus 로고    scopus 로고
    • Translation validation for an optimizing compiler
    • Necula, G.C.: Translation validation for an optimizing compiler. ACM SIGPLAN Notices 35(5), 83-94 (2000)
    • (2000) ACM SIGPLAN Notices , vol.35 , Issue.5 , pp. 83-94
    • Necula, G.C.1
  • 24
    • 32044469423 scopus 로고    scopus 로고
    • Sequent schema for derived rules
    • Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.), Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002), Springer-Verlag
    • Nogin, A., Hickey J.: Sequent schema for derived rules. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.), Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002), vol. 2410 of Lecture Notes in Computer Science, Springer-Verlag, pp. 281-297 (2002)
    • (2002) Lecture Notes in Computer Science , vol.2410 , pp. 281-297
    • Nogin, A.1    Hickey, J.2
  • 25
    • 32044453783 scopus 로고    scopus 로고
    • A computational approach to reflective meta-reasoning about languages with bindings
    • MERLIN '05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, ACM, Press, An extended version is available as
    • Nogin, A., Kopylov, A., Yu, X., Hickey, J.: A computational approach to reflective meta-reasoning about languages with bindings. In: MERLIN '05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, ACM, Press, pp. 2-12. (2005) An extended version is available as California Institute of Technology technical report CaltechCSTR:2005.003
    • (2005) California Institute of Technology Technical Report CaltechCSTR:2005.003
    • Nogin, A.1    Kopylov, A.2    Yu, X.3    Hickey, J.4
  • 27
    • 84956694006 scopus 로고
    • Higher-order abstract syntax
    • Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, ACM, Press
    • Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation (PLDI), vol. 23(7) of SIGPLAN Notices, Atlanta, Georgia, pp. 199-208 (1988). ACM, Press
    • (1988) SIGPLAN Notices , vol.23 , Issue.7 , pp. 199-208
    • Pfenning, F.1    Elliott, C.2
  • 28
    • 84976496175 scopus 로고    scopus 로고
    • A metalanguage for programming with bound names modulo renaming
    • Backhouse, R., Oliveira, J.N. (eds.), Mathematics of Program Construction, Springer-Verlag, Heidelberg
    • Pitts, A.M., Gabbay, M.: A metalanguage for programming with bound names modulo renaming. In: Backhouse, R., Oliveira, J.N. (eds.), Mathematics of Program Construction, vol. 1837 of Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, pp. 230-255 (2000)
    • (2000) Lecture Notes in Computer Science , vol.1837 , pp. 230-255
    • Pitts, A.M.1    Gabbay, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.