Ossus on Coding braindump

Programming Languages Part C

Tue, 06 Nov 2018 20:37:00 +0100

Unfortunately, the homework files have been lost - maybe I will go back and revisit them some day

Programming Languages Part B

Wed, 30 May 2018 22:17:00 +0200

State “DONE” from “ACTIVE” [2018-05-30 Wed 22:17] Uses cracket to introduce functional programming concepts. This course is a pretty advanced course on functional programming. It uses SML in its Part A and mostly reverts to cRacket in part B.

DONE Week 1

State “DONE” from [2018-09-08 Sat 20:13]

Not yet used org-mode to take notes

DONE Week 2

State “DONE” from [2018-08-13 Mon 00:34]

DONE Reading

State “DONE” from [2018-08-13 Mon 00:34]

Datatype-Programming w/o datatypes

In ML we used datatype bindings to define own one-of types, including recursive dataypes for tree-based data. This introduces a new type into the static environment along with constructors. cRacket - as a dynamically typed language - has nothing directly corresponding to dataype-bindings, but it does support the same sort of data definitions and programmign.

From NAND to Tetris I

Mon, 01 Jan 0001 00:00:00 +0000

The course has a very ambitious agenda, namely to build a full-purpose computer from scratch by using a Hardware Simulator, gate logic and first principles. It is one of the courses that I have enjoyed the most. When learning programming, I sometimes felt that there was a significant gap: Basically, programming starts at a very high level of abstraction. All the chipsets etc. are abstracted away from. But what does it really mean when we say that a computer only understands 0s and 1s? This course aims at filling this gap. It is highly entertaining and enjoyable with well-thought out, difficult projects, that are a lot of fun.

From NAND to Tetris II

Mon, 01 Jan 0001 00:00:00 +0000

Continuation of nand2tetris. in part 1 we have built the basic building blocks of a general purpose machine. We have gone from simple and more complicated logic gates to an actual running program, several programs in fact. starting from that we have built a von-Neumann-architecture. We have finished the last course by building an assembler. So basically we have gone from a simple hardware solution which is able to detect zeros and ones; finally we want to translate the programmer’s ideas into machine language. In this part of the course we treat the hack computer as an abstraction, we do not care about the underlying hardware solution. In this course, we actually think more ’top-down’. We start with the human programmer and her ideas about how to implement them. We introduce ‘jack’, which is an easy programming language.

Open Source Society University (OSSU)

Mon, 01 Jan 0001 00:00:00 +0000

The OSSU curriculum is a complete education in computer science using online materials. It’s not merely for career training or professional development. It’s for those who want a proper, well-rounded grounding in concepts fundamental to all computing disciplines, and for those who have the discipline, will, and (most importantly!) good habits to obtain this education largely on their own, but with support from a worldwide community of fellow learners.

Programming Languages C - Week 1

Mon, 01 Jan 0001 00:00:00 +0000

Ruby Features most interesting for a PL Course

Ruby is purely object-oriented, i.e. all values are objects.
Ruby is class-based; every object is an instance of a class. Not all oo languages are class-based, e.g. Java.
Ruby has mixins; which strike a compromise between multiple inheritance (like in C++) and interfaces (Java). Every Ruby class has one superclass but can include any number of mixins, which can define methods.
Ruby is dynamically typed.
Ruby has many dynamic features
Ruby has convenient reflection: Built-in methods make it easy to discover at run-time properties about objects.
Ruby has blocks and closures: It is rare in Ruby to use an explicit loop since collection classes like ‘ARRAY’ define so many useful iterators.
Ruby is a scripting language: It means the language is engineered towar making it easy to write short programs, providing convenient access to manipulating files and strings with less concern for performance. Ruby does not require you to declare variables before using them.
Ruby is popular for web applications; particularly with the Ruby on Rails framework.

Rules of Class-Based OOP

All values are references to objects

Programming Languages C - Week 2

Mon, 01 Jan 0001 00:00:00 +0000

OOP vs. Functional Decomposition

When implementing operations for a small expression language, we can compare OOP vs. functional decomposition. In functional programming, we typically break programs down into functions that perform some operation. in OOP we typically break programs down into classes that give behavior to some kind of data. Consider the following 2D matrix for a small expression language:

	eval	toString	hasZero
Int
Add
Negate

Functional Approach

In functional languages, the standard style is do to the following:

Programming Languages C - Week 3

Mon, 01 Jan 0001 00:00:00 +0000

A key source of expressiveness in ML’s type system (not rejecting too many programs that do nothing wrong and programmers are likely to write) is parametric polymorphism, also known as generics. We should also study static types of OOP languages, such as Java. The main thing we want to prevent is “method missing” errors, i.e. sending a message to an object that has no method for that message. The source of type-system expressiveness most fundamental to OOP is subtype polymorphism also known as subtyping.

Programming Languages Part A

Mon, 01 Jan 0001 00:00:00 +0000

CLOSE[2018-04-05 Thu 00:07] Uses lisp and cracket to introduce functional programming concepts - no further notes.