{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T01:48:30Z","timestamp":1784166510889,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540784975","type":"print"},{"value":"9783540784999","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_26","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T19:02:25Z","timestamp":1207076545000},"page":"365-379","source":"Crossref","is-referenced-by-count":28,"title":["The Implicit Calculus of Constructions as a Programming Language with Dependent Types"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Barras","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Bernardo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Barendregt, H.: Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen. In: Handbook of Logic in Computer Science, vol. II (1991)"},{"key":"26_CR2","unstructured":"Brady, E.: Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, Durham University (2005)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-540-24849-1_8","volume-title":"Types for Proofs and Programs","author":"E. Brady","year":"2004","unstructured":"Brady, E., McBride, C., McKinna, J.: Inductive families need not store their indices. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 115\u2013129. Springer, Heidelberg (2004)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Xi, H.: Combining Programming with Theorem Proving. In: Proceedings of the tenth ACM SIGPLAN ICFP, Tallinn, Estonia, pp. 66\u201377 (September 2005)","DOI":"10.1145\/1086365.1086375"},{"key":"26_CR5","volume-title":"Implementing Mathematics with the Nuprl Development System","author":"R.L. Constable","year":"1986","unstructured":"Constable, R.L., Allen, S.F., Bromley, H.M., Cleaveland, W.R., Cremer, J.F., Harper, R.W., Howe, D.J., Knoblock, T.B., Mendler, N.P., Panangaden, P., Sasaki, J.T., Smith, S.F.: Implementing Mathematics with the Nuprl Development System. Prentice-Hall, NJ (1986)"},{"key":"26_CR6","unstructured":"Letouzey, P.: Programmation fonctionnelle certifi\u00e9e \u2013 L\u2019extraction de programmes dans l\u2019assistant Coq. PhD thesis, Universit\u00e9 Paris-Sud (July 2004)"},{"key":"26_CR7","unstructured":"Luo, Z.: An Extended Calculus of Constructions. PhD thesis, University of Edinburgh (1990)"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1017\/S0956796803004829","volume":"14","author":"C. McBride","year":"2004","unstructured":"McBride, C., McKinna, J.: The view from the left. Journal of Functional Programming\u00a014(1), 69\u2013111 (2004)","journal-title":"Journal of Functional Programming"},{"key":"26_CR9","unstructured":"Miquel, A.: Arguments implicites dans le calcul des constructions: \u00e9tude d\u2019un formalisme \u00e0 la curry. Master\u2019s thesis, University Paris 7 (1998)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45413-6_27","volume-title":"Typed Lambda Calculi and Applications","author":"A. Miquel","year":"2001","unstructured":"Miquel, A.: The implicit calculus of constructions. Extending pure type systems with an intersection type binder and subtyping. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, Springer, Heidelberg (2001)"},{"key":"26_CR11","unstructured":"Miquel, A.: Le Calcul des Constructions implicite: syntaxe et s\u00e9mantique. PhD thesis, Universit\u00e9 Paris 7 (December 2001)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39185-1_14","volume-title":"Types for Proofs and Programs","author":"A. Miquel","year":"2003","unstructured":"Miquel, A., Werner, B.: The not so simple proof-irrelevent model of CC. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol.\u00a02646, Springer, Heidelberg (2003)"},{"key":"26_CR13","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 G\u00f6teborg, Sweden (September 2007)"},{"key":"26_CR14","unstructured":"Owre, S., Shankar, N.: The formal semantics of PVS. Technical Report SRI-CSL-97-2, Menlo Park, CA (1997)"},{"key":"26_CR15","unstructured":"Prost, F.: Interpr\u00e9tation de l\u2019analyse statique en th\u00e9orie des types. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Lyon (December 1999)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74464-1_16","volume-title":"Types for Proofs and Programs","author":"M. Sozeau","year":"2007","unstructured":"Sozeau, M.: Subset coercions in Coq. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol.\u00a04502, Springer, Heidelberg (2007)"},{"key":"26_CR17","unstructured":"The Coq development team. The coq proof assistant reference manual v8.0. Technical report, INRIA, France, mars (2004), \n                  \n                    http:\/\/coq.inria.fr\/doc\/main.html"},{"key":"26_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/11814771_49","volume-title":"Automated Reasoning","author":"B. Werner","year":"2006","unstructured":"Werner, B.: On the strength of proof-irrelevant type theories. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 604\u2013618. Springer, Heidelberg (2006)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Xi, H., Pfenning, F.: Dependent types in practical programming. In: Proceedings of the 26th ACM SIGPLAN Symposium on Principles of Programming Languages, San Antonio, pp. 214\u2013227 (January 1999)","DOI":"10.1145\/292540.292560"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:33Z","timestamp":1619507493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_26","relation":{},"subject":[]}}