-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
14 changed files
with
409 additions
and
131 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,131 @@ | ||
|
||
<!DOCTYPE html> | ||
<html> | ||
<head> | ||
<meta charset="utf-8"/> | ||
<title>works in public</title> | ||
<link rel="stylesheet" href="/style.css"/> | ||
</head> | ||
<body> | ||
<div class="way"> | ||
<a href="/index.html">cover</a> | ||
</div> | ||
<div class="holding tight"> | ||
<h1 id="todo">todo</h1> | ||
|
||
<h2 id="format">format</h2> | ||
|
||
<ul> | ||
<li>[ ] deal with frames and page breaks on minted; <a href="https://tex.stackexchange.com/questions/433192/breaking-pages-in-minted-package">https://tex.stackexchange.com/questions/433192/breaking-pages-in-minted-package</a></li> | ||
<li>deal with inline quotes properly (using the <code>dirtytalk</code> package)</li> | ||
<li>harmonize spacers</li> | ||
<li>add index</li> | ||
<li>harmonize spacer and spacersmall</li> | ||
</ul> | ||
|
||
<h2 id="conclusion">conclusion</h2> | ||
|
||
<ul> | ||
<li>[ ] add a footnote about Brenda : Brenda Baker undertook her Fortan-to-Ratfor converter against the advice of her department head–me. I thought it would likely produce an ad hoc reordering of the orginal, freed of statement numbers, but otherwise no more readable than a properly indented Fortran program. Brenda proved me wrong. She discovered that every Fortran program has a canonically structured form. Programmers preferred the canonicalized form to what they had originally written. <a href="https://web.archive.org/web/20200315093052/https://minnie.tuhs.org/pipermail/tuhs/2020-March/020664.html">source</a></li> | ||
</ul> | ||
|
||
<h2 id="chap-4---programming">chap 4 - programming</h2> | ||
|
||
<ul> | ||
<li> | ||
<p>rewrite intro of chap once the whole thing is re-read</p> | ||
</li> | ||
<li> | ||
<p><strong>case studies</strong></p> | ||
<ul> | ||
<li>choose the case-studies in the way that is the most illustrative of my point. doesn’t have to be huge.</li> | ||
<li>i should definitely have a more comparative approach: multiple code-bases, with aesthetics which are tied to <strong>LANGUAGE</strong>, <strong>COMMUNITY</strong> and <strong>PROBLEM</strong> (question of the idiomatic). this is better than having one case study after another, completely discontinued.</li> | ||
<li>find similar problems in different programs, see how they deal with it</li> | ||
<li>find specific cases where the cognitive load is high</li> | ||
<li>again, <strong>DO IT IN PARALLEL</strong> as a comparative studies.</li> | ||
</ul> | ||
</li> | ||
</ul> | ||
|
||
<h3 id="programming-languages">programming languages</h3> | ||
|
||
<h3 id="styles">styles</h3> | ||
|
||
<ul> | ||
<li>[ ] language design \url{http://rigaux.org/language-study/syntax-across-languages/}</li> | ||
<li> | ||
<p>[ ] add marielle macé to a bit of conclusion on the styles of programmers</p> | ||
</li> | ||
<li>for fig. 62 (self_inspect), step through a computer interpretation of the process, before giving a literary interpretation of the process.</li> | ||
<li>for the code poems, I need to be able to articulate their relevance when looking at different domains. they’re not just related to literature, but also architecture (follies, pavillions) or math (pure math), while other source code (linux kernel) might also be a sort of literature (legal code). but also make it explicit that i talk about the ones that can run, not the code poems that are not executable</li> | ||
<li>in the case of list comprehension in Python, it is both a technical and social environment</li> | ||
</ul> | ||
|
||
<h3 id="functions">functions</h3> | ||
|
||
<ul> | ||
<li>[ ] rather than having 5.3 as this total disconnect, maybe start by writing a monolith to avoid the pitfalls of structure. particularly because at this point i need to synthesize. rather work on <em>connections and disconnections</em> between the social and the functional?</li> | ||
<li>[ ] re-quote hayles and her regime of computation (surface, depth, etc.) when i also talk about paloque berges et. al.</li> | ||
</ul> | ||
|
||
<h2 id="chap-3---beauty">chap 3 - beauty</h2> | ||
|
||
<h3 id="aesthetics">aesthetics</h3> | ||
|
||
<ul> | ||
<li>mention that knowledge influences how we perceive things (brandy, mathematical beauty)</li> | ||
<li>from sy brand talk, gabrielle starr, feeling beauty: the neuroaesthetics of the experience: “Aesthetic response enables the comparison and integration of novel kinds of reward in a process that opens possibilities for new knowledge, or new ways of negotiating the world. The perceptions, images, and emotions we find through our experience of poetry, painting and music put ideas and events into relation with one another that would rarely, if ever, be possible outside the arts.”</li> | ||
</ul> | ||
|
||
<h3 id="literature">literature</h3> | ||
|
||
<ul> | ||
<li>In literature, include rousset: forme et signification</li> | ||
<li>remove god and xml example?</li> | ||
</ul> | ||
|
||
<h3 id="architecture">architecture</h3> | ||
|
||
<ul> | ||
<li>add more code examples (check the architecture of open source applications? redis?)</li> | ||
</ul> | ||
|
||
<h3 id="mathematics">mathematics</h3> | ||
|
||
<ul> | ||
<li>mathematics: add a discussion of dijkstra’s shortest path algorithm?</li> | ||
<li>add knuth on dijkstra, simple program, complex proof (knuth, simple, 1990)</li> | ||
</ul> | ||
|
||
<h2 id="chap-2---understanding">chap 2 - understanding</h2> | ||
|
||
<ul> | ||
<li>[ ] recs from guido, neuropsychologists who might be interested: stanislas dehaene and christophe paillier</li> | ||
<li>[ ] <strong>levels of software</strong> (<a href="https://nshipster.com/as-we-may-code/">as we may code</a>) highlights the need for such a thing (quoting: What if, instead of lowering source code down for the purpose of execution, we raised source code for the purpose of understanding?)</li> | ||
<li>[ ] <strong>tools</strong> add to means of understanding and IDEs deciding how we write: <a href="https://thorstenball.com/blog/2020/02/04/how-much-do-we-bend-to-the-will-of-our-tools/">https://thorstenball.com/blog/2020/02/04/how-much-do-we-bend-to-the-will-of-our-tools/</a></li> | ||
<li>[ ] <strong>tools</strong> including a discussion of how does step in a debugger relate to code as terrain, or surface coverage for tests? e.g. how does build and architecture related to code as structure?</li> | ||
<li>[ ] include the concept of interface by matthew kirschenbaum <a href="https://www.researchgate.net/profile/Nancy-Ide/publication/229666751_Preparation_and_Analysis_of_Linguistic_Corpora/links/5a75ec770f7e9b41dbd04d97/Preparation-and-Analysis-of-Linguistic-Corpora.pdf#page=550">https://www.researchgate.net/profile/Nancy-Ide/publication/229666751_Preparation_and_Analysis_of_Linguistic_Corpora/links/5a75ec770f7e9b41dbd04d97/Preparation-and-Analysis-of-Linguistic-Corpora.pdf#page=550</a></li> | ||
<li>[ ] <strong>programmer metaphors</strong> my approach to metaphors should be more systematic: that is, I should look into how metaphors can represent a SYSTEM (for instance, <code>symlink</code> is a limitation when it comes to the files and folder metaphor)</li> | ||
<li>[ ] <strong>programmer metaphors</strong> metaphor of the <code>macro</code> (implies scale), of <code>scope</code>, of <code>global</code>, implies scale as well. <code>libraries</code> is also a metaphor that is literary.</li> | ||
<li>[ ] <strong>programmer metaphors</strong> refer to master/slave as a problematic one</li> | ||
</ul> | ||
|
||
<h2 id="chap-1---ideals">chap 1 - ideals</h2> | ||
|
||
<ul> | ||
<li>[ ] add a subsubsec on verbosity?</li> | ||
<li> | ||
<p>[ ] harmonize subsubsection (Smells -> smelly?)</p> | ||
</li> | ||
<li>[ ] add <a href="../readings/notes/pressman_software_engineering_practicioners_approach.md">pressman - software engineering: a practicioner’s approach</a> in the part about software developers</li> | ||
</ul> | ||
|
||
<h2 id="introduction">introduction</h2> | ||
|
||
<ul> | ||
<li>explain that beauty might be a metaphor itself of “good” (value judgments, etc.)</li> | ||
</ul> | ||
|
||
</div> | ||
</body> | ||
</html> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
#include <stdio.h> | ||
|
||
int main() | ||
{ | ||
int max_count = 5; | ||
struct int my_list[max_count] = {2046, 2047, 2048, 2049, 2050}; | ||
|
||
for (int i = 0; i < max_count; i++) | ||
{ | ||
printf("%d", my_list[i]); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,4 @@ | ||
my_list = [2046, 2047, 2048, 2049, 2050] | ||
|
||
for item in my_list: | ||
print(item) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,9 @@ | ||
package main | ||
|
||
func getNumbers() (int, float64, int) { | ||
return 1, 2.0, 3 | ||
} | ||
|
||
func main() { | ||
first, _, third := getNumbers() | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,8 @@ | ||
let getNumbers = () => { | ||
return [1, 2.0, 3] | ||
} | ||
|
||
|
||
numbers = getNumbers() | ||
first = numbers[0] | ||
second = numbers[2] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
package main | ||
|
||
import ( | ||
"fmt" | ||
"math/rand" | ||
"time" | ||
) | ||
|
||
func recall(date int) { | ||
random_delay := (rand.Int() % 5) + 1 | ||
time.Sleep(time.Second * time.Duration(random_delay)) | ||
fmt.Println(date) | ||
} | ||
|
||
func main() { | ||
recall(2045) | ||
recall(2046) | ||
|
||
fmt.Println("We're done!") | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.