An Assessment on the Easiness of Computer Languages
Kevin Xu, Jingsong Zhang, Shelby Gao
Journal of Information Technology Review, Vol. 1, No. 2, 2010.
DOI: 
Link: http://www.dline.info/jitr/fulltext/v1n201.pdf
Abstract:
Expressive power has been well-established as a dimension of measuring the quality of a computer language. Easiness is another dimension. It is the main stream of development in programming language and database management. In this article, we make the following assessment on the easiness of computer languages: 1) A data model is easier to use than a programming language in the development and maintenance of those applications expressible in the data model; 2) if one data model is more expressive than another data model, the former is easier than the latter in the development and maintenance of those applications where a programming language is involved; and 3) A unifi cation, i.e., a system having both a data model semantically equivalent to a class of total recursive functions and a programming language, achieves the greatest possible ease. We materialize the assessment with the following facts: 1) A data model is semantically within a class of total recursive functions while a programming is semantically within a class of partial recursive functions; 2) A data model arranges the managed objects in orders including at least one dependent order; and 3) The objects represented for both business data and business logic, in the case of a unifi cation, obey the orders enforced by the data model.