{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:27Z","timestamp":1772163987138,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,21]],"date-time":"2007-10-21T00:00:00Z","timestamp":1192924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,10,21]]},"DOI":"10.1145\/1297027.1297075","type":"proceedings-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T09:30:20Z","timestamp":1195119020000},"page":"639-658","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["No ifs, ands, or buts"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Edwards","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,10,21]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"The classical decision problem","author":"B\u00f6rger E.","year":"2001","unstructured":"E. B\u00f6rger , Y. Gurevich , and E. Gr\u00e4del . The classical decision problem . Springer , 2001 . E. B\u00f6rger, Y. Gurevich, and E. Gr\u00e4del. The classical decision problem. Springer, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1987.1663532"},{"key":"e_1_3_2_1_4_1","volume-title":"Kluwer Academic Publishers Boston","author":"Brown F.","year":"1990","unstructured":"F. Brown . Boolean Reasoning . Kluwer Academic Publishers Boston , 1990 . F. Brown. Boolean Reasoning. Kluwer Academic Publishers Boston, 1990."},{"key":"e_1_3_2_1_5_1","volume-title":"Manning","author":"Burnett M.","year":"1995","unstructured":"M. Burnett and A. Goldberg . Visual Object-Oriented programming . Manning , 1995 . M. Burnett and A. Goldberg. Visual Object-Oriented programming. Manning, 1995."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800087.802799"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052883.1052894"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094851"},{"key":"e_1_3_2_1_11_1","volume-title":"Technical report","author":"Edwards J.","year":"2006","unstructured":"J. Edwards . First Class Copy & Paste. Technical report , Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory , May 2006 . URL http:\/\/hdl.handle.net\/1721.1\/32980. J. Edwards. First Class Copy & Paste. Technical report, Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory, May 2006. URL http:\/\/hdl.handle.net\/1721.1\/32980."},{"key":"e_1_3_2_1_12_1","first-page":"12t","volume":"98","author":"Ernst M.","year":"1998","unstructured":"M. Ernst , C. Kaplan , and C. Chambers . Predicate Dispatching: A Unified Theory of Dispatch. ECOOP , 98 : 12t h, 1998 . M. Ernst, C. Kaplan, and C. Chambers. Predicate Dispatching: A Unified Theory of Dispatch. ECOOP, 98:12th, 1998.","journal-title":"Predicate Dispatching: A Unified Theory of Dispatch. ECOOP"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/365153.365163"},{"key":"e_1_3_2_1_14_1","volume-title":"Human-Computer Interaction","author":"Green T.","year":"1992","unstructured":"T. Green and M. Petre . When Visual Programs are Harder to Read than Textual Programs . Human-Computer Interaction , 1992 . T. Green and M. Petre. When Visual Programs are Harder to Read than Textual Programs. Human-Computer Interaction, 1992."},{"key":"e_1_3_2_1_15_1","volume-title":"System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on, 3","author":"Jr R. Halverson","year":"1993","unstructured":"R. Halverson Jr . An Empirical Investigation Comparing IF-THEN Rules and Decision Tables for Rrogramming Rule-based Expert Systems . System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on, 3 , 1993 . R. Halverson Jr. An Empirical Investigation Comparing IF-THEN Rules and Decision Tables for Rrogramming Rule-based Expert Systems. System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on, 3, 1993."},{"issue":"1","key":"e_1_3_2_1_16_1","first-page":"19","article-title":"Tools for constructing requirements specifications: The SCR toolset at the age of ten","volume":"20","author":"Heitmeyer C.","year":"2005","unstructured":"C. Heitmeyer , M. Archer , R. Bharadwaj , and R. Jeffords . Tools for constructing requirements specifications: The SCR toolset at the age of ten . International Journal of Computer Systems Science and Engineering , 20 ( 1 ): 19 -- 35 , 2005 . C. Heitmeyer, M. Archer, R. Bharadwaj, and R. Jeffords. Tools for constructing requirements specifications: The SCR toolset at the age of ten. International Journal of Computer Systems Science and Engineering, 20(1):19--35, 2005.","journal-title":"International Journal of Computer Systems Science and Engineering"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/359657.359663"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/270253.270276"},{"key":"e_1_3_2_1_19_1","volume-title":"Technical Report 98--004, CTI","author":"Jeffrey A.","year":"1998","unstructured":"A. Jeffrey . Premonoidal categories and a graphical view of programs. Technical Report 98--004, CTI , DePaul University , August 1998 . URL http:\/\/facweb.cs.depaul.edu\/research\/techreports\/abstract98004.htm. A. Jeffrey. Premonoidal categories and a graphical view of programs. Technical Report 98--004, CTI, DePaul University, August 1998. URL http:\/\/facweb.cs.depaul.edu\/research\/techreports\/abstract98004.htm."},{"key":"e_1_3_2_1_20_1","first-page":"47","volume-title":"Marktoberdorf Summer School","author":"Jones S.","year":"2000","unstructured":"S. Jones . Tackling the awkward squad: monadic input\/output, concurrency, exceptions, and foreignlanguage calls in Haskell. Engineering theories of software construction , Marktoberdorf Summer School , pages 47 -- 96 , 2000 . S. Jones. Tackling the awkward squad: monadic input\/output, concurrency, exceptions, and foreignlanguage calls in Haskell. Engineering theories of software construction, Marktoberdorf Summer School, pages 47--96, 2000."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/364096.364113"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/363707.363725"},{"key":"e_1_3_2_1_23_1","volume-title":"1st International Workshop on Abstract Interpretation of Object-Oriented Languages (AIOOL 2005)","author":"Kuncak V.","year":"2005","unstructured":"V. Kuncak and M. Rinard . Decision procedures for setvalued fields . 1st International Workshop on Abstract Interpretation of Object-Oriented Languages (AIOOL 2005) , 2005 . V. Kuncak and M. Rinard. Decision procedures for setvalued fields. 1st International Workshop on Abstract Interpretation of Object-Oriented Languages (AIOOL 2005), 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.825764"},{"key":"e_1_3_2_1_25_1","unstructured":"LogicGem 3.0 QuickStart. URL http:\/\/www.catalyst.com\/products\/logicgem\/quickstart.pdf.  LogicGem 3.0 QuickStart. URL http:\/\/www.catalyst.com\/products\/logicgem\/quickstart.pdf."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140335.1140352"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028976.1029006"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/28697.28698"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1045-926X(05)80036-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/953349.953350"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/832281.834582"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/356628.356630"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1952.11988183"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/953368.953369"},{"key":"e_1_3_2_1_37_1","unstructured":"StateStep Tutorial. URL http:\/\/statestep.com\/tutorial\/RuleInitial.html.  StateStep Tutorial. URL http:\/\/statestep.com\/tutorial\/RuleInitial.html."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/953368.953373"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2005.54"},{"key":"e_1_3_2_1_40_1","volume-title":"Teddington. In A. M. Turing's ACE Report of 1946 and Other Papers","author":"Turing A. M.","year":"1946","unstructured":"A. M. Turing . ( 1946 ) Proposed Electronic Calculator, report for National Physical Laboratory , Teddington. In A. M. Turing's ACE Report of 1946 and Other Papers . MIT Press , 1986. A. M. Turing. (1946) Proposed Electronic Calculator, report for National Physical Laboratory, Teddington. In A. M. Turing's ACE Report of 1946 and Other Papers. MIT Press, 1986."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/5465.5470"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91592"}],"event":{"name":"OOPSLA07: ACM SIGPLAN Object Oriented Programming Systems and Applications Conference","location":"Montreal Quebec Canada","acronym":"OOPSLA07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems, languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1297027.1297075","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1297027.1297075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:58:27Z","timestamp":1750244307000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1297027.1297075"}},"subtitle":["uncovering the simplicity of conditionals"],"short-title":[],"issued":{"date-parts":[[2007,10,21]]},"references-count":39,"alternative-id":["10.1145\/1297027.1297075","10.1145\/1297027"],"URL":"https:\/\/doi.org\/10.1145\/1297027.1297075","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1297105.1297075","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,10,21]]},"assertion":[{"value":"2007-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}