Skip to main content
SpringerLink
Log in

Liberate Computer User from Programming

  • Conference paper
Algebraic Methodology and Software Technology (AMAST 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5140))

  • 381 Accesses

Abstract

This paper is about computer-based problem solving methodology. The issue addressed is: can we develop a computer-based problem-solving methodology which is not based on computer programming? The answer we provide to this question is YES. This raises the next question: if we do not use programming how do we communicate problem solving algorithms to the computer? The answer to this question is: (1) develop software tools that support domain algorithm execution in the problem domain environment (no programming as usual) and (2) allow problem-domain experts to express their problem-solving algorithms using the natural language of their problem domains. We achieve this computer-based problem solving methodology by computational emancipation of the application domain, which consists of:

  1. 1

    Characterize the application domain in terms of concepts that are universal in the domain, have standalone computing meaning, and are composable.

  2. 1

    Structure the application domain using an ontology where terms denoting domain characteristic concepts are associated with computer artifacts implementing them.

  3. 1

    Develop a domain-dedicated virtual machine that executes domain algorithms expressed in the natural language of the domain (without asking to encode them into programs) and implement it on the physical computers existent in the computer-network.

With this methodology computers execute algorithms whose expressions are conceptual, similar to the way human brain would execute them.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, T., et al.: Business process execution language for web services, http://www-106.ibm.com/developerworks/webservices/library/ws-bpel/

  2. Apt, K.: From Logic Programming to PROLOG. Prentice Hall, Englewood Cliffs (1996)

    Google Scholar 

  3. Backus, J.: Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs. Comm. ACM 21(8), 613–641 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bateman, J.A.: Ontology construction and natural language. In: Proceedings of the International Workshop on Formal Ontology, Padova, Italy, pp. 83–93 (March 1993)

    Google Scholar 

  5. Berners-Lee, T., et al.: Rfc 2396: Uniform Resource Identifiers (URI): Generic Syntax (1998), www.ietf.org/rfc/rfc2396.txt

  6. Bos, J., Markert, K.: Recognizing textual entailment with logical inference. In: HLT 2005: Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, Morristown, NJ, USA, pp. 628–635 (2005)

    Google Scholar 

  7. Curtis, D.E., Rus, T.: Application driven software for chemistry. In: 2008 IEEE International Conference on Electro/Information Technology, Proceedings, Iowa State University, IA, USA (2008)

    Google Scholar 

  8. Dimitriev, S.: Language Oriented Programming: The Next Programming Paradigm, http://www.onboard.jetBrains.com

  9. Gal, A., Modica, G., Jamil, H., Eyal, A.: Automatic ontology matching using application semantics. AI Magazine, 21–31 (2005)

    Google Scholar 

  10. Gruber, T.R., Olsen, G.R.: An ontology for engineering mathematics. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), Bonn, Germany, May 24-27, 1994, pp. 258–269. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  11. Gurevich, Y.: Sequential Abstract-State Machines capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  12. Harel, D.: On Visual Formalisms. Comm. of the ACM 31(5), 514–529 (1988)

    Article  MathSciNet  Google Scholar 

  13. Harel, D.: Can Programming Be Liberated, Period? Computer 41(1), 28–37 (2008)

    Article  Google Scholar 

  14. Hilbert’s program. Stanford Encyclopedia of Philosophy, http://plato.stanford.edu/entries/hilbert-propgram

  15. Hans, K., Uwe, R.: From Discourse To Logic. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  16. IBM. Autonomic Computing, www.research.ibm.com/autonomic/

  17. Jonassen, D.H., Carr, C.S.: Mindtools: Affording Multiple Knowledge Representations for Learning. In: Computers as Cognitive Tools. No More Walls, vol. 2, pp. 165–196. Lawrence Erlbaum Associates, Mahwah (2000)

    Google Scholar 

  18. Krill, P.: Complexity is killing IT, say analysts, http://www.techworld.com

  19. McBride, B.: The Resource Description Framework (RDF) and its Vocabulary Description Language RDFS. In: Handbook on Ontologies, pp. 51–65. Springer, Heidelberg (2004)

    Google Scholar 

  20. Mernik, M., Heering, J., Soane, A.M.: When and how to develop domain-specific languages. ACM Computing Surveys 37(4), 316–344 (2005)

    Article  Google Scholar 

  21. Noy, N.F., McGuinness, D.L.: A guide to creating your first ontology, http://ksl.stanford.edu/people/dlm/papers/ontology-tutorial-noy-mcguinness-abstract.html

  22. Nagel, E., Newman, J.R.: Gödel’s Proof. New York University Press (2001)

    Google Scholar 

  23. Popek, G.J., Goldberg, R.P.: Formal requirements for virtualizable third generation architectures. Comm. of the A.C.M. 17(7), 412–421 (1974)

    MATH  MathSciNet  Google Scholar 

  24. Polya, G.: How To Solve It. Princeton University Press, Princeton (1973)

    Google Scholar 

  25. Rus, T., Curtis, D.E.: Application driven software development. In: International Conference on Software Engineering Advances, Proceedings, Tahiti (2006)

    Google Scholar 

  26. Rus, T., Curtis, D.E.: Toward application driven software technology. In: The 2007 World Congress in Computer Science, Computer Engineering, and Applied Computing, WORLDCOMP 2007, Las Vegas, USA (2007)

    Google Scholar 

  27. Rus, T., et al.: TICS: A component based language processing environment, http://www.cs.uiowa.edu/~rus

  28. Rus, T.: IPCsem: An Interactive LR Parser Construction with Semantic Functions, http://www.cs.uiowa.edu/~rus

  29. Rus, T., Halverson, T.: A Language Independent Scanner Generator, http://www.cs.uiowa.edu/~rus

  30. Smith, D.C., Cypher, A.: Making programming easier for children. Morgan Kaufmann Series In Interactive Technologies (1998)

    Google Scholar 

  31. Shneiderman, B.: Creativity support tools – accelerating discovery and innovation. Comm. of the ACM 50(12), 10–31 (2007)

    Article  Google Scholar 

  32. Simonyi, C.: The Death of Computer Languages, The Birth of Intentional Programming. Technical Report MSR–TR–95–52, Microsoft (1995)

    Google Scholar 

  33. Staab, S., Studer, R. (eds.): Handbook on Ontologies. Springer, Heidelberg (2004)

    Google Scholar 

  34. Tekinay, S., Wing, J.: Cyber-enabled discovery and innovation. Computing Research News 19(5) (November 2007)

    Google Scholar 

  35. Ward, M.P.: Language-Oriented Programming. Software — Concepts and Tools 15(4), 147–161 (1994)

    Google Scholar 

  36. Wing, J.M.: Computational thinking. Comm. of the ACM 49(3), 33–35 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Iowa, Iowa City, IA, USA

    Teodor Rus

Authors
  1. Teodor Rus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Meseguer Grigore Roşu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rus, T. (2008). Liberate Computer User from Programming. In: Meseguer, J., Roşu, G. (eds) Algebraic Methodology and Software Technology. AMAST 2008. Lecture Notes in Computer Science, vol 5140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79980-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79980-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79979-5

  • Online ISBN: 978-3-540-79980-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation