An algorithm for type-checking dependent types

Science of Computer Programming

Volumn 26, Issue 1-3, 1996, Pages 167-177

  Coquand, Thierry ^a  

^a UNIVERSITY OF GOTHENBURG   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; PROGRAMMING THEORY; THEOREM PROVING;

ALPHA CONVERSION; PROOF CHECKING; TYPE CHECKER;

ALGORITHMS;

EID: 0030143695     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(95)00021-6     Document Type: Article

References (19)

1. M. Abadi, L. Cardelli, P.L. Curien and J.J. Levy, Explicit substitutions, J. Funct. Programming 1 (4) (1991) 375-416.
2. H. Abelson and G. Sussman, Structure and Interpretation of Computer Programs (MIT Press, Cambridge, MA, 1986).
3. L. Augustsson, Haskell B. User's manual available over WWW from hhtp://www.cs.chalmers. se:80/pub/haskell/chalmers.
4. H. Barendregt, Lambda calculi with types, in: S. Abramski, D.M. Gabbai and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, Vol. II (Oxford University Press, Oxford, 1992).
5. L. Cardelli, Typeful programming, in: E.J. Neuhold, Paul eds., Formal Description of Programming Concepts (Springer, Berlin, 1991).
6. Th. Coquand and H. Herbelin, A-translation and looping combinators in pure type system, J. Funct. Programming 4 (1994) 77-88.
7. Th. Coquand and G. Huet, The calculus of constructions, Inform. and Comput. 76 (1988) 95-120.
8. P.L. Curien, An abstract framework for environment machines, Theoret. Comput. Sci. 82 (1991) 389-402.
9. N.G. de Bruijn, A plea for weaker frameworks, in: G. Huet and G. Plotkin eds., Logical Framework (Cambridge University Press, Cambridge, 1991) 40-68.
10. M.J. Gordon, A.J. Milner and C.P. Wadsworth, Edinburgh LCF - a Mechanised Logic of Computation, Lecture Notes in Computer Science, Vol. 78 (Springer, New York, 1979).
11. K. Hanna and N. Daeche, Purely Functional Implementation of a Logic, Lecture Notes in Computer Science, Vol. 230 (Springer, New York, 1986) 598-607.
12. L. Henkin, Completeness in the theory of types, J. Symbolic Logic 15 (1950) 81-91.
13. J.R. Hindley and J. Seldin, Introduction to Combinators and λ-calculus, London Mathematical Society Student Texts, Vol. 1 (Cambridge University Press, Cambridge, 1986).
14. G. Huet, The Constructive Engine, in: R. Narasimhan, ed., A Perspective in Theoretical Computer Science (World Scientific, Singapore, 1989).
15. L. Paulson, Isabelle: The Next 700 Theorem Provers, in: P. Odifreddi, ed., Logic and Computer Science, The APICS studies in Data Processing Vol. 31 (Academic Press, 1990) 361-386.
16. R. Pollack, Closure under Alpha Conversion, in: H. Barendregt and T. Nipkow eds., Types for Proofs and Programs, Lecture Notes in Computer Science, Vol. 806 (Springer, New York, 1993) 313-332.
17. A. Stoughton, Substitution revisited, Theoret. Comput. Sci. 59 (1988) 317-325.
18. J. Stoy, Denotational Semantics (MIT Press, Cambridge, 1977).
19. A. Tatsitro, Formulation of Martin-Löf's Theory of Types with Explicit Substitution, Licentiate Thesis, Chalmers University, 1993.