메뉴 건너뛰기




Volumn 1512, Issue , 1998, Pages 46-65

An implementation of the heine-borel covering theorem in type theory

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84958975116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0097786     Document Type: Conference Paper
Times cited : (3)

References (11)
  • 1
    • 0001439401 scopus 로고
    • Lambda calculi with types
    • S. Abramsky, D.M. Gabbay and T.S.E. Maibaum eds, Oxford University Press, Oxford
    • H. Barendregt. Lambda calculi with types, In S. Abramsky, D.M. Gabbay and T.S.E. Maibaum eds., "Handbook of Logic in Computer Science, Vol. 2", Oxford University Press, Oxford, 1992.
    • (1992) Handbook of Logic in Computer Science , vol.2
    • Barendregt, H.1
  • 2
    • 0002434388 scopus 로고
    • A plea for weaker frameworks
    • G. Huet and G. Plotkin eds, Cambridge University Press, Cambridge
    • N.G. de Bruijn. A plea for weaker frameworks, In G. Huet and G. Plotkin eds., "Logical Frameworks", pp. 40-68, Cambridge University Press, Cambridge, 1991.
    • (1991) Logical Frameworks , pp. 40-68
    • de Bruijn, N.G.1
  • 3
    • 84885641407 scopus 로고    scopus 로고
    • A constructive proof of the Heine-Borel covering theorem for formal reals
    • S. Berardi and M. Coppo eds, Springer-Verlag
    • J. Cederquist, S. Negri. A constructive proof of the Heine-Borel covering theorem for formal reals, In S. Berardi and M. Coppo eds., "Types for Proofs and Programs", Lecture Notes in Computer Science 1158, pp. 62-75, Springer-Verlag, 1996.
    • (1996) Types for Proofs and Programs", Lecture Notes in Computer Science , vol.1158 , pp. 62-75
    • Cederquist, J.1    Negri, S.2
  • 4
    • 0030143695 scopus 로고    scopus 로고
    • An algorithm for type-checking dependent types
    • Elsevier
    • T. Coquand. An algorithm for type-checking dependent types, Science of Computer Programming 26, pp. 167-177, Elsevier, 1996.
    • (1996) Science of Computer Programming , vol.26 , pp. 167-177
    • Coquand, T.1
  • 5
    • 25444440286 scopus 로고
    • A model of intensional Martin-Lof type theory in which unicity of identity proofs does not hold
    • Dept, of Computer Science, University of Edinburgh
    • M. Hofmann. A model of intensional Martin-Lof type theory in which unicity of identity proofs does not hold, Technical report, Dept, of Computer Science, University of Edinburgh, 1993.
    • (1993) Technical report
    • Hofmann, M.1
  • 6
    • 0003976687 scopus 로고
    • The Implementation of ALF - A Proof Editor based on Martin-Lof’s Monomorphic Type Theory with Explicit Substitution
    • Chalmers University of Technology and University of Goteborg
    • L. Magnusson. "The Implementation of ALF - a Proof Editor based on Martin-Lof’s Monomorphic Type Theory with Explicit Substitution", Chalmers University of Technology and University of Goteborg, PhD Thesis, 1995.
    • (1995) PhD Thesis
    • Magnusson, L.1
  • 7
    • 84958993317 scopus 로고
    • To be published in the proceedings of Twenty-five years of Constructive Type Theory, G. Sambin and J. Smith eds., Oxford University Press
    • P. Martin-Lof. An Intuitionistic Theory of Types (1972), To be published in the proceedings of Twenty-five years of Constructive Type Theory, G. Sambin and J. Smith eds., Oxford University Press.
    • (1972) An Intuitionistic Theory of Types
    • Martin-Lof, P.1
  • 11
    • 0002909550 scopus 로고
    • Intuitionistic formal spaces - A first communication
    • D. Skordev ed, Plenum Press
    • G. Sambin. Intuitionistic formal spaces - a first communication, In D. Skordev ed., "Mathematical logic and its applications", pp. 187-204, Plenum Press, 1987.
    • (1987) Mathematical logic and its applications , pp. 187-204
    • Sambin, G.1


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