메뉴 건너뛰기




Volumn 9, Issue 3, 2008, Pages

Contextual modal type theory

Author keywords

Intuitionistic modal logic; Logical frameworks; Type theory

Indexed keywords

EXPLICIT SUBSTITUTIONS; LOGICAL FRAMEWORK (LF); METAVARIABLES; MODAL LOGICS; SOME APPLICATIONS; TYPE THEORIES;

EID: 45749090964     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1352582.1352591     Document Type: Article
Times cited : (209)

References (64)
  • 2
    • 84944182544 scopus 로고    scopus 로고
    • ALECHINA, N., MENDLER, M., DE PAIVA, V., AND RITTER, E. 2001. Categorical and Kripke semantics for Constructive S4 modal logic. In International Workshop on Computer Science Logic, CSL'01, L. Fribourg, Ed. LectureNotesinComputerScience, 2142.Springer,Berlin, Germany, France, 292-307.
    • ALECHINA, N., MENDLER, M., DE PAIVA, V., AND RITTER, E. 2001. Categorical and Kripke semantics for Constructive S4 modal logic. In International Workshop on Computer Science Logic, CSL'01, L. Fribourg, Ed. LectureNotesinComputerScience, vol. 2142.Springer,Berlin, Germany, France, 292-307.
  • 3
    • 0002383069 scopus 로고
    • Proofs in context
    • J. Doyle, E. Sandewall, and P. Torasso, Eds. Morgan Kaufman, San Francisco, CA
    • ATTARDI, G. AND SIMI, M. 1994. Proofs in context. In Principles of Knowledge Representation and Reasoning, J. Doyle, E. Sandewall, and P. Torasso, Eds. Morgan Kaufman, San Francisco, CA, 16-26.
    • (1994) Principles of Knowledge Representation and Reasoning , pp. 16-26
    • ATTARDI, G.1    SIMI, M.2
  • 4
    • 0029325742 scopus 로고
    • A formalization of viewpoints
    • ATTARDI, G. AND SIMI, M. 1995. A formalization of viewpoints. Fundamenta Informaticae 23, 3, 149-173.
    • (1995) Fundamenta Informaticae , vol.23 , Issue.3 , pp. 149-173
    • ATTARDI, G.1    SIMI, M.2
  • 5
    • 84937397292 scopus 로고    scopus 로고
    • Absolute explicit unification
    • International Conference on Rewriting Techniques and Applications, RTA'00, Springer, Berlin, Germany
    • BJØRNER, N. AND MUÑOZ, C. 2000. Absolute explicit unification. In International Conference on Rewriting Techniques and Applications, RTA'00. Lecture Notes in Computer Science, vol. 1833. Springer, Berlin, Germany, 31-46.
    • (2000) Lecture Notes in Computer Science , vol.1833 , pp. 31-46
    • BJØRNER, N.1    MUÑOZ, C.2
  • 6
    • 0035398286 scopus 로고    scopus 로고
    • BOGNAR, M. AND DE VRIJER, R. 2001. A calculus of lambda calculus context. J. Automat. Reason. 27, 1, 29-59.
    • BOGNAR, M. AND DE VRIJER, R. 2001. A calculus of lambda calculus context. J. Automat. Reason. 27, 1, 29-59.
  • 9
    • 35048882935 scopus 로고    scopus 로고
    • ML-like inference for classifiers
    • European Symposium on Programming, ESOP'04, D. Schmidt, Ed, Springer-Verlag, Berlin, Germany
    • CALCAGNO, C., MOGGI, E., AND TAHA, W. 2004. ML-like inference for classifiers. In European Symposium on Programming, ESOP'04, D. Schmidt, Ed. Lecture Notes in Computer Science, 2986. Springer-Verlag, Berlin, Germany, 79-93.
    • (2004) Lecture Notes in Computer Science , vol.2986 , pp. 79-93
    • CALCAGNO, C.1    MOGGI, E.2    TAHA, W.3
  • 10
    • 38249042109 scopus 로고
    • Generalized algebraic theories and contextual categories
    • CARTMELL, J. 1986. Generalized algebraic theories and contextual categories. Ann. Pure Appl. Log. 32, 209-243.
    • (1986) Ann. Pure Appl. Log , vol.32 , pp. 209-243
    • CARTMELL, J.1
  • 11
    • 0037175760 scopus 로고    scopus 로고
    • CERVESATO, I. AND PFENNING, F. 2002. A linear logical framework. Inform. Computat. 179, 1 (Nov.), 19-75.
    • CERVESATO, I. AND PFENNING, F. 2002. A linear logical framework. Inform. Computat. 179, 1 (Nov.), 19-75.
  • 12
    • 0003801098 scopus 로고    scopus 로고
    • A lambda-calculus for dynamic binding
    • DAMI, L. 1998. A lambda-calculus for dynamic binding. Theoret. Comput. Sci. 192, 2, 201-231.
    • (1998) Theoret. Comput. Sci , vol.192 , Issue.2 , pp. 201-231
    • DAMI, L.1
  • 13
    • 0029719031 scopus 로고    scopus 로고
    • A temporal logic approach to binding-time analysis
    • E. Clarke, Ed. IEEE Computer Society Press, Los Alamitos, CA, NJ
    • DAVIES, R. 1996. A temporal logic approach to binding-time analysis. In Symposium on Logic in Computer Science (LICS'96), E. Clarke, Ed. IEEE Computer Society Press, Los Alamitos, CA, NJ, 184-195.
    • (1996) Symposium on Logic in Computer Science (LICS'96) , pp. 184-195
    • DAVIES, R.1
  • 14
    • 0013047885 scopus 로고    scopus 로고
    • A modal analysis of staged computation
    • May
    • DAVIES, R. AND PFENNING, F. 2001. A modal analysis of staged computation. J. ACM 48, 3 (May), 555-604.
    • (2001) J. ACM , vol.48 , Issue.3 , pp. 555-604
    • DAVIES, R.1    PFENNING, F.2
  • 15
    • 0036851267 scopus 로고    scopus 로고
    • DE GROOTE, P. 2002. On the strong normalisation of intuitionistic natural deduction with permutation-conversions. Inform. Computat. 178, 2 (Nov.), 441-464.
    • DE GROOTE, P. 2002. On the strong normalisation of intuitionistic natural deduction with permutation-conversions. Inform. Computat. 178, 2 (Nov.), 441-464.
  • 16
    • 8344235628 scopus 로고    scopus 로고
    • Natural deduction and context as (constructive) modality
    • Modelling and Using Context, P. Blackburn, C. Ghidini, R. M. Turner, and F. Giunchiglia, Eds, Springer, Berlin, Germany
    • DE PAIVA, V. 2003. Natural deduction and context as (constructive) modality. In Modelling and Using Context, P. Blackburn, C. Ghidini, R. M. Turner, and F. Giunchiglia, Eds. Lecture Notes in Artificial Inteligence, vol. 2680. Springer, Berlin, Germany, 116-129.
    • (2003) Lecture Notes in Artificial Inteligence , vol.2680 , pp. 116-129
    • DE PAIVA, V.1
  • 17
    • 0029180275 scopus 로고
    • Higher-order unification via explicit substitutions
    • D. Kozen, Ed. IEEE Computer Society Press, Los Alamitos, CA
    • DOWEK, G., HARDIN, T., AND KIRCHNER, C. 1995. Higher-order unification via explicit substitutions. In Symposium on Logic in Computer Science (LICS'95). D. Kozen, Ed. IEEE Computer Society Press, Los Alamitos, CA, 366-374.
    • (1995) Symposium on Logic in Computer Science (LICS'95) , pp. 366-374
    • DOWEK, G.1    HARDIN, T.2    KIRCHNER, C.3
  • 19
    • 84947778785 scopus 로고    scopus 로고
    • Open proofs and open terms: A basis for interactive logic
    • International Workshop on Computer Science Logic, CSL'02, J. C. Bradfield, Ed, Springer, Berlin, Germany
    • GEUVERS, H. AND JOJGOV, G. I. 2002. Open proofs and open terms: a basis for interactive logic. In International Workshop on Computer Science Logic, CSL'02, J. C. Bradfield, Ed. Lecture Notes in Computer Science, vol. 2471. Springer, Berlin, Germany, 537-552.
    • (2002) Lecture Notes in Computer Science , vol.2471 , pp. 537-552
    • GEUVERS, H.1    JOJGOV, G.I.2
  • 20
    • 0000218693 scopus 로고
    • Contextual reasoning
    • GIUNCHIGLIA, F. 1993. Contextual reasoning. Epistemologica 16, 345-364.
    • (1993) Epistemologica , vol.16 , pp. 345-364
    • GIUNCHIGLIA, F.1
  • 21
    • 0028315848 scopus 로고
    • Multilanguage hierarchical logics, or: How to do without modal logics
    • GIUNCHIGLIA, F. AND SERAFINI, L. 1994. Multilanguage hierarchical logics, or: How to do without modal logics. Artific. Intell. 65, 1, 29-70.
    • (1994) Artific. Intell , vol.65 , Issue.1 , pp. 29-70
    • GIUNCHIGLIA, F.1    SERAFINI, L.2
  • 22
    • 0027353175 scopus 로고    scopus 로고
    • HARPER, R., HONSELL, F., AND PLOTKIN, G. 1993. A framework for defining logics. JACM. 40, 1 (Jan.), 143-184.
    • HARPER, R., HONSELL, F., AND PLOTKIN, G. 1993. A framework for defining logics. JACM. 40, 1 (Jan.), 143-184.
  • 23
    • 0035817845 scopus 로고    scopus 로고
    • A typed context calculus
    • HASHIMOTO, M. AND OHORI, A. 2001. A typed context calculus. Theoret. Comput. Sci. 266, 1-2, 249-272.
    • (2001) Theoret. Comput. Sci , vol.266 , Issue.1-2 , pp. 249-272
    • HASHIMOTO, M.1    OHORI, A.2
  • 24
    • 43949161369 scopus 로고
    • Logic programming in a fragment of intuitionistic linear logic
    • HODAS, J. AND MILLER, D. 1994. Logic programming in a fragment of intuitionistic linear logic. Inform. Computat. 110, 2, 327-365.
    • (1994) Inform. Computat , vol.110 , Issue.2 , pp. 327-365
    • HODAS, J.1    MILLER, D.2
  • 25
    • 35248894376 scopus 로고    scopus 로고
    • JOJGOV, G. I. 2003. Holes with binding power. In Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers, H. Geuvers and F. Wiedijk, Eds. Lecture Notes in Computer Science, 2646. Springer, Berlin, Germany, 162-181.
    • JOJGOV, G. I. 2003. Holes with binding power. In Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers, H. Geuvers and F. Wiedijk, Eds. Lecture Notes in Computer Science, vol. 2646. Springer, Berlin, Germany, 162-181.
  • 26
    • 0002977725 scopus 로고
    • A completeness theorem in modal logic
    • KRIPKE, S. 1959. A completeness theorem in modal logic. J. Symbol. Log. 24, 1-14.
    • (1959) J. Symbol. Log , vol.24 , pp. 1-14
    • KRIPKE, S.1
  • 28
    • 84886715471 scopus 로고    scopus 로고
    • Tradeoffs in the intensional representation of lambda terms
    • International Conference on Rewriting Techniques and Applications, RTA'02, S. Tison, Ed, Springer-Verlag, Berlin, Germany
    • LIANG, C. AND NADATHUR, G. 2002. Tradeoffs in the intensional representation of lambda terms. In International Conference on Rewriting Techniques and Applications, RTA'02, S. Tison, Ed. Lecture Notes in Computer Science, vol. 2378. Springer-Verlag, Berlin, Germany, 192-206.
    • (2002) Lecture Notes in Computer Science , vol.2378 , pp. 192-206
    • LIANG, C.1    NADATHUR, G.2
  • 29
    • 45749153718 scopus 로고    scopus 로고
    • MAGNUSSON, L. 1995. The implementation of ALF - a proof editor based on Martin-Löf's monomorphic type theory with explicit substitutions. Ph.D. dissertation. Chalmers University of Technology and Göteborg University, Göteborg, Sweden.
    • MAGNUSSON, L. 1995. The implementation of ALF - a proof editor based on Martin-Löf's monomorphic type theory with explicit substitutions. Ph.D. dissertation. Chalmers University of Technology and Göteborg University, Göteborg, Sweden.
  • 30
    • 0002140364 scopus 로고    scopus 로고
    • On the meanings of the logical constants and the justifications of the logical laws
    • MARTIN-LÖF, P. 1996. On the meanings of the logical constants and the justifications of the logical laws. Nordic J. Philosoph. Log. 1, 1, 11-60.
    • (1996) Nordic J. Philosoph. Log , vol.1 , Issue.1 , pp. 11-60
    • MARTIN-LÖF, P.1
  • 31
    • 0032659438 scopus 로고    scopus 로고
    • Computing with contexts
    • MASON, I. A. 1999. Computing with contexts. Higher-Order Symbol. Computat. 12, 2, 171-201.
    • (1999) Higher-Order Symbol. Computat , vol.12 , Issue.2 , pp. 171-201
    • MASON, I.A.1
  • 32
    • 0023535206 scopus 로고
    • Generality in artificial intelligence
    • MCCARTHY, J. 1987. Generality in artificial intelligence. Commun. ACM 30, 12, 1030-1035.
    • (1987) Commun. ACM , vol.30 , Issue.12 , pp. 1030-1035
    • MCCARTHY, J.1
  • 34
    • 0000968273 scopus 로고
    • A logic programming language with lambda-abstraction, function variables, and simple unification
    • MILLER, D. 1991. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Log. Computat. 1, 4, 497-536.
    • (1991) J. Log. Computat , vol.1 , Issue.4 , pp. 497-536
    • MILLER, D.1
  • 35
    • 0040899945 scopus 로고
    • Syntactical treatment of modalities, with corollaries on reflexion principles and finite axiomatizability
    • MONTAGUE, R. 1963. Syntactical treatment of modalities, with corollaries on reflexion principles and finite axiomatizability. Acta Philosophica Fennica 16, 153-167.
    • (1963) Acta Philosophica Fennica , vol.16 , pp. 153-167
    • MONTAGUE, R.1
  • 36
    • 4544347985 scopus 로고    scopus 로고
    • Modal logic as a basis for distributed computation
    • Tech. rep. CMU-CS-03-194. Carnegie Mellon University, Pittsburgh, PA
    • MOODY, J. 2003. Modal logic as a basis for distributed computation. Tech. rep. CMU-CS-03-194. Carnegie Mellon University, Pittsburgh, PA.
    • (2003)
    • MOODY, J.1
  • 37
    • 29144532748 scopus 로고    scopus 로고
    • MUÑOZ, C. 2001. Dependent types and explicit substitutions. Math. Struct. Comput. Sci. 11, 1 (Feb.), 91-129.
    • MUÑOZ, C. 2001. Dependent types and explicit substitutions. Math. Struct. Comput. Sci. 11, 1 (Feb.), 91-129.
  • 38
    • 4544313887 scopus 로고    scopus 로고
    • MURPHY VII, T., CRARY, K., HARPER, R., AND PFENNING, F. 2004. A symmetric modal lambda calculus for distributed computing. In Symposium on Logic in Computer Science, H. Ganzinger, Ed. (LICS 04, Turku, Finland). 286-295.
    • MURPHY VII, T., CRARY, K., HARPER, R., AND PFENNING, F. 2004. A symmetric modal lambda calculus for distributed computing. In Symposium on Logic in Computer Science, H. Ganzinger, Ed. (LICS 04, Turku, Finland). 286-295.
  • 40
    • 45749109735 scopus 로고    scopus 로고
    • Functional programming with names and necessity. Ph.D. dissertation. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
    • NANEVSKI, A. 2004. Functional programming with names and necessity. Ph.D. dissertation. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA.
    • (2004)
    • NANEVSKI, A.1
  • 41
    • 26444477635 scopus 로고    scopus 로고
    • NANEVSKI, A. AND PFENNING, F. 2005. Staged computation with names and necessity. J. Funct. Programm. 15, 6 (Nov.), 837-891.
    • NANEVSKI, A. AND PFENNING, F. 2005. Staged computation with names and necessity. J. Funct. Programm. 15, 6 (Nov.), 837-891.
  • 43
    • 0034711981 scopus 로고    scopus 로고
    • PFENNING, F. 2000. Structural cut elimination I. Intuitionistic and classical logic. Inform. Computat. 157, 1/2 (Mar.), 84-141.
    • PFENNING, F. 2000. Structural cut elimination I. Intuitionistic and classical logic. Inform. Computat. 157, 1/2 (Mar.), 84-141.
  • 44
    • 0034864194 scopus 로고    scopus 로고
    • Intensionality, extensionality, and proof irrelevance in modal type theory
    • J. Halpern, Ed. IEEE Computer Society Press, Los Alamitos, CA
    • PFENNING, F. 2001. Intensionality, extensionality, and proof irrelevance in modal type theory. In Symposium on Logic in Computer Science (LICS'01), J. Halpern, Ed. IEEE Computer Society Press, Los Alamitos, CA, 221-230.
    • (2001) Symposium on Logic in Computer Science (LICS'01) , pp. 221-230
    • PFENNING, F.1
  • 45
    • 84945246255 scopus 로고    scopus 로고
    • A judgmental reconstruction of modal logic
    • PFENNING, F. AND DAVIES, R. 2001. A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11, 4, 511-540.
    • (2001) Math. Struct. Comput. Sci , vol.11 , Issue.4 , pp. 511-540
    • PFENNING, F.1    DAVIES, R.2
  • 46
    • 35448990873 scopus 로고    scopus 로고
    • System description: Twelf - a meta-logical framework for deductive systems
    • International Conference on Automated Deduction, CADE'99, H. Ganzinger, Ed, Springer-Verlag, Berlin, Germany
    • PFENNING, F. AND SCHÜRMANN, C. 1999. System description: Twelf - a meta-logical framework for deductive systems. In International Conference on Automated Deduction, CADE'99, H. Ganzinger, Ed. Lecture Notes in Artificial Inteligence, vol. 1632. Springer-Verlag, Berlin, Germany, 202-206.
    • (1999) Lecture Notes in Artificial Inteligence , vol.1632 , pp. 202-206
    • PFENNING, F.1    SCHÜRMANN, C.2
  • 47
    • 45749147349 scopus 로고    scopus 로고
    • Tabled higher-order logic programming. Ph.D. dissertation. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
    • PIENTKA, B. 2003. Tabled higher-order logic programming. Ph.D. dissertation. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA.
    • (2003)
    • PIENTKA, B.1
  • 48
    • 7044270614 scopus 로고    scopus 로고
    • Optimizing higher-order pattern unification
    • International Conference on Automated Deduction, CADE'03, F. Baader, Ed, Springer, Berlin, Germany
    • PIENTKA, B. AND PFENNNING, F. 2003. Optimizing higher-order pattern unification. In International Conference on Automated Deduction, CADE'03, F. Baader, Ed. Lecture Notes in Computer Science, vol. 2741. Springer, Berlin, Germany, 473-487.
    • (2003) Lecture Notes in Computer Science , vol.2741 , pp. 473-487
    • PIENTKA, B.1    PFENNNING, F.2
  • 50
    • 4243066819 scopus 로고    scopus 로고
    • A simply typed context calculus with first-class environments
    • Mar
    • SATO, M., SAKURAI, T., AND KAMEYAMA, Y. 2002. A simply typed context calculus with first-class environments. J. Funct. Log. Programm. 2002, 4 (Mar.).
    • (2002) J. Funct. Log. Programm. 2002 , pp. 4
    • SATO, M.1    SAKURAI, T.2    KAMEYAMA, Y.3
  • 51
    • 35248885234 scopus 로고    scopus 로고
    • Calculi of meta-variables
    • International Workshop on Computer Science Logic, CSL'03, M. Baaz and J. A. Makowsky, Eds, Springer, Berlin, Germany
    • SATO, M., SAKURAI, T., KAMEYAMA, Y., AND IGARASHI, A. 2003. Calculi of meta-variables. In International Workshop on Computer Science Logic, CSL'03, M. Baaz and J. A. Makowsky, Eds. Lecture Notes in Computer Science, vol. 2803. Springer, Berlin, Germany, 484-497.
    • (2003) Lecture Notes in Computer Science , vol.2803 , pp. 484-497
    • SATO, M.1    SAKURAI, T.2    KAMEYAMA, Y.3    IGARASHI, A.4
  • 52
    • 24944465041 scopus 로고    scopus 로고
    • The ▽-calculus: Functional programming with higher-order encodings
    • International Conference on Typed Lambda Calculus and Applications, TLCA'05, P. Urzyczyn, Ed, Springer, Berlin, Germany
    • SCHÜRMANN, C., POSWOLSKY, A., AND SARNAT, J. 2005. The ▽-calculus: Functional programming with higher-order encodings. In International Conference on Typed Lambda Calculus and Applications, TLCA'05, P. Urzyczyn, Ed. Lecture Notes in Computer Science, vol. 3461. Springer, Berlin, Germany, 339-353.
    • (2005) Lecture Notes in Computer Science , vol.3461 , pp. 339-353
    • SCHÜRMANN, C.1    POSWOLSKY, A.2    SARNAT, J.3
  • 53
    • 1842511678 scopus 로고    scopus 로고
    • Comparing formal theories of context in AI
    • SERAFINI, L. AND BOUQUET, P. 2004. Comparing formal theories of context in AI. Artific. Intell. 155, 1-2, 41-67.
    • (2004) Artific. Intell , vol.155 , Issue.1-2 , pp. 41-67
    • SERAFINI, L.1    BOUQUET, P.2
  • 54
    • 9344261671 scopus 로고    scopus 로고
    • ML system: A proof theory for contexts
    • SERAFINI, L. AND GIUNCHIGLIA, F. 2002. ML system: A proof theory for contexts. J. Log. Lang. Inform. 11, 4, 471-518.
    • (2002) J. Log. Lang. Inform , vol.11 , Issue.4 , pp. 471-518
    • SERAFINI, L.1    GIUNCHIGLIA, F.2
  • 57
    • 1442265570 scopus 로고    scopus 로고
    • TAHA, W. AND NIELSEN, M. F. 2003. Environment classifiers. In Proceedings of the Symposium on Principles of Programming Languages (POPL'03, New Orleans, LA). G. Morrisett, Ed. ACM Press, New York, NY, 26-37.
    • TAHA, W. AND NIELSEN, M. F. 2003. Environment classifiers. In Proceedings of the Symposium on Principles of Programming Languages (POPL'03, New Orleans, LA). G. Morrisett, Ed. ACM Press, New York, NY, 26-37.
  • 59
    • 45749094929 scopus 로고    scopus 로고
    • THOMASON, R. H. 1999. Type theoretic foundations for context, part 1: Contexts as complex type-theoretic objects. In Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Contexts (CONTEXT'99, Trento, Italy), P. Bouquet, L. Serafini, P. Brézillon, M. Benerecetti, and F. Castellani, Eds. 352-374.
    • THOMASON, R. H. 1999. Type theoretic foundations for context, part 1: Contexts as complex type-theoretic objects. In Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Contexts (CONTEXT'99, Trento, Italy), P. Bouquet, L. Serafini, P. Brézillon, M. Benerecetti, and F. Castellani, Eds. 352-374.
  • 60
    • 8344257165 scopus 로고    scopus 로고
    • Dynamic contextual intensional logic: Logical foundations and an application
    • Modeling and Using Context, P. Blackburn, C. Ghidini, R. M. Turner, and F. Giunchiglia, Eds, Springer, Berlin, Germany
    • THOMASON, R. H. 2003. Dynamic contextual intensional logic: Logical foundations and an application. In Modeling and Using Context, P. Blackburn, C. Ghidini, R. M. Turner, and F. Giunchiglia, Eds. Lecture Notes in Artificial Inteligence, vol. 2680. Springer, Berlin, Germany, 328-341.
    • (2003) Lecture Notes in Artificial Inteligence , vol.2680 , pp. 328-341
    • THOMASON, R.H.1
  • 61
    • 12344320856 scopus 로고    scopus 로고
    • A concurrent logical framework I: Judgments and properties
    • Tech. rep. CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA. Revised May 2003
    • WATKINS, K., CERVESATO, I., PFENNING, F., AND WALKER, D. 2002. A concurrent logical framework I: Judgments and properties. Tech. rep. CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA. Revised May 2003.
    • (2002)
    • WATKINS, K.1    CERVESATO, I.2    PFENNING, F.3    WALKER, D.4
  • 62
    • 0001733633 scopus 로고
    • Prolegomena to a theory of mechanized formal reasoning
    • WEYHRAUCH, R. W. 1979. Prolegomena to a theory of mechanized formal reasoning. Artific. Intell. 13, 1-2, 133-170.
    • (1979) Artific. Intell , vol.13 , Issue.1-2 , pp. 133-170
    • WEYHRAUCH, R.W.1
  • 63
    • 0343152211 scopus 로고    scopus 로고
    • WICKLINE, P., LEE, P., AND PFENNING, F. 1998a. Run-time code generation and Modal-ML. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'98, Montreal, P. Q., Canada), K. D. Cooper, Ed. ACM Press, 224-235.
    • WICKLINE, P., LEE, P., AND PFENNING, F. 1998a. Run-time code generation and Modal-ML. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'98, Montreal, P. Q., Canada), K. D. Cooper, Ed. ACM Press, 224-235.
  • 64
    • 0347924086 scopus 로고    scopus 로고
    • Modal types as staging specifications for run-time code generation
    • WICKLINE, P., LEE, P., PFENNING, F., AND DAVIES, R. 1998b. Modal types as staging specifications for run-time code generation. ACM Comput. Surv. 30, 3es.
    • (1998) ACM Comput. Surv , vol.30
    • WICKLINE, P.1    LEE, P.2    PFENNING, F.3    DAVIES, R.4


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