{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:42:21Z","timestamp":1746006141788},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406648"},{"type":"electronic","value":"9783540451303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/10930755_12","type":"book-chapter","created":{"date-parts":[[2006,6,19]],"date-time":"2006-06-19T11:27:09Z","timestamp":1150716429000},"page":"188-203","source":"Crossref","is-referenced-by-count":27,"title":["Combining Testing and Proving in Dependent Type Theory"],"prefix":"10.1007","author":[{"given":"Peter","family":"Dybjer","sequence":"first","affiliation":[]},{"given":"Qiao","family":"Haiyan","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Takeyama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Augustsson, L.: Cayenne: a Language with Dependent Types. In: Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP 1998). ACM SIGPLAN Notices, vol.\u00a034(1), pp. 239\u2013250 (1998)","DOI":"10.1145\/289423.289451"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/10704973_2","volume-title":"Advanced Functional Programming","author":"R. Backhouse","year":"1999","unstructured":"Backhouse, R., Jansson, P., Jeuring, J., Meertens, L.: Generic Programming \u2013 An Introduction. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 28\u2013115. Springer, Heidelberg (1999)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bove, A.: General Recursion in Type Theory. PhD thesis. Chalmers University of Technology (2002)","DOI":"10.1007\/3-540-39185-1_3"},{"key":"12_CR4","unstructured":"Carlsson, M., Hallgren, T.: Fudgets - Purely Functional Processes with applications to Graphical User Interfaces. PhD thesis. Chalmers University of Technology (1998)"},{"key":"12_CR5","first-page":"18","volume-title":"Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP 2000)","author":"K. Claessen","year":"2000","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP 2000), vol.\u00a035.9, pp. 18\u201322. ACM Press, New York (2000)"},{"key":"12_CR6","unstructured":"Claessen, K., Hughes, J.: QuickCheck: Automatic Specification-Based Testing: http: http:\/\/www.cs.chalmers.se\/~rjmh\/QuickCheck\/"},{"key":"12_CR7","unstructured":"Coquand, C.: Agda, available from http:\/\/www.cs.chalmers.se\/~catarina\/agda"},{"key":"12_CR8","unstructured":"Coquand, T.: Pattern Matching with Dependent Types. In: Nordstr\u00f6m, B., Petersson, K., Plotkin, G. (eds.) Proceedings of The 1992 Workshop on Types for Proofs and Programs, B\u00e5stad, pp. 71\u201384 (1992)"},{"key":"12_CR9","unstructured":"Coquand, T.: Structured Type Theory. draft (1999), available from http:\/\/www.cs.chalmers.se\/~coquand\/type.html"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211308","volume":"6","author":"P. Dybjer","year":"1994","unstructured":"Dybjer, P.: Inductive Families. Formal Aspects of Computing\u00a06, 440\u2013465 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-48959-2_11","volume-title":"Typed Lambda Calculi and Applications","author":"P. Dybjer","year":"1999","unstructured":"Dybjer, P., Setzer, A.: A finite axiomatization of inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 129\u2013146. Springer, Heidelberg (1999)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45504-3_7","volume-title":"Proof Theory in Computer Science","author":"P. Dybjer","year":"2001","unstructured":"Dybjer, P., Setzer, A.: Indexed Induction-Recursion. In: Kahle, R., Schroeder-Heister, P., St\u00e4rk, R.F. (eds.) PTCS 2001. LNCS, vol.\u00a02183, pp. 93\u2013113. Springer, Heidelberg (2001)"},{"key":"12_CR13","unstructured":"Hallgren, T.: Alfa, available from http:\/\/www.cs.chalmers.se\/~hallgren\/Alfa"},{"key":"12_CR14","volume-title":"PX, a Computational Logic","author":"S. Hayashi","year":"1988","unstructured":"Hayashi, S., Nakano, H.: PX, a Computational Logic. The MIT Press, Cambridge (1988)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(00)00350-9","volume":"272","author":"S. Hayashi","year":"2002","unstructured":"Hayashi, S., Sumitomo, R., Shii, K.-i.: Towards Animation of Proofs - testing proofs by examples. Theoretical Computer Science\u00a0272, 177\u2013195 (2002)","journal-title":"Theoretical Computer Science"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0049-237X(09)70189-2","volume-title":"Logic, Methodology and Philosophy of Science, VI, 1979","author":"P. Martin-L\u00f6f","year":"1982","unstructured":"Martin-L\u00f6f, P.: Constructive Mathematics and Computer Programming. In: Logic, Methodology and Philosophy of Science, VI, 1979, pp. 153\u2013175. North-Holland, Amsterdam (1982)"},{"key":"12_CR17","unstructured":"Martin-L\u00f6f, P.: Intuitionistic Type Theory. Bibliopolis (1984)"},{"key":"12_CR18","unstructured":"Okasaki, C.: An Overview of Edison. In: Haskell Workshop, September 2000, pp. 34\u201354 (2000)"},{"key":"12_CR19","unstructured":"Parent, C.: A collection of examples using the Program tactic, available from http:\/\/pauillac.inria.fr\/coq\/contribs-eng.html"},{"key":"12_CR20","unstructured":"Programatica: Integrating Programming, Properties, and Validation, http:\/\/www.cse.ogi.edu\/PacSoft\/projects\/programatica\/"},{"key":"12_CR21","volume-title":"Algorithms: a functional programming approach","author":"F.A. Rabhi","year":"1999","unstructured":"Rabhi, F.A., Lapalme, G.: Algorithms: a functional programming approach. Addison-Wesley Press, Reading (1999)"},{"key":"12_CR22","unstructured":"Wahlstedt, D.: Detecting termination using size-change in parameter values. Master thesis. Chalmers University of Technology (2000)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/292540.292560","volume-title":"Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages","author":"H. Xi","year":"1999","unstructured":"Xi, H., Pfenning, F.: Dependent types in practical programming. In: Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, pp. 214\u2013227. ACM Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10930755_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T08:24:05Z","timestamp":1555662245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10930755_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406648","9783540451303"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/10930755_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}