{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:03Z","timestamp":1725551943622},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122507"},{"type":"electronic","value":"9783642122514"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_14","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T19:32:42Z","timestamp":1270841562000},"page":"175-190","source":"Crossref","is-referenced-by-count":3,"title":["Automatically Generating Counterexamples to Naive Free Theorems"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Seidel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janis","family":"Voigtl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Augustsson, L.: Putting Curry-Howard to work (Invited talk). At Approaches and Applications of Inductive Programming (2009)"},{"key":"14_CR2","first-page":"39","volume-title":"Proceedings of Programming Languages meets Program Verification","author":"J. Christiansen","year":"2010","unstructured":"Christiansen, J., Seidel, D., Voigtl\u00e4nder, J.: Free theorems for functional logic programs. In: Proceedings of Programming Languages meets Program Verification, pp. 39\u201348. ACM Press, New York (2010)"},{"key":"14_CR3","first-page":"268","volume-title":"Proceedings of International Conference on Functional Programming","author":"K. Claessen","year":"2000","unstructured":"Claessen, K., Hughes, R.J.M.: QuickCheck: A lightweight tool for random testing of Haskell programs. In: Proceedings of International Conference on Functional Programming, pp. 268\u2013279. ACM Press, New York (2000)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-24849-1_11","volume-title":"Types for Proofs and Programs","author":"P. Corbineau","year":"2004","unstructured":"Corbineau, P.: First-order reasoning in the calculus of inductive constructions. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 162\u2013177. Springer, Heidelberg (2004)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R. Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic\u00a057(3), 795\u2013807 (1992)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1706356.1706379","volume-title":"Proceedings of Partial Evaluation and Program Manipulation","author":"S. Holdermans","year":"2010","unstructured":"Holdermans, S., Hage, J.: Making \u201cstricterness\u201d more relevant. In: Proceedings of Partial Evaluation and Program Manipulation, pp. 121\u2013130. ACM Press, New York (2010)"},{"key":"14_CR7","first-page":"99","volume-title":"Proceedings of Principles of Programming Languages","author":"P. Johann","year":"2004","unstructured":"Johann, P., Voigtl\u00e4nder, J.: Free theorems in the presence of seq. In: Proceedings of Principles of Programming Languages, pp. 99\u2013110. ACM Press, New York (2004)"},{"issue":"1\u20132","key":"14_CR8","first-page":"63","volume":"69","author":"P. Johann","year":"2006","unstructured":"Johann, P., Voigtl\u00e4nder, J.: The impact of seq on free theorems-based program transformations. Fundamenta Informaticae\u00a069(1\u20132), 63\u2013102 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"14_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171472","volume-title":"Proofs and Refutations: The Logic of Mathematical Discovery","author":"I. Lakatos","year":"1976","unstructured":"Lakatos, I.: Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press, Cambridge (1976)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-61055-3_38","volume-title":"Programming Languages and Systems - ESOP \u201996","author":"J. Launchbury","year":"1996","unstructured":"Launchbury, J., Paterson, R.: Parametricity and unboxing with unpointed types. In: Riis Nielson, H. (ed.) ESOP 1996. LNCS, vol.\u00a01058, pp. 204\u2013218. Springer, Heidelberg (1996)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Programming Symposium","author":"J.C. Reynolds","year":"1974","unstructured":"Reynolds, J.C.: Towards a theory of type structure. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol.\u00a019, pp. 408\u2013423. Springer, Heidelberg (1974)"},{"key":"14_CR12","first-page":"513","volume-title":"Proceedings of Information Processing","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Proceedings of Information Processing, pp. 513\u2013523. Elsevier, Amsterdam (1983)"},{"key":"14_CR13","unstructured":"Seidel, D., Voigtl\u00e4nder, J.: Automatically generating counterexamples to naive free theorems. Technical Report TUD-FI09-05, Technische Universit\u00e4t Dresden (2009), \n                      \n                        http:\/\/www.iai.uni-bonn.de\/~jv\/TUD-FI09-05.pdf"},{"key":"14_CR14","unstructured":"Seidel, D., Voigtl\u00e4nder, J.: Taming selective strictness. In: Proceedings of Arbeitstagung Programmiersprachen. LNI, vol.\u00a0154, pp. 2916\u20132930. GI (2009)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-02273-9_22","volume-title":"Typed Lambda Calculi and Applications","author":"F. Stenger","year":"2009","unstructured":"Stenger, F., Voigtl\u00e4nder, J.: Parametricity for Haskell with imprecise error semantics. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol.\u00a05608, pp. 294\u2013308. Springer, Heidelberg (2009)"},{"key":"14_CR16","first-page":"29","volume-title":"Proceedings of Principles of Programming Languages","author":"J. Voigtl\u00e4nder","year":"2008","unstructured":"Voigtl\u00e4nder, J.: Much ado about two: A pearl on parallel prefix computation. In: Proceedings of Principles of Programming Languages, pp. 29\u201335. ACM Press, New York (2008)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-78969-7_13","volume-title":"Functional and Logic Programming","author":"J. Voigtl\u00e4nder","year":"2008","unstructured":"Voigtl\u00e4nder, J.: Semantics and pragmatics of new shortcut fusion rules. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 163\u2013179. Springer, Heidelberg (2008)"},{"key":"14_CR18","first-page":"165","volume-title":"Proceedings of Principles of Programming Languages","author":"J. Voigtl\u00e4nder","year":"2009","unstructured":"Voigtl\u00e4nder, J.: Bidirectionalization for free! In: Proceedings of Principles of Programming Languages, pp. 165\u2013176. ACM Press, New York (2009)"},{"key":"14_CR19","first-page":"347","volume-title":"Proceedings of Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: Proceedings of Functional Programming Languages and Computer Architecture, pp. 347\u2013359. ACM Press, New York (1989)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Wright, D.A.: A new technique for strictness analysis. In: Abramsky, S., Maibaum, T. (eds.) TAPSOFT 1991. LNCS, vol.\u00a0494, pp. 235\u2013258. Springer, Heidelberg (1991)","DOI":"10.1007\/3540539816_70"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12251-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:10:04Z","timestamp":1558275004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}