On lists and other abstract data types in the calculus of constructions†

Mathematical Structures in Computer Science

Volumn 10, Issue 2, 2000, Pages 261-276

  Seldin, Jonathan P ^a  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004174274     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012959900300X     Document Type: Article

References (3)

1. Berardi, S. (1993) Encoding of data types in pure construction calculus: a semantic justification. In: Huet, G. and Plotkin, G. (eds.) Logical Environments, Cambridge University Press 30–60.
2. Pfenning, F. and Paulin-Mohring, C. (1989) Inductively defined types in the calculus of construc-tions. In: Main, M., Melton, A., Mislove, M. and Schmidt, D. (eds.) Proceedings Mathematical Foundations of Programming Semantics: 5th International Conference, Tulane University, New Orleans, Louisiana USA, March 29-April 1, 1989. Springer-Verlag Lecture Notes in Computer Science 442 209–228.
3. Seldin, J. P. (1997) On the proof theory of Coquand’s calculus of constructions. Annals of Pure and Applied Logic 83 23–101.