The relevance of proof-irrelevance: A meta-theoretical study of generalised calculi of constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 755-768

  Barthe, Gilles ^a,b  

^a Chalmers Tekniska Ilügskola   (Sweden)

^b UNIVERSITY OF MINHO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS;

CALCULUS OF CONSTRUCTION; NORMALISATION; PROOF IRRELEVANCE; THEORETICAL STUDY;

AUTOMATA THEORY;

EID: 84878530374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055099     Document Type: Conference Paper

References (21)

1. P. Audebaud. Partial objects in the calculus of constructions. In Proceedings of LICS'91, pages 86-95. IEEE Computer Society Press, 1991.
2. L. Augustsson. Cayenne: Spice up your programming with dependent types. Prelimnary draft, 1998.
3. F. Barbancra, M. Fernandez, and H Geuvers. Modularity of strong normalisation and confluence in the algebraic λ-eubo. Journal of Functional Programming, November 1997.
4. H. Darendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, pages 117-309. Oxford Science Publications, 1992. Volume 2.
5. G. Darthe and H. Geuvers. Congruence types. In H. Kleine Bucning, editor, Proceedings of CSL'95, Volume 1092 of Lecture Notes in Computer Science, pages 36-51. Springer-Verlag, 1996.
6. G. Barthe, J. Hatcliff, and M.H. Sørensen. A notion of classical pure type system. In Proceedings of MFPS'97, Volume 6 of Electronic. Notes in Theoretical Computer Science. Elsevier, 1997.
7. G. Barthc and F. van Ilaamsdonk. Termination of algebraic type systems: the syntactic approach. In M. Hanns and J. fleering, editors, Proceedings of ALP '97-HOA '97, Volume 1298 of Lecture Notes in Computer Science, pages 174-193. Springer-Verlag, 1997.
8. V. Brcazu-Tannen. Combining algebra and higher-order types. In Proceedings of LJCS'88, pages 82-90. IEEE Computer Society Press, 1988.
9. R.L. Constable and S.F. Smith. Partial objects in constructive type theory. In Proceedings of LICS'87, pages 183-193. IEEE Computer Society Press, 1987.
10. T. Coquand. Pattern matching in type theory. In B. Nordstrom, editor, Informal proceedings of LF'92, pages 66-79, 1992.
11. T. Coquand and H. Herbelin. A-translation and looping combinators in pure type systems. Journal of Functional Programming, 4(1):77-88, January 1994.
12. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95-120 February/March 1988.
13. N.G. de Bruijn. Some extensions of Automath: the AUT-4 family. In R. Nederpelt, H. Geuvers, and R. do Vrijer, editors, Selected papers on Automath, Volume 133 of Studies in Logic and the Foundations of Mathematics, pages 283-288. North-Holland, Amsterdam, 1994.
14. D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101(2):251-267, December 1992.
15. H. Gouvers. The Church-Rosser property for βη-reduction in typed λ-calculi. In Proceedings of LICS'98, pages 453-460. IEEE Computer Society Press, 1992.
16. H. Geuvers. A short and flexible proof of strong normalisation for the Calculus of Constructions. In P. Dybjer, D. Nordström, and J. Smith, editors, Proceedings of TYPES'94, Volume 996 of Lecture Notes in Computer Science, pages 14-38. Springer-Verlag, 1995.
17. H. Geuvers and M.J. Nederhof. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming, 1(2):155-189, April 1991.
18. T. Griffin. A formulac-as-types notion of control. In Proceedings of POPL '90, pages 47-58. ACM Press, 1990.
19. M. Hofmann and T. Streicher. The groupoid model refutes uniqueness of identity proofs. In Proceedings of LICS'94, pages 208-212. IEEE Computer Society Press, 1994.
20. J.-P. Jouannaud and M. Oknda. Abstract data type systems. Theorctical Computer Science, 173(2):349-391, February 1997.
21. F. Pfenning and C. Paulin. Inductively defined types in the calculus of constructions. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Proceedings of MFPS'89, Volume 442 of Lecture Notes in Computer Science, pages 209-228. Springer-Verlag, 1989.