Ruby vs Ceylon

Ruby is one of the most popular languages for developing web sites. As a result, there's an abundant amount of documentation, sample code, and libraries available for learning the language and getting your project up and running. The most popular features are just 'gem install' away. Additionally, it is easier to find Ruby jobs because of this.

Ruby has a very clean syntax that makes code easier to both read and write than more traditional Object Oriented languages, such as Java. For beginning programmers, this means the focus is on the meaning of the program, where it should be, rather than trying to figure out the meaning of obscure characters.

presidents = ["Ford", "Carter", "Reagan", "Bush1", "Clinton", "Bush2"]
for ss in 0...presidents.length
    print ss, ": ", presidents[presidents.length - ss - 1], "\n";
end

Ruby has a large ecosystem of tools and libraries for just about every use. Such as ORMs (Active Record, DatabMapper), Web Application Frameworks(Rails, Sinatra, Volt), Virtualization Orchestration(docker-api, drelict), CLI tools(Thor, Commando), GUI Frameworks(Shoes, FXRuby) and the list goes on. If you can think of it, there is probably a gem for that ( and if not you can create your own and share with the community).

The Ruby language is equipped with the necessary features to learn the essence of algorithms.

In online playground environments like ideone.com, measures have been taken to prevent beginners from going astray by restricting the use of external libraries such as Python's NumPy and SymPy.
Even in such constrained Ruby execution environments, the required features for learning algorithms are fully available.

Many of the algorithms that should be learned are documented in the book "Hello Ruby: Adventures in Coding." For example, the cake serving problem in the book leads to topological sorting, which is a graph theory concept useful in project management for creating Gantt charts.

To evaluate the effectiveness of algorithms with a level of complexity comparable to topological sorting,
it is necessary to be able to solve mathematical computation problems up to the high school level easily.
As shown in the table below, using only Ruby's standard library, it is possible to solve high school-level math problems effortlessly.
However, other programming languages may not be able to perform such computations in online playground environments.

To experience the superior performance of algorithms, it is important to challenge oneself by reimplementing good algorithms. Ruby's standard library includes implementations of excellent algorithms. For instance, the algorithm for solving linear equations, which has been widely known since the era of Fortran, is used within the code of SolvingLinearEquations through the "/" operator. Reimplementing code from Ruby's standard library serves as an excellent learning resource with high reusability and efficiency.

The SolvingLinearEquations function mentioned above demonstrates the benefits of duck typing and forced type conversion between objects of different types in arithmetic operations. While Rust also has features like duck typing, the implementation of "forced type conversion" is still far from being realized.

# Title: "(1) Cake Serving Procedure Problem"
require 'tsort'

class Hash
  include TSort
  alias tsort_each_node each_key
  def tsort_each_child(node, &block)
    fetch(node).each(&block)
  end
end

puts 'Tasks'
task_names = {
  'A' => 'Arrange the plates.',
  'B' => 'Set the spoons.',
  'C' => 'Place the birthday cake on the table.',
  'D' => 'Spread the tablecloth.'
}
p task_names

puts 'Preceding Tasks'
preceding_tasks = {
  'A' => ['D'],
  'B' => ['C', 'A'],
  'C' => ['A', 'D'],
  'D' => []
}

steps = preceding_tasks.strongly_connected_components
puts 'The appropriate steps are as follows:'
steps.each do |task_candidates|
  p task_candidates.map { |task| [task, task_names[task]] }
end

p "#(2) Equation Solving Rule"
def SolvingLinearEquations(y, a, b)
   x = (y - b) / a
end

p "(2-1) Real Solution", SolvingLinearEquations(1.0, 5, 0.5)
# => 0.1

p "(2-2) Fraction Solution", SolvingLinearEquations(Rational(1, 1), Rational(5, 1), Rational(1, 2))
# =>  (1/10)

p "(2-3) Imaginary Solution", SolvingLinearEquations(1 + 1i, 5, 1.0 / (2 + 2i))
# => (0.15+0.25i)

p "(2-4) Complex & Fraction Solution", SolvingLinearEquations(Rational(1 + 1i, 1), Rational(5, 1), Rational(1, 2 + 2i))
# => ((3/20)+(1/4)*i)

p "(2-5) Matrix Solution with Large Integers", 
   SolvingLinearEquations(Matrix[[Rational(1234567890123456789890, 1), Rational(0, 1)]],
                                                Matrix[[Rational(1234567890123456789890, 1), Rational(1234567890123456789890 * 2, 1)],
                                                             [Rational(1234567890123456789890, 1), Rational(1234567890123456789890 * 3, 1)]],
                                                Matrix[[Rational(1234567890, 1), Rational(123456789, 1)]] )
# => Matrix[[(3703703670366790122789/1234567890123456789890), (-2469135780244567900789/1234567890123456789890)]]

p "(2-7) Matrix Solution with Large Integers, Complex Numbers, and Fractions", 
     SolvingLinearEquations(Matrix[[Rational(1234567890123456789890, 1i), Rational(0, 1)]],
                                                 Matrix[[Rational(1234567890123456789890, 1), Rational(1234567890123456789890 * 2, 1i)],
                                                               [Rational(1234567890123456789890, 1), Rational(1234567890123456789890 * 3, 1i)]],
                                                Matrix[[1234567890, 0 + 1i]] )
# => Matrix[[((-3703703671/1234567890123456789890)-(3/1)*i), ((2469135781/1234567890123456789890)+(2/1)*i)]]

Lays out an easy to follow and opinionated MVC pattern that teaches best practices through necessity.

It's the fore-runner and trend setter for TDD.

Object oriented programming is one of the most important concepts in programming.

Meta-programming provides efficiency and freedom.

No indentation increase development efficiency.

It has a Web IDE: http://try.ceylon-lang.org/ with impressive demos: http://try.ceylon-lang.org/?gist=bd41b47f325b6d32514a so you can try it without installing anything, and see the JS generation / interop in action.

The compiler prevents you from using a potentially null variable, unless you check it is not null. Ie. it forces you to check a potentially null value before using it.
The type system is strict, but flexible, allowing union and intersection of types, covariant and contravariant types, reified types, etc.
Type inference and union types allows a dynamic programming style, close of JS spirit.

It brings type safety to JS, allowing to define interfaces to existing JS APIs, yet using the dynamic keyword for flexible calls in the JS ecosystem.

Ceylon has reified generics, so it doesn't loose the type of collections at runtime. This makes autocompletion, debugging, etc. first-class. The Eclipse plugin makes it a full-fledged Ceylon IDE, and an IntelliJ IDEA plugin is in the works.

Gavin King, main author of the language, has a great, clear technical writing style, making understandable difficult concepts like variance or sound type system.

The language specification is very complete and up to date; also, the language module is very well documented.

Ceylon has special language-level support for interoperation with dynamically typed languages like JavaScript, and its module system even interoperates with npm.

Ceylon is indeed fairly easy and readable. Of course those ones who know OOP and a bit of functional programming concepts will feel almost at home right from the start.

HTML generation is supported right in the SDK.

If you don't use platform-specific features, you can reuse the same code in your backend server (be it in Java or JavaScript) and in your client-side browser code, for example for storing data, validating input etc.