Pure type systems with judgemental equality

Journal of Functional Programming

Volumn 16, Issue 2, 2006, Pages 219-246

  Adams, Robin ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHURCH-ROSSER THEOREM; ONE-STEP REDUCTION; PURE TYPE SYSTEMS; SUBJECT REDUCTION; TYPING SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

THEOREM PROVING;

EID: 31744448151     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796805005770     Document Type: Article

References (17)

1. Barendregt, H. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.), Handbook of Logic in Computer Science, vol. II. Oxford University Press.
2. Coquand, T. (1991) An algorithm for testing conversion in type theory. In: Huet, G. and Plotkin, G. (eds.), Logical Frameworks, pp. 255-279. Cambridge University Press.
3. Coquand, T. and Huet, G. (1988) The calculus of constructions. Infor. & Computation, 76, 95-120.
4. Geuvers, H. (1993) Logics and type systems. PhD thesis, Katholieke Universiteit Nijmegen.
5. Goguen, H. (1994) A typed operational semantics for type theory. PhD thesis, Edinburgh University.
6. Goguen, H. (1999) Soundness of typed operational semantics for the logical framework. In: Girard, Je.-Y. (ed)., Typed Lambda Calculi and Applications, 4th International Conference TLCA'99, pp. 177-197. Lecture Notes in Computer Science, vol. 1581. Springer.
7. Gutiérrez, F. and Ruiz, B. C. (2003) Expansion postponement via cut elimination in sequence calculi for pure type systems. Thirtieth International Colloquium on Automata, Languages and Programming (ICALP'03). Lecture Notes in Computer Science, vol. 2719.
8. Harper, R., Honsell, F. and Plotkin, G. (1993) A framework for denning logics. J. ACM, 40(1), 143-184.
9. (A preliminary version appeared in the Proceedings of the Symposium on Logic in Computer Science, pages 194-204, June 1987.)
10. Luo, Z. (1994) Computation and Reasoning: A type theory for computer science. International Series of Monographs on Computer Science, no. 11. Oxford University Press.
11. +: a lambda-free logical framework. J. Funct. Program. 13(2), 317-338.
12. Nordström, B., Petersson, K. and Smith, J. (1990) Programming in Martin-Löfs Type Theory: an introduction. Oxford University Press.
13. Poll, E. (1998) Expansion postponement for normalising pure type systems. J. Funct. Program. 8(1), 89-96.
14. Ruiz, B. C. (1999) Condensing lemmas in pure type systems with universes. In: Haeberer, A. M. (ed.), 7th International Conference on Algebraic Methodology and Software Technology (AMAST'98) Proceedings, pp. 422-437. Lecture Notes in Computer Science, vol. 1548. Springer-Verlag.
15. Ruiz, B. C. (2000) The expansion postponement problem in pure type systems with universes. In: 9th International Workshop on Functional and Logic Programming (WFLP'2000), pp. 210-224. Benicassim, Spain. Publication 2000/2039.
16. Streicher, T. (1991) Semantics of type theory: Correctness, completeness and independence results. Progress in Theoretical Computer Science. Boston: Birkhäuser.
17. van Benthem Jutting, L. S. (1993) Typing in pure type systems. Infor. & Computation, 105(1), 30-41.