No ifs, ands, or buts uncovering the simplicity of conditionals

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2007, Pages 639-658

  Edwards, Jonathan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Control structures; Decision tables; Polymorphism; Refactoring; Visual programming

Indexed keywords

CANONICAL FORMS; DATA FLOW GRAPH (DFG); DIRECT MANIPULATION; DISJOINTNESS; INTERNATIONAL CONFERENCES; LANGUAGES (TRADITIONAL); OBJECT-ORIENTED PROGRAMMING; PREDICATE DISPATCH; PROGRAM LOGICS; PROGRAMMING LANGUAGE; TRUTH TABLES;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTER SYSTEMS PROGRAMMING; DATA FLOW ANALYSIS; DECISION MAKING; DECISION TABLES; FUZZY LOGIC; LINGUISTICS; NEODYMIUM; PATTERN MATCHING; PROBLEM SOLVING; QUERY LANGUAGES;

OBJECT ORIENTED PROGRAMMING;

EID: 42149147913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1297027.1297075     Document Type: Conference Paper

References (42)

1. A. Blake. Canonical expressions in Boolean algebra. PhD thesis, University of Chicago, 1938.
2. E. Börger, Y. Gurevich, and E. Gradei. The classical decision problem. Springer, 2001.
3. F. Brooks. No Silver Bullet: Essence and Accidents of Software Engineering. Computer, 20(4): 10-19, 1987.
4. F. Brown. Boolean Reasoning. Kluwer Academic Publishers Boston, 1990.
5. M. Burnett and A. Goldberg. Visual object-oriented programming. Manning, 1995.
6. R. Burstall, D. MacQueen, and D. Sannella. HOPE: An experimental applicative language. Proceedings of the 1980 ACM conference on LISP and functional programming, pages 136-143, 1980.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Commun. ACM, 5(7): 394-397, 1962.
8. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM, 18 (8):453-57, 1975.
9. J. Edwards. Example centric programming. SIGPLAN Not. (OOPSLA '04 Onward! Proceedings), 39(12):84-91, 2004. ISSN 0362-1340.
10. J. Edwards. Subtext: Uncovering the simplicity of programming. In OOPSLA '05: Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pages 505-518. ACM Press, 2005.
11. 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.
12. M. Ernst, C. Kaplan, and C. Chambers. Predicate Dispatching: A Unified Theory of Dispatch. ECOOP, 98:12th, 1998.
13. D. L. Fisher. Data, documentation, and decision tables. Commun. ACM, 9(1):26-31, 1966.
14. T. Green and M. Petre. When Visual Programs are Harder to Read than Textual Programs. Human-Computer Interaction, 1992.
15. 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.
16. 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.
17. M. Ibramsha and V. Rajaraman. Detection of logical errors in decision table programs. Commun. ACM, 21 (12): 1016-1025, 1978.
18. R. Janicki, D. L. Parnas, and J. Zucker. Tabular representations in relational rocuments. In Relational methods in computer science, pages 184-196. Springer-Verlag, 1997.
19. 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.
20. 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.
21. P. J. H. King. Ambiguity in limited entry decision tables. Commun. ACM, 11(10):680-684, 1968.
22. H. Kirk. Use of Decision Tables in Computer Programming. Communications of the ACM, 8(1):41-43, 1965.
23. V. Kuncak and M. Rinard. Decision procedures for setvalued fields. 1st International Workshop on Abstract Interpretation of Object-Oriented Languages (AIOOL 2005), 2005.
24. N. G. Leveson. Intent specifications: An approach to building human-centered specifications. Software Engineering, 26(1): 15-35, 2000.
25. LogicGem 3.0 QuickStart. URL http://www.catalyst.com/products/logicgem/ quickstart.pdf.
26. A. Löh and R. Hinze. Open data types and open functions. Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming, pages 133-144, 2006.
27. T. Millstein. Practical predicate dispatch. Proceedings of the 19th annual ACM SIGPLAN Conference on Object-oriented programming, systems, languages, and applications, pages 345-364, 2004.
28. D. A. Moon. Object-oriented programming with flavors. In OOPLSA '86: Conference proceedings on Object-oriented programming systems, languages and applications, pages 1-8, New York, NY, USA, 1986. ACM Press.
29. B. Myers. Taxonomies of Visual Programming and Program Visualization. Journal of Visual Languages and Computing, 1(1):97-123, 1990.
30. I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Not., 8(8): 12-26, 1973.
31. J. Pane and B. Myers. Tabular and Textual Methods for Selecting Objects from a Group. Proceedings of VL 2000: IEEE International Symposium on Visual Languages, pages 157-164, 2000.
32. J. Pane and B. Myers. Usability Issues in the Design of Novice Programming Systems. Technical Report CMU-CS-96-132, School of Computer Science, Carnegie Mellon University, August 1996.
33. S. Pollack. Analysis of the Decision Rules in Decision Tables. Technical Report RM-3669-PR, Rand Corp, 1963.
34. U. Pooch. Translation of Decision Tables. ACM Computing Surveys (CSUR), 6(2):125-151, 1974.
35. W. Quine. The Problem of Simplifying Truth Functions. The American Mathematical Monthly, 59(8): 521-531, 1952.
36. B. Silberg. Detab/65 in third-generation cobol. SIGPLAN Not., 6(8):4-8, 1971.
37. StateStep Tutorial. URL http://statestep.com/tutorial/RuleInitial.html.
38. R. F. Sterbenz. Tabsol decision table preprocessor. SIGPLANNot., 6(8):33-40, 1971.
39. D. Thomas. Agile Programming: Design to Accommodate Change. IEEE Software, 22(3): 14-16, 2005.
40. 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.
41. I. Vessey and R. Weber. Structured Tools and Conditional Logic: an Empirical Investigation. Communications of the ACM, 29(1):48-57, 1986.
42. P. Wadler. Comprehending monads. Proceedings of the 1990 ACM conference on LISP and functional programming, pages 61-78, 1990.