Aidan Pieper Plastix

## gist:5823184

      
              1 file
            
          
              114 forks
            
          
              30 comments
            
          
              568 stars
            
          
                dodyg
                / gist:5823184
            
            
              Last active
              March 29, 2024 03:59
            
              
                Kotlin Programming Language Cheat Sheet Part 1
              
          
    #Intro
Kotlin is a new programming language for the JVM. It produces Java bytecode, supports Android and generates JavaScript. The latest version of the language is Kotlin M5.3
Kotlin project website is at kotlin.jetbrains.org.
All the codes here can be copied and run on Kotlin online editor.
Let's get started.

  
## osx-for-hackers.sh
#!/bin/sh

###
# SOME COMMANDS WILL NOT WORK ON macOS (Sierra or newer)
# For Sierra or newer, see https://github.com/mathiasbynens/dotfiles/blob/master/.macos
###

# Alot of these configs have been taken from the various places
# on the web, most from here
# https://github.com/mathiasbynens/dotfiles/blob/5b3c8418ed42d93af2e647dc9d122f25cc034871/.osx

## Y_combinator.ss

;                          Stumbling towards Y
;
; The applicative-order Y combinator is a function that allows one
; to create a recursive function without using define.
; This may seem strange. Usually a recursive function has to call
; itself, and thus relies on itself having been defined.
;
; Regardless, here we will stumble towards the implementation of the
; Y combinator (in Scheme).
	#!/bin/sh

	###
	# SOME COMMANDS WILL NOT WORK ON macOS (Sierra or newer)
	# For Sierra or newer, see https://github.com/mathiasbynens/dotfiles/blob/master/.macos
	###

	# Alot of these configs have been taken from the various places
	# on the web, most from here
	# https://github.com/mathiasbynens/dotfiles/blob/5b3c8418ed42d93af2e647dc9d122f25cc034871/.osx

	; Stumbling towards Y
	;
	; The applicative-order Y combinator is a function that allows one
	; to create a recursive function without using define.
	; This may seem strange. Usually a recursive function has to call
	; itself, and thus relies on itself having been defined.
	;
	; Regardless, here we will stumble towards the implementation of the
	; Y combinator (in Scheme).