메뉴 건너뛰기




Volumn 6604 LNCS, Issue , 2011, Pages 57-71

Irrelevance in type theory with a heterogeneous equality judgement

Author keywords

algorithmic equality; dependent types; heterogeneously typed equality; logical relation; proof irrelevance; universal Kripke model

Indexed keywords

ALGORITHMIC EQUALITY; DEPENDENT TYPES; HETEROGENEOUSLY TYPED EQUALITY; LOGICAL RELATIONS; PROOF IRRELEVANCE; UNIVERSAL KRIPKE MODEL;

EID: 79953194130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19805-2_5     Document Type: Conference Paper
Times cited : (12)

References (25)
  • 1
    • 79953178580 scopus 로고    scopus 로고
    • Extensional normalization in the logical framework with proof irrelevant equality
    • Danvy, O. (ed.)
    • Abel, A.: Extensional normalization in the logical framework with proof irrelevant equality. In: Danvy, O. (ed.) 2009 Wksh. on Normalization by Evaluation (2009)
    • 2009 Wksh. on Normalization by Evaluation (2009)
    • Abel, A.1
  • 3
    • 48949094253 scopus 로고    scopus 로고
    • Verifying a semantic βη-conversion test for martin-l-of type theory
    • Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. Springer, Heidelberg
    • Abel, A., Coquand, T., Dybjer, P.: Verifying a semantic βη-conversion test for martin-l-of type theory. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 29-56. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5133 , pp. 29-56
    • Abel, A.1    Coquand, T.2    Dybjer, P.3
  • 4
    • 70350646944 scopus 로고    scopus 로고
    • A modular type-checking algorithm for type theory with singleton types and proof irrelevance
    • Curien, P.-L. (ed.) TLCA 2009. Springer, Heidelberg
    • Abel, A., Coquand, T., Pagano, M.: A modular type-checking algorithm for type theory with singleton types and proof irrelevance. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol. 5608, pp. 5-19. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5608 , pp. 5-19
    • Abel, A.1    Coquand, T.2    Pagano, M.3
  • 5
    • 79953177839 scopus 로고    scopus 로고
    • FOSSACS 2008. Springer, Heidelberg
    • Amadio, R.M. (ed.): FOSSACS 2008. LNCS, vol. 4962. Springer, Heidelberg (2008
    • (2008) LNCS , vol.4962
    • Amadio, R.M.1
  • 6
    • 0043039003 scopus 로고    scopus 로고
    • Cayenne - A language with dependent types
    • Proc. of the 3rd ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 1998). ACM Press, New York
    • Augustsson, L.: Cayenne - a language with dependent types. In: Proc. of the 3rd ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 1998). SIGPLAN Notices, vol. 34, pp. 239-250. ACM Press, New York (1999)
    • (1999) SIGPLAN Notices , vol.34 , pp. 239-250
    • Augustsson, L.1
  • 7
    • 4444236011 scopus 로고    scopus 로고
    • Propositions as [Types]
    • Awodey, S., Bauer, A.: Propositions as [Types]. J. Log. Comput. 14(4), 447-471 (2004)
    • (2004) J. Log. Comput. , vol.14 , Issue.4 , pp. 447-471
    • Awodey, S.1    Bauer, A.2
  • 8
    • 47249123760 scopus 로고    scopus 로고
    • The implicit calculus of constructions as a programming language with dependent types
    • Barras, B., Bernardo, B.: The implicit calculus of constructions as a programming language with dependent types. In: Amadio [5], pp. 365-379
    • Amadio , Issue.5 , pp. 365-379
    • Barras, B.1    Bernardo, B.2
  • 9
    • 70350345202 scopus 로고    scopus 로고
    • A Brief Overview of Agda - A Functional Language with Dependent Types
    • Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. Springer, Heidelberg
    • Bove, A., Dybjer, P., Norell, U.: A Brief Overview of Agda - A Functional Language with Dependent Types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 73-78. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5674 , pp. 73-78
    • Bove, A.1    Dybjer, P.2    Norell, U.3
  • 10
    • 0030143695 scopus 로고    scopus 로고
    • An algorithm for type-checking dependent types
    • Proc. of the 3rd Int. Conf. on Mathematics of Program Construction, MPC 1995. Elsevier, Amsterdam
    • Coquand, T.: An algorithm for type-checking dependent types. In: Proc. of the 3rd Int. Conf. on Mathematics of Program Construction, MPC 1995. Sci. Comput. Program., vol. 26, pp. 167-177. Elsevier, Amsterdam (1996)
    • (1996) Sci. Comput. Program. , vol.26 , pp. 167-177
    • Coquand, T.1
  • 11
    • 0004160776 scopus 로고
    • PhD thesis, University of Edinburgh, Available as LFCS Report ECS-LFCS- August
    • Goguen, H.: A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, Available as LFCS Report ECS-LFCS-94-304 (August 1994)
    • (1994) A Typed Operational Semantics for Type Theory , pp. 94-304
    • Goguen, H.1
  • 12
    • 11444266760 scopus 로고    scopus 로고
    • On equivalence and canonical forms in the LF type theory
    • Harper, R., Pfenning, F.: On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic 6(1), 61-101 (2005)
    • (2005) ACM Transactions on Computational Logic , vol.6 , Issue.1 , pp. 61-101
    • Harper, R.1    Pfenning, F.2
  • 14
    • 35248843145 scopus 로고    scopus 로고
    • A new extraction for coq
    • Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. Springer, Heidelberg
    • Letouzey, P.: A new extraction for coq. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 200-219. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2646 , pp. 200-219
    • Letouzey, P.1
  • 17
    • 84888873920 scopus 로고    scopus 로고
    • The Implicit Calculus of Constructions
    • Abramsky, S. (ed.) TLCA 2001. Springer, Heidelberg
    • Miquel, A.: The Implicit Calculus of Constructions. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 344-359. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2044 , pp. 344-359
    • Miquel, A.1
  • 19
    • 47249102619 scopus 로고    scopus 로고
    • Erasure and polymorphism in pure type systems
    • Mishra-Linger, N., Sheard, T.: Erasure and polymorphism in pure type systems. In: Amadio [5], pp. 350-364
    • Amadio , Issue.5 , pp. 350-364
    • Mishra-Linger, N.1    Sheard, T.2
  • 21
    • 85025498724 scopus 로고
    • Synthesis of ML programs in the system Coq
    • Paulin-Mohring, C., Werner, B.: Synthesis of ML programs in the system Coq. J. Symb. Comput. 15(5/6), 607-640 (1993)
    • (1993) J. Symb. Comput. , vol.15 , Issue.5-6 , pp. 607-640
    • Paulin-Mohring, C.1    Werner, B.2
  • 24
    • 35248833103 scopus 로고    scopus 로고
    • Extending Higher-Order Unification to Support Proof Irrelevance
    • Basin, D., Wolff, B. (eds.) TPHOLs 2003. Springer, Heidelberg
    • Reed, J.: Extending Higher-Order Unification to Support Proof Irrelevance. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 238-252. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2758 , pp. 238-252
    • Reed, J.1
  • 25
    • 77955263403 scopus 로고    scopus 로고
    • On the strength of proof-irrelevant type theories
    • Werner, B.: On the strength of proof-irrelevant type theories. Logical Meth. in Comput. Sci. 4 (2008)
    • (2008) Logical Meth. in Comput. Sci. , vol.4
    • Werner, B.1


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