This is a language designed and implemented by Caleb Thompson and Goose Mongeau.
You can call it Dagon for short.
fibonacci-recursive(n): # fuckin hyphens instead of underscores.
if n <= 1, return n #leading conditionals. comma rather than semicolon to separate statements
self(n - 1) + self(n - 2)
fibonacci-imperative(n):
current: 0
next: 1
n.times
temp: next
next +: current
current: temp
current
puts "Hello World"
Outputs strings "Hello " "World\n" (same result as above):
print "Hello "
print "World\n"
x: 1
Integer x: 1 # strongly typed
x: "string" # raises error or warning: Invalid type (assigning String to Integer)
/^(?:[A-Z][a-z]+)+:$/
MyClass:
# here lies the definition
Plant:
# defintion
Tree(Plant):
# tree stuff
/^(?:[a-z]+-?)+[^-][()]?:\n $/
do-stuff:
# definition
stuff:
# definition
print():
# definition
/^(?:[a-z]+-?)+[^-]: $/
name: # value
another-name: # value
Dagon is released under the MIT License