Type Inference for Pure Type Systems

Information and Computation

Volumn 143, Issue 1, 1998, Pages 1-23

  Severi, Paula ^a  

^a NONE   (Uruguay)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347804903     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2708     Document Type: Article

References (10)

1. Barendregt, H. (1992), Lambda calculi with types, in "Handbook of Logic in Computer Science" (D. M. Gabbai, S. Abramsky, and T. S. E. Maibaum, Eds.), Vol. 1, pp. 117-309, Oxford University Press.
2. Coquand, T., and Herbelin, H. (1994), A-translation and looping combinators in pure type systems. J. Functional Program. 4(1), 77-88.
3. Coquand, T. (1991), An algorithm for testing conversion in type theory, in "Logical Frameworks."
4. Magnusson, L. (1994), "The Implementation of Alf-a Proof Editor Based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution," Ph.D. thesis, Chalmers University of Technology.
5. Meyer, M. R., and Reinhold, M. B. (1986), 'type' is not a type: Preliminary report, in "Principles of Programming Languages," pp. 287-295, Assoc. Comput. Mach., New York.
6. Poll, E. (1993), A type checker for bijective pure type systems, Computing Science Note CS-9322, Eindhoven University of Technology.
7. Pollack, R. (1996), A verified type checker, in "Proceedings of the 7th Nordic Workshop on Programming Theory, 86" (B. Bjerner, M. Larsson, and B. Nordström, Eds.), Göteborg University and Chalmers University of Technology.
8. Severi, P. (1996), "Normalisation on Lambda Calculus and Its Relation to Type Inference," Ph.D. thesis, Eindhoven University of Technology.
9. van Benthem Jutting, B. (1993), Typing in pure type systems, Inform. and Comput. 105, 30-41.
10. van Benthem Jutting, B., McKinna, J., and Pollack, R. (1993), Checking algorithms for pure type systems, in "Types for Proofs and Programs" (H. Barendregt and T. Nipkov, Eds.), Vol. 806.