메뉴 건너뛰기




Volumn 4962 LNCS, Issue , 2008, Pages 365-379

The implicit calculus of constructions as a programming language with dependent types

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTERS; DIFFERENTIATION (CALCULUS); FOUNDATIONS; LINGUISTICS; MATHEMATICAL TECHNIQUES; SPECIFICATIONS;

EID: 47249123760     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_26     Document Type: Conference Paper
Times cited : (66)

References (19)
  • 1
    • 4243377709 scopus 로고
    • Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen
    • Barendregt, H.: Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen. In: Handbook of Logic in Computer Science, vol. II (1991)
    • (1991) Handbook of Logic in Computer Science , vol.2
    • Barendregt, H.1
  • 2
    • 47249155140 scopus 로고    scopus 로고
    • Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, Durham University
    • Brady, E.: Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, Durham University (2005)
    • (2005)
    • Brady, E.1
  • 3
    • 33745120551 scopus 로고    scopus 로고
    • Inductive families need not store their indices
    • Berardi, S, Coppo, M, Damiani, F, eds, TYPES 2003, Springer, Heidelberg
    • Brady, E., McBride, C., McKinna, J.: Inductive families need not store their indices. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 115-129. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3085 , pp. 115-129
    • Brady, E.1    McBride, C.2    McKinna, J.3
  • 4
    • 33745215143 scopus 로고    scopus 로고
    • Combining Programming with Theorem Proving
    • Tallinn, Estonia, pp, September
    • Chen, C., Xi, H.: Combining Programming with Theorem Proving. In: Proceedings of the tenth ACM SIGPLAN ICFP, Tallinn, Estonia, pp. 66-77 (September 2005)
    • (2005) Proceedings of the tenth ACM SIGPLAN ICFP , pp. 66-77
    • Chen, C.1    Xi, H.2
  • 10
    • 47249086342 scopus 로고    scopus 로고
    • Miquel, A.: The implicit calculus of constructions. Extending pure type systems with an intersection type binder and subtyping. In: Abramsky, S. (ed.) TLCA 2001. LNCS, 2044, Springer, Heidelberg (2001)
    • Miquel, A.: The implicit calculus of constructions. Extending pure type systems with an intersection type binder and subtyping. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, Springer, Heidelberg (2001)
  • 12
    • 33845607186 scopus 로고    scopus 로고
    • The not so simple proof-irrelevent model of CC
    • Geuvers, H, Wiedijk, F, eds, TYPES 2002, Springer, Heidelberg
    • Miquel, A., Werner, B.: The not so simple proof-irrelevent model of CC. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2646
    • Miquel, A.1    Werner, B.2
  • 13
    • 47249127571 scopus 로고    scopus 로고
    • Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden (September 2007)
    • Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden (September 2007)
  • 14
    • 0006453595 scopus 로고    scopus 로고
    • The formal semantics of PVS
    • Technical Report SRI-CSL-97-2, Menlo Park, CA
    • Owre, S., Shankar, N.: The formal semantics of PVS. Technical Report SRI-CSL-97-2, Menlo Park, CA (1997)
    • (1997)
    • Owre, S.1    Shankar, N.2
  • 16
    • 38049160746 scopus 로고    scopus 로고
    • Subset coercions in Coq
    • Altenkirch, T, McBride, C, eds, TYPES 2006, Springer, Heidelberg
    • Sozeau, M.: Subset coercions in Coq. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4502
    • Sozeau, M.1
  • 17
    • 38149104491 scopus 로고    scopus 로고
    • The coq proof assistant reference manual v8.0
    • The Coq development team, Technical report, INRIA, France, mars
    • The Coq development team. The coq proof assistant reference manual v8.0. Technical report, INRIA, France, mars (2004), http://coq.inria.fr/doc/main.html
    • (2004)
  • 18
    • 33749567403 scopus 로고    scopus 로고
    • Werner, B.: On the strength of proof-irrelevant type theories. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), 4130, pp. 604-618. Springer, Heidelberg (2006)
    • Werner, B.: On the strength of proof-irrelevant type theories. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 604-618. Springer, Heidelberg (2006)


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