메뉴 건너뛰기




Volumn , Issue , 2004, Pages 116-119

Languages of the future

Author keywords

Equality constrained types; Formal methods; Formal reasoning systems; Staged languages; Static constraint management

Indexed keywords

DESIGN SPACES; EQUALITY CONSTRAINED TYPES; EQUALITY CONSTRAINTS; FORMAL REASONING SYSTEM; FORMAL REASONING SYSTEMS; LOGICAL FRAMEWORKS; PART PROGRAMMING; PROGRAMMING IDIOMS; PROGRAMMING LANGUAGE; SEMANTIC PROPERTIES; STAGED LANGUAGES; STATIC CONSTRAINT MANAGEMENT; TYPE CHECKER; TYPE SYSTEMS;

EID: 79951765304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1028664.1028711     Document Type: Conference Paper
Times cited : (52)

References (29)
  • 5
    • 33644615295 scopus 로고    scopus 로고
    • Available from
    • James Cheney and Ralf Hinze. Phantom types. Available from http://www.informatik.uni-bonn.de/~ralf/publications/Phantom.pdf 2003.
    • (2003) Phantom Types
    • Cheney, J.1    Ralf, H.2
  • 7
    • 14544278686 scopus 로고    scopus 로고
    • Practical type inference for arbitrary-rank types
    • "December"
    • Simon Peyton Jones and Mark Shields. Practical type inference for arbitrary-rank types. Technical report, Microsoft Research, "December" 2003. http://research.microsoft.com/Users/simonpj/papers/putting/index.htm
    • (2003) Technical Report, Microsoft Research
    • Jones, S.P.1    Shields, M.2
  • 9
    • 1442288666 scopus 로고    scopus 로고
    • F: rAising ML to the power of system F
    • September
    • F: raising ML to the power of system F. ACM SIGPLAN Notices, 38(9):27-38, September 2003.
    • (2003) ACM SIGPLAN Notices , vol.38 , Issue.9 , pp. 27-38
    • Botlan, D.L.1    Rémy, D.2
  • 13
    • 0002089129 scopus 로고
    • Isabelle: THe next 700 theorem provers
    • P. Odifreddi, editor Academic Press
    • Lawrence C. Paulson. Isabelle:The next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science, pages 361-386. Academic Press, 1990.
    • (1990) Logic and Computer Science , pp. 361-386
    • Paulson, L.C.1
  • 17
    • 1442337730 scopus 로고    scopus 로고
    • An extension of HM(X) with bounded existential and universal data-types
    • September
    • Vincent Simonet. An extension of HM(X) with bounded existential and universal data-types. ACM SIGPLAN Notices, 38(9):39-50, September 2003.
    • (2003) ACM SIGPLAN Notices , vol.38 , Issue.9 , pp. 39-50
    • Simonet, V.1
  • 20
    • 0013091874 scopus 로고    scopus 로고
    • MetaML: MUlti-stage programming with explicit annotations
    • Walid Taha and Tim Sheard. MetaML:Multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1-2), 2000.
    • (2000) Theoretical Computer Science , vol.248 , Issue.1-2
    • Taha, W.1    Sheard, T.2
  • 21
    • 79951755590 scopus 로고    scopus 로고
    • The coq development team
    • Version 7.4. INRIA
    • The Coq Development Team. The Coq Proof Assistant Reference Manual, Version 7.4. INRIA, 2003. http://pauillac.inria.fr/coq/doc/main.html.
    • (2003) The Coq Proof Assistant Reference Manual
  • 23
    • 0030370740 scopus 로고    scopus 로고
    • A sound type system for secure flow analysis
    • December
    • Dennis Volpano, Geoffrey Smith, and Cynthia Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, December 1996.
    • (1996) Journal of Computer Security , vol.4 , Issue.3 , pp. 167-187
    • Volpano, D.1    Smith, G.2    Irvine, C.3
  • 26
    • 3042812934 scopus 로고
    • Monads for functional programming
    • M. Broy, editor Springer Verlag Proceedings of the International Summer School at Marktoberdorf directed by F. L. Bauer, M. Broy, E. W. Dijkstra, D. Gries, and C. A. R. Hoare
    • Philip Wadler. Monads for functional programming. In M. Broy, editor, Program Design Calculi, volume 118 of NATO ASI series, Series F: Computer and System Sciences. Springer Verlag, 1994. Proceedings of the International Summer School at Marktoberdorf directed by F. L. Bauer, M. Broy, E. W. Dijkstra, D. Gries, and C. A. R. Hoare.
    • (1994) Program Design Calculi, Volume 118 of NATO ASI Series, Series F: Computer and System Sciences
    • Wadler, P.1
  • 28
    • 0347507512 scopus 로고    scopus 로고
    • Eliminating array bound checking through dependent types
    • May
    • Hongwei Xi and Frank Pfenning. Eliminating array bound checking through dependent types. ACM SIGPLAN Notices, 33(5):249-257, May 1998.
    • (1998) ACM SIGPLAN Notices , vol.33 , Issue.5 , pp. 249-257
    • Xi, H.1    Frank, P.2
  • 29
    • 0032670051 scopus 로고    scopus 로고
    • Dependent types in practical programming
    • ACM, editor January 20-22 San Antonio, TX, ACM SIGPLAN Notices New York, NY, USA, 1999. ACM Press
    • Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In ACM, editor, POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, January 20-22, 1999, San Antonio, TX, ACM SIGPLAN Notices, pages 214-227, New York, NY, USA, 1999. ACM Press.
    • (1999) POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of Programming Languages , pp. 214-227
    • Xi, H.1    Frank, P.2


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